[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 copied-rely-DMSQLInv (conclusion) (back to tree)

⊦ ls.tid ≠ tid0 ∧ DMSQGInv(gs) ∧ DMSQLInv(gs, ls, pc) ∧ lstep(gs, ls, pc, a, gs0, ls0, pc0) → DMSQRely(gs, tid0, gs0)

System applied rule normalize

And obtained the following new goals

Rule argument

Additional information

Proof step 2 from proof copied-rely-DMSQLInv (previous step) (back to tree)

ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), lstep(gs, ls, pc, a, gs0, ls0, pc0), ¬ DMSQRely(gs, tid0, gs0) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:lstep, seq:⊦ lstep(gs, ls, pc, a, gs0, ls0, pc0) ↔ pre(gs, ls, pc, a) ∧ ls0 = lstepf(gs, ls, pc, a) ∧ gs0 = gstepf(gs, ls, pc, a) ∧ pc0 = pcstepf(gs, ls, pc, a), subst:[a, ls0, pc0, pc, gs0, ls, gs] → [a, ls0, pc0, pc, gs0, ls, gs], <all paths>

Additional information

Used terms: a, ls0, pc0, pc, gs0, ls, gs

Proof step 3 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ lstep(gs, ls, pc, a, gs0, ls0, pc0) ↔ pre(gs, ls, pc, a) ∧ ls0 = lstepf(gs, ls, pc, a) ∧ gs0 = gstepf(gs, ls, pc, a) ∧ pc0 = pcstepf(gs, ls, pc, a)

A spec-lemma

Proof step 4 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a), ¬ DMSQRely(gs, tid0, gs0) ⊦

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: pc

Additional information

Used simplifier rules: Relypred-reflexive: ⊦ DMSQGInv(gs) → DMSQRely(gs, tid, gs); Relypred-reflexive: ⊦ DMSQGInv(gs) → DMSQRely(gs, tid, gs); Relypred-reflexive: ⊦ DMSQGInv(gs) → DMSQRely(gs, tid, gs); Relypred-reflexive: ⊦ DMSQGInv(gs) → DMSQRely(gs, tid, gs); Relypred-reflexive: ⊦ DMSQGInv(gs) → DMSQRely(gs, tid, gs); Relypred-reflexive: ⊦ DMSQGInv(gs) → DMSQRely(gs, tid, gs); Relypred-reflexive: ⊦ DMSQGInv(gs) → DMSQRely(gs, tid, gs); Relypred-reflexive: ⊦ DMSQGInv(gs) → DMSQRely(gs, tid, gs); Relypred-reflexive: ⊦ DMSQGInv(gs) → DMSQRely(gs, tid, gs); Relypred-reflexive: ⊦ DMSQGInv(gs) → DMSQRely(gs, tid, gs); Relypred-reflexive: ⊦ DMSQGInv(gs) → DMSQRely(gs, tid, gs); Relypred-reflexive: ⊦ DMSQGInv(gs) → DMSQRely(gs, tid, gs); Relypred-reflexive: ⊦ DMSQGInv(gs) → DMSQRely(gs, tid, gs); Relypred-reflexive: ⊦ DMSQGInv(gs) → DMSQRely(gs, tid, gs); Relypred-reflexive: ⊦ DMSQGInv(gs) → DMSQRely(gs, tid, gs); Relypred-reflexive: ⊦ DMSQGInv(gs) → DMSQRely(gs, tid, gs); Relypred-reflexive: ⊦ DMSQGInv(gs) → DMSQRely(gs, tid, gs); Relypred-reflexive: ⊦ DMSQGInv(gs) → DMSQRely(gs, tid, gs); Relypred-reflexive: ⊦ DMSQGInv(gs) → DMSQRely(gs, tid, gs); Relypred-reflexive: ⊦ DMSQGInv(gs) → DMSQRely(gs, tid, gs); Relypred-reflexive: ⊦ DMSQGInv(gs) → DMSQRely(gs, tid, gs); Relypred-reflexive: ⊦ DMSQGInv(gs) → DMSQRely(gs, tid, gs); Relypred-reflexive: ⊦ DMSQGInv(gs) → DMSQRely(gs, tid, gs); Relypred-reflexive: ⊦ DMSQGInv(gs) → DMSQRely(gs, tid, gs); Relypred-reflexive: ⊦ DMSQGInv(gs) → DMSQRely(gs, tid, gs); Relypred-reflexive: ⊦ DMSQGInv(gs) → DMSQRely(gs, tid, gs); Relypred-reflexive: ⊦ DMSQGInv(gs) → DMSQRely(gs, tid, gs); Relypred-reflexive: ⊦ DMSQGInv(gs) → DMSQRely(gs, tid, gs); Relypred-reflexive: ⊦ DMSQGInv(gs) → DMSQRely(gs, tid, gs); DMSQPC freely generated by D1, D2, D3, D4, D5, D6, D7, D8, D9, D10, D11, D12, D13, D14, D15, D16, D17, D18, D19, D20, D21, D22, D23, D24, D25, D26, D27, D28, D29, D30, D31, D32, D33, D34, E1, E2, E3, E4, E5, E6, E7, E8, E9, E10, E11, E12, E13, E14, E15, E16, E17, crashed, idle, ready ;; ⊦ pre(gs, ls, ready, a) ↔ (∃ value0. a = invENQ(ls.tid, value0)) ∨ a = invDEQ(ls.tid); (s) ⊦ gstepf(gs, ls, ready, a) = gs; (s) ⊦ pre(gs, ls, idle, a) ↔ a = callRUN(ls.tid); (s) ⊦ gstepf(gs, ls, idle, callRUN(ls.tid)) = gs; (s) ⊦ pre(gs, ls, crashed, a) ↔ false; (s) ⊦ pre(gs, ls, E17, a) ↔ a = retENQ(ls.tid); (s) ⊦ gstepf(gs, ls, E17, retENQ(ls.tid)) = gs; (s) ⊦ pre(gs, ls, E16, a) ↔ a = τ; (s) ⊦ gstepf(gs, ls, E16, τ) = gs; (s) ⊦ pre(gs, ls, E13, a) ↔ a = τ; (s) ⊦ gstepf(gs, ls, E13, τ) = gs; (s) ⊦ pre(gs, ls, E10, a) ↔ a = τ; (s) ⊦ gstepf(gs, ls, E10, τ) = gs; (s) ⊦ pre(gs, ls, E8, a) ↔ a = τ; (s) ⊦ gstepf(gs, ls, E8, τ) = gs; (s) ⊦ pre(gs, ls, E7, a) ↔ a = τ; (s) ⊦ gstepf(gs, ls, E7, τ) = gs; (s) ⊦ pre(gs, ls, E6, a) ↔ a = τ; (s) ⊦ gstepf(gs, ls, E6, τ) = gs; (s) ⊦ pre(gs, ls, E5, a) ↔ a = τ; (s) ⊦ gstepf(gs, ls, E5, τ) = gs; (s) ⊦ pre(gs, ls, E4, a) ↔ a = τ; (s) ⊦ gstepf(gs, ls, E4, τ) = gs; (s) ⊦ pre(gs, ls, D34, a) ↔ a = retDEQ(ls.tid, ls.optval); (s) ⊦ gstepf(gs, ls, D34, retDEQ(ls.tid, optval)) = gs; (s) ⊦ pre(gs, ls, D33, a) ↔ a = τ; (s) ⊦ gstepf(gs, ls, D33, τ) = gs; (s) ⊦ pre(gs, ls, D32, a) ↔ a = τ; (s) ⊦ gstepf(gs, ls, D32, τ) = gs; (s) ⊦ pre(gs, ls, D27, a) ↔ a = τ; (s) ⊦ gstepf(gs, ls, D27, τ) = gs; (s) ⊦ pre(gs, ls, D26, a) ↔ a = τ; (s) ⊦ gstepf(gs, ls, D26, τ) = gs; (s) ⊦ pre(gs, ls, D25, a) ↔ a = τ; (s) ⊦ gstepf(gs, ls, D25, τ) = gs; (s) ⊦ pre(gs, ls, D20, a) ↔ a = τ; (s) ⊦ gstepf(gs, ls, D20, τ) = gs; (s) ⊦ pre(gs, ls, D18, a) ↔ a = τ; (s) ⊦ gstepf(gs, ls, D18, τ) = gs; (s) ⊦ pre(gs, ls, D15, a) ↔ a = τ; (s) ⊦ gstepf(gs, ls, D15, τ) = gs; (s) ⊦ pre(gs, ls, D12, a) ↔ a = τ; (s) ⊦ gstepf(gs, ls, D12, τ) = gs; (s) ⊦ pre(gs, ls, D11, a) ↔ a = τ; (s) ⊦ gstepf(gs, ls, D11, τ) = gs; (s) ⊦ pre(gs, ls, D10, a) ↔ a = τ; (s) ⊦ gstepf(gs, ls, D10, τ) = gs; (s) ⊦ pre(gs, ls, D9, a) ↔ a = (gs.qrl = [] ⊃ checkEmp(ls.tid);τ); (s) ⊦ gstepf(gs, ls, D9, a) = gs; (s) ⊦ pre(gs, ls, D8, a) ↔ a = τ; (s) ⊦ gstepf(gs, ls, D8, τ) = gs; (s) ⊦ pre(gs, ls, D7, a) ↔ a = τ; (s) ⊦ gstepf(gs, ls, D7, τ) = gs; (s) ⊦ pre(gs, ls, D6, a) ↔ a = τ; (s) ⊦ gstepf(gs, ls, D6, τ) = gs; (s) ⊦ pre(gs, ls, D5, a) ↔ a = τ; (s) ⊦ gstepf(gs, ls, D5, τ) = gs; (s) ⊦ pre(gs, ls, D1, a) ↔ a = τ; (s) ⊦ gstepf(gs, ls, D1, τ) = gs; (s)

Proof step 5 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D2, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a), ¬ DMSQRely(gs, tid0, gs0) ⊦

User applied rule subst equation

And obtained the following new goals

Rule argument

pos: left 3, flags: discard

Additional information

Proof step 6 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D2, a), ls0 = lstepf(gs, ls, D2, a), pc0 = pcstepf(gs, ls, D2, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, D2), pre(gs, ls, D2, a), ¬ DMSQRely(gs, tid0, gs0) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:pre-D2, seq:⊦ pre(gs, ls, D2, a) ↔ (∃ rvref0, optval00. (¬ rvref0 ∈ gs.vrvHp ∧ ¬ rvref0 ∈ gs.prvHp ∧ rvref0 ≠ null) ∧ a = chooseD2(rvref0, optval00)) ∨ a = τ ∧ ¬ (∃ rvref0, optval00. ¬ rvref0 ∈ gs.vrvHp ∧ ¬ rvref0 ∈ gs.prvHp ∧ rvref0 ≠ null), subst:[gs, ls, a] → [gs, ls, a], <all paths>

Additional information

Used terms: gs, ls, a

Proof step 7 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ pre(gs, ls, D2, a) ↔ (∃ rvref0, optval00. (¬ rvref0 ∈ gs.vrvHp ∧ ¬ rvref0 ∈ gs.prvHp ∧ rvref0 ≠ null) ∧ a = chooseD2(rvref0, optval00)) ∨ a = τ ∧ ¬(∃ rvref0, optval00. ¬ rvref0 ∈ gs.vrvHp ∧ ¬ rvref0 ∈ gs.prvHp ∧ rvref0 ≠ null)

A spec-lemma

Proof step 8 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D2, a), ls0 = lstepf(gs, ls, D2, a), pc0 = pcstepf(gs, ls, D2, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, D2), ¬ DMSQRely(gs, tid0, gs0), (∃ rvref0, optval00. (¬ rvref0 ∈ gs.vrvHp ∧ ¬ rvref0 ∈ gs.prvHp ∧ rvref0 ≠ null) ∧ a = chooseD2(rvref0, optval00)) ∨ a = τ ∧ ¬(∃ rvref0, optval00. ¬ rvref0 ∈ gs.vrvHp ∧ ¬ rvref0 ∈ gs.prvHp ∧ rvref0 ≠ null) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 8

Additional information

Used simplifier rules: Relypred-reflexive: ⊦ DMSQGInv(gs) → DMSQRely(gs, tid, gs); ⊦ gstepf(gs, ls, D2, τ) = gs; (s)

Proof step 9 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D2, a), ls0 = lstepf(gs, ls, D2, a), pc0 = pcstepf(gs, ls, D2, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, D2), ¬ DMSQRely(gs, tid0, gs0), ∃ rvref0, optval00. (¬ rvref0 ∈ gs.vrvHp ∧ ¬ rvref0 ∈ gs.prvHp ∧ rvref0 ≠ null) ∧ a = chooseD2(rvref0, optval00) ⊦

User applied rule exists left

And obtained the following new goals

Rule argument

pos: left 8

Additional information

Proof step 10 from proof copied-rely-DMSQLInv (previous step) (back to tree)

a = chooseD2(rvref0, optval00), gs0 = gstepf(gs, ls, D2, a), ls0 = lstepf(gs, ls, D2, a), pc0 = pcstepf(gs, ls, D2, a), ls.tid ≠ tid0, rvref0 ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, D2), ¬ DMSQRely(gs, tid0, gs0), ¬ rvref0 ∈ gs.prvHp, ¬ rvref0 ∈ gs.vrvHp ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:rely-D2-D3, seq:⊦ ls.tid ≠ tid0 ∧ ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns (gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D2, a) ∧ pcstepf(gs, ls, D2, a) = D3 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D2, a).orl) ∧ gstepf(gs, ls, D2, a).vtail ∈ gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl from gs.vtail ∧ gstepf(gs, ls, D2, a).phead ∈ gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl from gs.phead ∧ gstepf(gs, ls, D2, a).vhead ∈ gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl from gs.vhead ∧ equalrl (gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D2, a).vs, gstepf(gs, ls, D2, a).ps) ∧ equalowns (gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D2, a).vs, gstepf(gs, ls, D2, a).ps, gstepf(gs, ls, D2, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, D2, a).vretRefs(tid0) ∧ ( gs.pretRefs(tid0) = gstepf(gs, ls, D2, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D2, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D2, a).rvowns, gs.vrvHp) ∧ rvrely (tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D2, a).vretRefs, gstepf(gs, ls, D2, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, D2, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D2, a).prvHp) ∧ noidRely (tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl, gstepf(gs, ls, D2, a).vs) ∧ nextnottidRely (tid0, gs.vhead, gs.vs, gstepf(gs, ls, D2, a).vhead, gstepf(gs, ls, D2, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, D2, a).owns), subst:[ls, tid0, gs, a] → [ls, tid0, gs, a]

Additional information

Used terms: ls, tid0, gs, a

Proof step 11 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ ls.tid ≠ tid0 ∧ ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D2, a) ∧ pcstepf(gs, ls, D2, a) = D3 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D2, a).orl) ∧ gstepf(gs, ls, D2, a).vtail ∈ gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl from gs.vtail ∧ gstepf(gs, ls, D2, a).phead ∈ gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl from gs.phead ∧ gstepf(gs, ls, D2, a).vhead ∈ gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D2, a).vs, gstepf(gs, ls, D2, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D2, a).vs, gstepf(gs, ls, D2, a).ps, gstepf(gs, ls, D2, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, D2, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, D2, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D2, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D2, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D2, a).vretRefs, gstepf(gs, ls, D2, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, D2, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D2, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl, gstepf(gs, ls, D2, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, D2, a).vhead, gstepf(gs, ls, D2, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, D2, a).owns)

Lemma rely-D2-D3

Proof step 12 from proof copied-rely-DMSQLInv (previous step) (back to tree)

a = chooseD2(rvref0, optval00), gs0 = gstepf(gs, ls, D2, a), ls0 = lstepf(gs, ls, D2, a), pc0 = pcstepf(gs, ls, D2, a), ls.tid ≠ tid0, rvref0 ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, D2), ¬ DMSQRely(gs, tid0, gs0), ¬ rvref0 ∈ gs.prvHp, ¬ rvref0 ∈ gs.vrvHp, ls.tid ≠ tid0 ∧ ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D2, a) ∧ pcstepf(gs, ls, D2, a) = D3 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D2, a).orl) ∧ gstepf(gs, ls, D2, a).vtail ∈ gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl from gs.vtail ∧ gstepf(gs, ls, D2, a).phead ∈ gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl from gs.phead ∧ gstepf(gs, ls, D2, a).vhead ∈ gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D2, a).vs, gstepf(gs, ls, D2, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D2, a).vs, gstepf(gs, ls, D2, a).ps, gstepf(gs, ls, D2, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, D2, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, D2, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D2, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D2, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D2, a).vretRefs, gstepf(gs, ls, D2, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, D2, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D2, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl, gstepf(gs, ls, D2, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, D2, a).vhead, gstepf(gs, ls, D2, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, D2, a).owns) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 12

Additional information

Proof step 13 from proof copied-rely-DMSQLInv (previous step) (back to tree)

a = chooseD2(rvref0, optval00), gs0 = gstepf(gs, ls, D2, a), ls0 = lstepf(gs, ls, D2, a), pc0 = pcstepf(gs, ls, D2, a), ls.tid ≠ tid0, rvref0 ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, D2), ¬ DMSQRely(gs, tid0, gs0), ¬ rvref0 ∈ gs.prvHp, ¬ rvref0 ∈ gs.vrvHp ⊦ ls.tid ≠ tid0 ∧ ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D2, a) ∧ pcstepf(gs, ls, D2, a) = D3

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQGInv, seq:⊦ DMSQGInv(gs) ↔ 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), subst:[gs] → [gs], <all paths>

Additional information

Used terms: gs

Proof step 14 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ DMSQGInv(gs) ↔ 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)

A spec-lemma

Proof step 15 from proof copied-rely-DMSQLInv (previous step) (back to tree)

a = chooseD2(rvref0, optval00), dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, D2, a), ls0 = lstepf(gs, ls, D2, a), pc0 = pcstepf(gs, ls, D2, a), gs.orl ≠ [], ls.tid ≠ tid0, rvref0 ≠ null, DMSQLInv(gs, ls, D2), 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), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ DMSQRely(gs, tid0, gs0), ¬ dups(gs.orl + gs.qrl), ¬ rvref0 ∈ gs.prvHp, ¬ rvref0 ∈ gs.vrvHp, 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.tid ≠ tid0 ∧ ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D2, a) ∧ pcstepf(gs, ls, D2, a) = D3

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Used simplifier rules: ⊦ gstepf(gs, ls, D2, chooseD2(rvref0, optval00)) = ( ( gs .vrvHp:= gs.vrvHp [((ls.rvref:= rvref0).optval0:= optval00 ).rvref, ((ls.rvref:= rvref0).optval0:= optval00 ).optval0 ]) .prvHp:= gs.prvHp [((ls.rvref:= rvref0).optval0:= optval00).rvref, ((ls.rvref:= rvref0).optval0:= optval00).optval0 ]) .rvowns:= gs.rvowns (((ls.rvref:= rvref0).optval0:= optval00).rvref ; Pending(((ls.rvref:= rvref0).optval0:= optval00).tid) ); (s) ⊦ (ls.optval0:= optval0).optval0 = optval0; (s) ⊦ (ls.optval0:= optval0).rvref = ls.rvref; (s) ⊦ (ls.rvref:= rvref).rvref = rvref; (s) ⊦ (ls.optval0:= optval0).tid = ls.tid; (s) ⊦ (ls.rvref:= rvref).tid = ls.tid; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist]

Proof step 16 from proof copied-rely-DMSQLInv (previous step) (back to tree)

a = chooseD2(rvref0, optval00), dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, D2, a), ls0 = lstepf(gs, ls, D2, a), pc0 = pcstepf(gs, ls, D2, a), gs.orl ≠ [], ls.tid ≠ tid0, rvref0 ≠ null, DMSQLInv(gs, ls, D2), 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), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ DMSQRely(gs, tid0, gs0), ¬ dups(gs.orl + gs.qrl), ¬ nextnottid(ls.tid, gs.vhead, gs.vs), ¬ rvref0 ∈ gs.prvHp, ¬ rvref0 ∈ gs.vrvHp, 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.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, 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) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQLInv, seq:⊦ DMSQLInv(gs, ls, pc) ↔ ( pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → ( ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ ( pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ ( pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ ( pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ; gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → 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)) ∧ ( pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ( gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E9 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.nxt = null ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ ( pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → 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)) ∧ ( pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ ( pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) ) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ ( pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) )) ∧ ( pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )), subst:[gs, ls, pc] → [gs, ls, D2], <all paths>

Additional information

Used simplifier rules: ⊦ gstepf(gs, ls, D2, chooseD2(rvref0, optval00)) = ( ( gs .vrvHp:= gs.vrvHp [((ls.rvref:= rvref0).optval0:= optval00 ).rvref, ((ls.rvref:= rvref0).optval0:= optval00 ).optval0 ]) .prvHp:= gs.prvHp [((ls.rvref:= rvref0).optval0:= optval00).rvref, ((ls.rvref:= rvref0).optval0:= optval00).optval0 ]) .rvowns:= gs.rvowns (((ls.rvref:= rvref0).optval0:= optval00).rvref ; Pending(((ls.rvref:= rvref0).optval0:= optval00).tid) ); (s) ⊦ (ls.optval0:= optval0).optval0 = optval0; (s) ⊦ (ls.optval0:= optval0).rvref = ls.rvref; (s) ⊦ (ls.rvref:= rvref).rvref = rvref; (s) ⊦ (ls.optval0:= optval0).tid = ls.tid; (s) ⊦ (ls.rvref:= rvref).tid = ls.tid; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ D2 ≠ D8; (s) ⊦ D2 ≠ D9; (s) ⊦ D2 ≠ D10; (s) ⊦ D2 ≠ D11; (s) ⊦ D2 ≠ D12; (s) ⊦ D2 ≠ D13; (s) ⊦ D2 ≠ D14; (s) ⊦ D2 ≠ D15; (s) ⊦ D2 ≠ D18; (s) ⊦ D2 ≠ D19; (s) ⊦ D2 ≠ crashed; (s) ⊦ D2 ≠ D20; (s) ⊦ D2 ≠ D21; (s) ⊦ D2 ≠ D22; (s) ⊦ D2 ≠ D23; (s) ⊦ D2 ≠ D24; (s) ⊦ D2 ≠ idle; (s) ⊦ D2 ≠ ready; (s) ⊦ D2 ≠ E1; (s) ⊦ D2 ≠ E2; (s) ⊦ D2 ≠ E3; (s) ⊦ D2 ≠ E4; (s) ⊦ D2 ≠ E5; (s) ⊦ D2 ≠ E6; (s) ⊦ D2 ≠ E7; (s) ⊦ D2 ≠ E8; (s) ⊦ D2 ≠ E9; (s) ⊦ D2 ≠ E10; (s) ⊦ D2 ≠ E11; (s) ⊦ D2 ≠ E12; (s) ⊦ D2 ≠ E13; (s) ⊦ D2 ≠ E14; (s) ⊦ D2 ≠ E15; (s) ⊦ D2 ≠ E16; (s) ⊦ D2 ≠ E17; (s) ⊦ D1 ≠ D2; (s) Used terms: gs, ls, D2

Proof step 17 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ DMSQLInv(gs, ls, pc) ↔ (pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → (ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ (pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ (pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ (pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ (pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ;gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → 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)) ∧ (pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ (gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ (pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ (pc = E9 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.nxt = null ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ (pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → 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)) ∧ (pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ (pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ (pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns)) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ (pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns))) ∧ (pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)))

A spec-lemma

Proof step 18 from proof copied-rely-DMSQLInv (previous step) (back to tree)

a = chooseD2(rvref0, optval00), dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, D2, a), ls0 = lstepf(gs, ls, D2, a), pc0 = pcstepf(gs, ls, D2, a), gs.orl ≠ [], ls.tid ≠ tid0, rvref0 ≠ null, DMSQLInv(gs, ls, D2), 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), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ DMSQRely(gs, tid0, gs0), ¬ dups(gs.orl + gs.qrl), ¬ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), ¬ rvref0 ∈ gs.prvHp, ¬ rvref0 ∈ gs.vrvHp, 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.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, 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) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQLInv, seq:⊦ DMSQLInv(gs, ls, pc) ↔ ( pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → ( ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ ( pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ ( pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ ( pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ; gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → 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)) ∧ ( pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ( gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E9 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.nxt = null ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ ( pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → 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)) ∧ ( pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ ( pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) ) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ ( pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) )) ∧ ( pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )), subst:[gs, ls, pc] → [gs, ls, D2], <all paths>

Additional information

Used simplifier rules: ⊦ gstepf(gs, ls, D2, chooseD2(rvref0, optval00)) = ( ( gs .vrvHp:= gs.vrvHp [((ls.rvref:= rvref0).optval0:= optval00 ).rvref, ((ls.rvref:= rvref0).optval0:= optval00 ).optval0 ]) .prvHp:= gs.prvHp [((ls.rvref:= rvref0).optval0:= optval00).rvref, ((ls.rvref:= rvref0).optval0:= optval00).optval0 ]) .rvowns:= gs.rvowns (((ls.rvref:= rvref0).optval0:= optval00).rvref ; Pending(((ls.rvref:= rvref0).optval0:= optval00).tid) ); (s) ⊦ (ls.optval0:= optval0).optval0 = optval0; (s) ⊦ (ls.optval0:= optval0).rvref = ls.rvref; (s) ⊦ (ls.rvref:= rvref).rvref = rvref; (s) ⊦ (ls.optval0:= optval0).tid = ls.tid; (s) ⊦ (ls.rvref:= rvref).tid = ls.tid; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ D2 ≠ D22; (s) ⊦ D2 ≠ D23; (s) ⊦ D2 ≠ D24; (s) ⊦ D2 ≠ D8; (s) ⊦ D2 ≠ D9; (s) ⊦ D2 ≠ D10; (s) ⊦ D2 ≠ D11; (s) ⊦ D2 ≠ D12; (s) ⊦ D2 ≠ D13; (s) ⊦ D2 ≠ D14; (s) ⊦ D2 ≠ D15; (s) ⊦ D2 ≠ D18; (s) ⊦ D2 ≠ D19; (s) ⊦ D2 ≠ crashed; (s) ⊦ D2 ≠ idle; (s) ⊦ D2 ≠ ready; (s) ⊦ D2 ≠ E1; (s) ⊦ D2 ≠ E2; (s) ⊦ D2 ≠ E3; (s) ⊦ D2 ≠ E4; (s) ⊦ D2 ≠ E5; (s) ⊦ D2 ≠ E6; (s) ⊦ D2 ≠ E7; (s) ⊦ D2 ≠ E8; (s) ⊦ D2 ≠ E9; (s) ⊦ D2 ≠ E10; (s) ⊦ D2 ≠ E11; (s) ⊦ D2 ≠ E12; (s) ⊦ D2 ≠ E13; (s) ⊦ D2 ≠ E14; (s) ⊦ D2 ≠ E15; (s) ⊦ D2 ≠ E16; (s) ⊦ D2 ≠ E17; (s) ⊦ D1 ≠ D2; (s) Used terms: gs, ls, D2

Proof step 19 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ DMSQLInv(gs, ls, pc) ↔ (pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → (ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ (pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ (pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ (pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ (pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ;gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → 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)) ∧ (pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ (gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ (pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ (pc = E9 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.nxt = null ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ (pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → 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)) ∧ (pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ (pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ (pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns)) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ (pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns))) ∧ (pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)))

A spec-lemma

Proof step 20 from proof copied-rely-DMSQLInv (previous step) (back to tree)

a = chooseD2(rvref0, optval00), dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, D2, a), ls0 = lstepf(gs, ls, D2, a), pc0 = pcstepf(gs, ls, D2, a), gs.orl ≠ [], ls.tid ≠ tid0, rvref0 ≠ null, DMSQLInv(gs, ls, D2), 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), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ DMSQRely(gs, tid0, gs0), ¬ dups(gs.orl + gs.qrl), ¬ noowns(ls.tid, gs.owns), ¬ rvref0 ∈ gs.prvHp, ¬ rvref0 ∈ gs.vrvHp, 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.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, 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) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQLInv, seq:⊦ DMSQLInv(gs, ls, pc) ↔ ( pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → ( ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ ( pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ ( pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ ( pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ; gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → 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)) ∧ ( pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ( gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E9 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.nxt = null ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ ( pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → 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)) ∧ ( pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ ( pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) ) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ ( pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) )) ∧ ( pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )), subst:[gs, ls, pc] → [gs, ls, D2], <all paths>

Additional information

Used simplifier rules: ⊦ gstepf(gs, ls, D2, chooseD2(rvref0, optval00)) = ( ( gs .vrvHp:= gs.vrvHp [((ls.rvref:= rvref0).optval0:= optval00 ).rvref, ((ls.rvref:= rvref0).optval0:= optval00 ).optval0 ]) .prvHp:= gs.prvHp [((ls.rvref:= rvref0).optval0:= optval00).rvref, ((ls.rvref:= rvref0).optval0:= optval00).optval0 ]) .rvowns:= gs.rvowns (((ls.rvref:= rvref0).optval0:= optval00).rvref ; Pending(((ls.rvref:= rvref0).optval0:= optval00).tid) ); (s) ⊦ (ls.optval0:= optval0).optval0 = optval0; (s) ⊦ (ls.optval0:= optval0).rvref = ls.rvref; (s) ⊦ (ls.rvref:= rvref).rvref = rvref; (s) ⊦ (ls.optval0:= optval0).tid = ls.tid; (s) ⊦ (ls.rvref:= rvref).tid = ls.tid; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ D2 ≠ E4; (s) ⊦ D2 ≠ E11; (s) ⊦ D2 ≠ E10; (s) ⊦ D2 ≠ E2; (s) ⊦ D2 ≠ E3; (s) ⊦ D2 ≠ E5; (s) ⊦ D2 ≠ E6; (s) ⊦ D2 ≠ E7; (s) ⊦ D2 ≠ E8; (s) ⊦ D2 ≠ E9; (s) ⊦ D2 ≠ E13; (s) ⊦ D2 ≠ E14; (s) ⊦ D2 ≠ E15; (s) ⊦ D2 ≠ E16; (s) ⊦ D2 ≠ crashed; (s) ⊦ D2 ≠ idle; (s) ⊦ D2 ≠ ready; (s) ⊦ D1 ≠ D2; (s) Used terms: gs, ls, D2

Proof step 21 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ DMSQLInv(gs, ls, pc) ↔ (pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → (ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ (pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ (pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ (pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ (pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ;gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → 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)) ∧ (pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ (gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ (pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ (pc = E9 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.nxt = null ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ (pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → 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)) ∧ (pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ (pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ (pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns)) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ (pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns))) ∧ (pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)))

A spec-lemma

Proof step 22 from proof copied-rely-DMSQLInv (previous step) (back to tree)

a = chooseD2(rvref0, optval00), dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, D2, a), ls0 = lstepf(gs, ls, D2, a), pc0 = pcstepf(gs, ls, D2, a), gs.orl ≠ [], ls.tid ≠ tid0, rvref0 ≠ null, DMSQLInv(gs, ls, D2), 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), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ DMSQRely(gs, tid0, gs0), ¬ dups(gs.orl + gs.qrl), ¬ pre(gs, ls, D2, a), ¬ rvref0 ∈ gs.prvHp, ¬ rvref0 ∈ gs.vrvHp, 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.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, 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) ⊦

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 ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ chooseD2(rvref, optval) ≠ τ; (s) ⊦ pre(gs, ls, D2, a) ↔ (∃ rvref0, optval00. (¬ rvref0 ∈ gs.vrvHp ∧ ¬ rvref0 ∈ gs.prvHp ∧ rvref0 ≠ null) ∧ a = chooseD2(rvref0, optval00)) ∨ a = τ ∧ ¬ (∃ rvref0, optval00. ¬ rvref0 ∈ gs.vrvHp ∧ ¬ rvref0 ∈ gs.prvHp ∧ rvref0 ≠ null); (s) ⊦ (ls.rvref:= rvref).tid = ls.tid; (s) ⊦ (ls.optval0:= optval0).tid = ls.tid; (s) ⊦ (ls.rvref:= rvref).rvref = rvref; (s) ⊦ (ls.optval0:= optval0).rvref = ls.rvref; (s) ⊦ (ls.optval0:= optval0).optval0 = optval0; (s) ⊦ gstepf(gs, ls, D2, chooseD2(rvref0, optval00)) = ( ( gs .vrvHp:= gs.vrvHp [((ls.rvref:= rvref0).optval0:= optval00 ).rvref, ((ls.rvref:= rvref0).optval0:= optval00 ).optval0 ]) .prvHp:= gs.prvHp [((ls.rvref:= rvref0).optval0:= optval00).rvref, ((ls.rvref:= rvref0).optval0:= optval00).optval0 ]) .rvowns:= gs.rvowns (((ls.rvref:= rvref0).optval0:= optval00).rvref ; Pending(((ls.rvref:= rvref0).optval0:= optval00).tid) ); (s)

Proof step 23 from proof copied-rely-DMSQLInv (previous step) (back to tree)

dom gs.vrvHp = dom gs.prvHp, gs.orl ≠ [], ls.tid ≠ tid0, rvref0 ≠ null, DMSQLInv(gs, ls, D2), 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), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, gs.phead ∈ gs.vs, gs.phead ∈ gs.ps, ¬ DMSQRely(gs, tid0, ((gs.vrvHp:= gs.vrvHp[rvref0, optval00]).prvHp:= gs.prvHp[rvref0, optval00]).rvowns:= gs.rvowns(rvref0; Pending(ls.tid))), ¬ dups(gs.orl + gs.qrl), ¬ dups(gs.orl), ¬ dups(gs.qrl), ¬ rvref0 ∈ gs.prvHp, ¬ rvref0 ∈ gs.vrvHp, 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 ⊦ ∃ rvref, optval. ¬ rvref ∈ gs.vrvHp ∧ ¬ rvref ∈ gs.prvHp ∧ rvref ≠ null ∧ chooseD2(rvref0, optval00) = chooseD2(rvref, optval)

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 24 from proof copied-rely-DMSQLInv (previous step) (back to tree)

dom vrvHp = dom prvHp, gs = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), ls.tid ≠ tid0, orl ≠ [], rvref0 ≠ null, DMSQLInv(gs, ls, D2), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ DMSQRely(gs, tid0, ((gs.vrvHp:= vrvHp[rvref0, optval00]).prvHp:= prvHp[rvref0, optval00]).rvowns:= rvowns(rvref0; Pending(ls.tid))), ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ rvref0 ∈ prvHp, ¬ rvref0 ∈ vrvHp, vs[vhead].next ≠ null ∧ vs[vs[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) ⊦ ∃ rvref, optval. ¬ rvref ∈ vrvHp ∧ ¬ rvref ∈ prvHp ∧ rvref ≠ null ∧ chooseD2(rvref0, optval00) = chooseD2(rvref, optval)

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 ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .rvowns:= rvowns0 = mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns0); (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .prvHp:= vrvHp2 = mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp2, qrl, qrl0, owns, rvowns); (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vrvHp:= vrvHp1 = mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp1, vrvHp0, qrl, qrl0, owns, rvowns); (s)

Proof step 25 from proof copied-rely-DMSQLInv (previous step) (back to tree)

dom vrvHp = dom prvHp, ls.tid ≠ tid0, orl ≠ [], rvref0 ≠ null, DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), ls, D2), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ DMSQRely (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), tid0, mkgs (ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp[rvref0, optval00], prvHp[rvref0, optval00], qrl, orl, owns, rvowns(rvref0; Pending(ls.tid)))), ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ rvref0 ∈ prvHp, ¬ rvref0 ∈ vrvHp, vs[vhead].next ≠ null ∧ vs[vs[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 ⊦ ∃ rvref, optval. ¬ rvref ∈ vrvHp ∧ ¬ rvref ∈ prvHp ∧ rvref ≠ null ∧ chooseD2(rvref0, optval00) = chooseD2(rvref, optval)

Heuristic quantifier closing applied rule exists right

And closed the goal!

Rule argument

pos: right 1 terms: rvref0, optval00

Additional information

Used terms: rvref0, optval00

Proof step 26 from proof copied-rely-DMSQLInv (previous step) (back to tree)

a = chooseD2(rvref0, optval00), dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, D2, a), ls0 = lstepf(gs, ls, D2, a), pc0 = pcstepf(gs, ls, D2, a), gs.orl ≠ [], ls.tid ≠ tid0, pcstepf(gs, ls, D2, a) ≠ D3, rvref0 ≠ null, DMSQLInv(gs, ls, D2), 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), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ DMSQRely(gs, tid0, gs0), ¬ dups(gs.orl + gs.qrl), ¬ rvref0 ∈ gs.prvHp, ¬ rvref0 ∈ gs.vrvHp, 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.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, 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) ⊦

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 ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ (ls.rvref:= rvref).tid = ls.tid; (s) ⊦ (ls.optval0:= optval0).tid = ls.tid; (s) ⊦ (ls.rvref:= rvref).rvref = rvref; (s) ⊦ (ls.optval0:= optval0).rvref = ls.rvref; (s) ⊦ (ls.optval0:= optval0).optval0 = optval0; (s) ⊦ gstepf(gs, ls, D2, chooseD2(rvref0, optval00)) = ( ( gs .vrvHp:= gs.vrvHp [((ls.rvref:= rvref0).optval0:= optval00 ).rvref, ((ls.rvref:= rvref0).optval0:= optval00 ).optval0 ]) .prvHp:= gs.prvHp [((ls.rvref:= rvref0).optval0:= optval00).rvref, ((ls.rvref:= rvref0).optval0:= optval00).optval0 ]) .rvowns:= gs.rvowns (((ls.rvref:= rvref0).optval0:= optval00).rvref ; Pending(((ls.rvref:= rvref0).optval0:= optval00).tid) ); (s) ⊦ D2 ≠ D3; (s) ⊦ pcstepf(gs, ls, D2, a) = (∃ rvref0, optval00. a = chooseD2(rvref0, optval00) ⊃ D3;D2); (s)

Proof step 27 from proof copied-rely-DMSQLInv (previous step) (back to tree)

dom gs.vrvHp = dom gs.prvHp, gs.orl ≠ [], ls.tid ≠ tid0, rvref0 ≠ null, DMSQLInv(gs, ls, D2), 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), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, gs.phead ∈ gs.vs, gs.phead ∈ gs.ps, ¬ DMSQRely(gs, tid0, ((gs.vrvHp:= gs.vrvHp[rvref0, optval00]).prvHp:= gs.prvHp[rvref0, optval00]).rvowns:= gs.rvowns(rvref0; Pending(ls.tid))), ¬ dups(gs.orl + gs.qrl), ¬ dups(gs.orl), ¬ dups(gs.qrl), ¬ rvref0 ∈ gs.prvHp, ¬ rvref0 ∈ gs.vrvHp, 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 ⊦ ∃ rvref, optval. chooseD2(rvref0, optval00) = chooseD2(rvref, optval)

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 28 from proof copied-rely-DMSQLInv (previous step) (back to tree)

dom vrvHp = dom prvHp, gs = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), ls.tid ≠ tid0, orl ≠ [], rvref0 ≠ null, DMSQLInv(gs, ls, D2), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ DMSQRely(gs, tid0, ((gs.vrvHp:= vrvHp[rvref0, optval00]).prvHp:= prvHp[rvref0, optval00]).rvowns:= rvowns(rvref0; Pending(ls.tid))), ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ rvref0 ∈ prvHp, ¬ rvref0 ∈ vrvHp, vs[vhead].next ≠ null ∧ vs[vs[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) ⊦ ∃ rvref, optval. chooseD2(rvref0, optval00) = chooseD2(rvref, optval)

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 ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .rvowns:= rvowns0 = mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns0); (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .prvHp:= vrvHp2 = mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp2, qrl, qrl0, owns, rvowns); (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vrvHp:= vrvHp1 = mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp1, vrvHp0, qrl, qrl0, owns, rvowns); (s)

Proof step 29 from proof copied-rely-DMSQLInv (previous step) (back to tree)

dom vrvHp = dom prvHp, ls.tid ≠ tid0, orl ≠ [], rvref0 ≠ null, DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), ls, D2), allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ DMSQRely (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), tid0, mkgs (ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp[rvref0, optval00], prvHp[rvref0, optval00], qrl, orl, owns, rvowns(rvref0; Pending(ls.tid)))), ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ rvref0 ∈ prvHp, ¬ rvref0 ∈ vrvHp, vs[vhead].next ≠ null ∧ vs[vs[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 ⊦ ∃ rvref, optval. chooseD2(rvref0, optval00) = chooseD2(rvref, optval)

Heuristic quantifier closing applied rule exists right

And closed the goal!

Rule argument

pos: right 1 terms: rvref0, optval00

Additional information

Used terms: rvref0, optval00

Proof step 30 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs.vretRefs(tid0) = gstepf(gs, ls, D2, a).vretRefs(tid0), a = chooseD2(rvref0, optval00), gs0 = gstepf(gs, ls, D2, a), ls0 = lstepf(gs, ls, D2, a), pc0 = pcstepf(gs, ls, D2, a), ls.tid ≠ tid0, rvref0 ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, D2), equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D2, a).vs, gstepf(gs, ls, D2, a).ps, gstepf(gs, ls, D2, a).owns), equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D2, a).vs, gstepf(gs, ls, D2, a).ps), nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, D2, a).vhead, gstepf(gs, ls, D2, a).vs), noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl, gstepf(gs, ls, D2, a).vs), ownsRely(tid0, gs.owns, gstepf(gs, ls, D2, a).owns), prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D2, a).prvHp), rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D2, a).rvowns, gs.vrvHp), rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D2, a).vretRefs, gstepf(gs, ls, D2, a).vrvHp), gstepf(gs, ls, D2, a).vtail ∈ gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl from gs.vtail, gstepf(gs, ls, D2, a).phead ∈ gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl from gs.phead, gstepf(gs, ls, D2, a).vhead ∈ gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl from gs.vhead, dom gs.vrvHp ⊆ dom gstepf(gs, ls, D2, a).vrvHp, ¬ DMSQRely(gs, tid0, gs0), ¬ rvref0 ∈ gs.prvHp, ¬ rvref0 ∈ gs.vrvHp, ∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl, ∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D2, a).orl, gs.pretRefs(tid0) = gstepf(gs, ls, D2, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D2, a).pretRefs(tid0) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQRely, seq:⊦ DMSQRely(gs, tid, gs0) ↔ (∃ 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, tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid) = gs0.vretRefs(tid) ∧ ( gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid)) ∧ rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(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(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid, gs.owns, gs0.owns), subst:[gs, tid, gs0] → [gs, tid0, gs0], <all paths>

Additional information

Used simplifier rules: ⊦ # x = # z → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) ⊦ x = x + y ↔ y = []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ (gs.rvowns:= rvowns).vtail = gs.vtail; (s) ⊦ (gs.prvHp:= vrvHp0).vtail = gs.vtail; (s) ⊦ (gs.vrvHp:= vrvHp).vtail = gs.vtail; (s) ⊦ (gs.rvowns:= rvowns).phead = gs.phead; (s) ⊦ (gs.prvHp:= vrvHp0).phead = gs.phead; (s) ⊦ (gs.vrvHp:= vrvHp).phead = gs.phead; (s) ⊦ equalrl(rl, vs, ps, vs, ps); (s) ⊦ (gs.rvowns:= rvowns).ps = gs.ps; (s) ⊦ (gs.prvHp:= vrvHp0).ps = gs.ps; (s) ⊦ (gs.vrvHp:= vrvHp).ps = gs.ps; (s) ⊦ equalowns(vs, ps, owns, tid, vs, ps, owns); (s) ⊦ (gs.rvowns:= rvowns).pretRefs = gs.pretRefs; (s) ⊦ (gs.prvHp:= vrvHp0).pretRefs = gs.pretRefs; (s) ⊦ (gs.vrvHp:= vrvHp).pretRefs = gs.pretRefs; (s) ⊦ (gs.rvowns:= rvowns).rvowns = rvowns; (s) ⊦ (gs.rvowns:= rvowns).vretRefs = gs.vretRefs; (s) ⊦ (gs.prvHp:= vrvHp0).vretRefs = gs.vretRefs; (s) ⊦ (gs.vrvHp:= vrvHp).vretRefs = gs.vretRefs; (s) ⊦ (gs.rvowns:= rvowns).vrvHp = gs.vrvHp; (s) ⊦ (gs.prvHp:= vrvHp0).vrvHp = gs.vrvHp; (s) ⊦ (gs.vrvHp:= vrvHp).vrvHp = vrvHp; (s) ⊦ dom st[a, d] = dom st ++ a; (s) ⊦ s ⊆ s ++ a; (s) ⊦ (gs.rvowns:= rvowns).prvHp = gs.prvHp; (s) ⊦ (gs.prvHp:= vrvHp0).prvHp = vrvHp0; (s) ⊦ (gs.rvowns:= rvowns).orl = gs.orl; (s) ⊦ (gs.prvHp:= vrvHp0).orl = gs.orl; (s) ⊦ (gs.vrvHp:= vrvHp).orl = gs.orl; (s) ⊦ (gs.rvowns:= rvowns).qrl = gs.qrl; (s) ⊦ (gs.prvHp:= vrvHp0).qrl = gs.qrl; (s) ⊦ (gs.vrvHp:= vrvHp).qrl = gs.qrl; (s) ⊦ noidRely(tid, rl, vs, rl, vs); (s) ⊦ (gs.rvowns:= rvowns).vhead = gs.vhead; (s) ⊦ (gs.prvHp:= vrvHp0).vhead = gs.vhead; (s) ⊦ (gs.vrvHp:= vrvHp).vhead = gs.vhead; (s) ⊦ (gs.rvowns:= rvowns).vs = gs.vs; (s) ⊦ (gs.prvHp:= vrvHp0).vs = gs.vs; (s) ⊦ (gs.vrvHp:= vrvHp).vs = gs.vs; (s) ⊦ nextnottidRely(tid, vhead, vs, vhead, vs); (s) ⊦ gstepf(gs, ls, D2, chooseD2(rvref0, optval00)) = ( ( gs .vrvHp:= gs.vrvHp [((ls.rvref:= rvref0).optval0:= optval00 ).rvref, ((ls.rvref:= rvref0).optval0:= optval00 ).optval0 ]) .prvHp:= gs.prvHp [((ls.rvref:= rvref0).optval0:= optval00).rvref, ((ls.rvref:= rvref0).optval0:= optval00).optval0 ]) .rvowns:= gs.rvowns (((ls.rvref:= rvref0).optval0:= optval00).rvref ; Pending(((ls.rvref:= rvref0).optval0:= optval00).tid) ); (s) ⊦ (ls.optval0:= optval0).optval0 = optval0; (s) ⊦ (ls.optval0:= optval0).rvref = ls.rvref; (s) ⊦ (ls.rvref:= rvref).rvref = rvref; (s) ⊦ (ls.optval0:= optval0).tid = ls.tid; (s) ⊦ (ls.rvref:= rvref).tid = ls.tid; (s) ⊦ (gs.rvowns:= rvowns).owns = gs.owns; (s) ⊦ (gs.prvHp:= vrvHp0).owns = gs.owns; (s) ⊦ (gs.vrvHp:= vrvHp).owns = gs.owns; (s) ⊦ ownsRely(tid, owns, owns); (s) Used terms: gs, tid0, gs0

Proof step 31 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ DMSQRely(gs, tid, gs0) ↔ (∃ 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, tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid) = gs0.vretRefs(tid) ∧ (gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid)) ∧ rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(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(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid, gs.owns, gs0.owns)

A spec-lemma

Proof step 32 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D3, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a), ¬ DMSQRely(gs, tid0, gs0) ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:rely-D3-D4, seq:⊦ ls.tid ≠ tid0 ∧ ( ( gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns (gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D3, a) ∧ pcstepf(gs, ls, D3, a) = D4 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D3, a).orl + gstepf(gs, ls, D3, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D3, a).orl) ∧ gstepf(gs, ls, D3, a).vtail ∈ gstepf(gs, ls, D3, a).orl + gstepf(gs, ls, D3, a).qrl from gs.vtail ∧ gstepf(gs, ls, D3, a).phead ∈ gstepf(gs, ls, D3, a).orl + gstepf(gs, ls, D3, a).qrl from gs.phead ∧ gstepf(gs, ls, D3, a).vhead ∈ gstepf(gs, ls, D3, a).orl + gstepf(gs, ls, D3, a).qrl from gs.vhead ∧ equalrl (gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D3, a).vs, gstepf(gs, ls, D3, a).ps) ∧ equalowns (gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D3, a).vs, gstepf(gs, ls, D3, a).ps, gstepf(gs, ls, D3, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, D3, a).vretRefs(tid0) ∧ ( gs.pretRefs(tid0) = gstepf(gs, ls, D3, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D3, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D3, a).rvowns, gs.vrvHp) ∧ rvrely (tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D3, a).vretRefs, gstepf(gs, ls, D3, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, D3, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D3, a).prvHp) ∧ noidRely (tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D3, a).orl + gstepf(gs, ls, D3, a).qrl, gstepf(gs, ls, D3, a).vs) ∧ nextnottidRely (tid0, gs.vhead, gs.vs, gstepf(gs, ls, D3, a).vhead, gstepf(gs, ls, D3, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, D3, a).owns), subst:[ls, tid0, gs, a] → [ls, tid0, gs, a]

Additional information

Used terms: ls, tid0, gs, a

Proof step 33 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ ls.tid ≠ tid0 ∧ ( (gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D3, a) ∧ pcstepf(gs, ls, D3, a) = D4 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D3, a).orl + gstepf(gs, ls, D3, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D3, a).orl) ∧ gstepf(gs, ls, D3, a).vtail ∈ gstepf(gs, ls, D3, a).orl + gstepf(gs, ls, D3, a).qrl from gs.vtail ∧ gstepf(gs, ls, D3, a).phead ∈ gstepf(gs, ls, D3, a).orl + gstepf(gs, ls, D3, a).qrl from gs.phead ∧ gstepf(gs, ls, D3, a).vhead ∈ gstepf(gs, ls, D3, a).orl + gstepf(gs, ls, D3, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D3, a).vs, gstepf(gs, ls, D3, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D3, a).vs, gstepf(gs, ls, D3, a).ps, gstepf(gs, ls, D3, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, D3, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, D3, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D3, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D3, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D3, a).vretRefs, gstepf(gs, ls, D3, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, D3, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D3, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D3, a).orl + gstepf(gs, ls, D3, a).qrl, gstepf(gs, ls, D3, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, D3, a).vhead, gstepf(gs, ls, D3, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, D3, a).owns)

Lemma rely-D3-D4

Proof step 34 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D3, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a), ¬ DMSQRely(gs, tid0, gs0), ls.tid ≠ tid0 ∧ ( (gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D3, a) ∧ pcstepf(gs, ls, D3, a) = D4 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D3, a).orl + gstepf(gs, ls, D3, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D3, a).orl) ∧ gstepf(gs, ls, D3, a).vtail ∈ gstepf(gs, ls, D3, a).orl + gstepf(gs, ls, D3, a).qrl from gs.vtail ∧ gstepf(gs, ls, D3, a).phead ∈ gstepf(gs, ls, D3, a).orl + gstepf(gs, ls, D3, a).qrl from gs.phead ∧ gstepf(gs, ls, D3, a).vhead ∈ gstepf(gs, ls, D3, a).orl + gstepf(gs, ls, D3, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D3, a).vs, gstepf(gs, ls, D3, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D3, a).vs, gstepf(gs, ls, D3, a).ps, gstepf(gs, ls, D3, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, D3, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, D3, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D3, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D3, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D3, a).vretRefs, gstepf(gs, ls, D3, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, D3, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D3, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D3, a).orl + gstepf(gs, ls, D3, a).qrl, gstepf(gs, ls, D3, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, D3, a).vhead, gstepf(gs, ls, D3, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, D3, a).owns) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 10

Additional information

Proof step 35 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D3, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a), ¬ DMSQRely(gs, tid0, gs0) ⊦ ls.tid ≠ tid0 ∧ ( (gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D3, a) ∧ pcstepf(gs, ls, D3, a) = D4

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQGInv, seq:⊦ DMSQGInv(gs) ↔ 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), subst:[gs] → [gs], <all paths>

Additional information

Used terms: gs

Proof step 36 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ DMSQGInv(gs) ↔ 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)

A spec-lemma

Proof step 37 from proof copied-rely-DMSQLInv (previous step) (back to tree)

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D3, pc0 = pcstepf(gs, ls, pc, a), gs.orl ≠ [], ls.tid ≠ tid0, DMSQLInv(gs, ls, pc), 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), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, pc, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ DMSQRely(gs, tid0, gs0), ¬ 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.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.tid ≠ tid0 ∧ ( (gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D3, a) ∧ pcstepf(gs, ls, D3, a) = D4

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQLInv, seq:⊦ DMSQLInv(gs, ls, pc) ↔ ( pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → ( ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ ( pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ ( pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ ( pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ; gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → 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)) ∧ ( pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ( gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E9 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.nxt = null ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ ( pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → 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)) ∧ ( pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ ( pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) ) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ ( pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) )) ∧ ( pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )), subst:[gs, ls, pc] → [gs, ls, pc], <all paths>

Additional information

Used simplifier rules: ⊦ D3 ≠ crashed; (s) ⊦ D3 ≠ idle; (s) ⊦ D3 ≠ ready; (s) ⊦ D3 ≠ E1; (s) ⊦ D3 ≠ E17; (s) ⊦ D1 ≠ D3; (s) ⊦ D2 ≠ D3; (s) ⊦ D3 ≠ D7; (s) ⊦ D3 ≠ D32; (s) ⊦ D3 ≠ D33; (s) ⊦ D3 ≠ E4; (s) ⊦ D3 ≠ E16; (s) ⊦ D3 ≠ E15; (s) ⊦ D3 ≠ E14; (s) ⊦ D3 ≠ E13; (s) ⊦ D3 ≠ E12; (s) ⊦ D3 ≠ E11; (s) ⊦ D3 ≠ E10; (s) ⊦ D3 ≠ E9; (s) ⊦ D3 ≠ E8; (s) ⊦ D3 ≠ E7; (s) ⊦ D3 ≠ E6; (s) ⊦ D3 ≠ E5; (s) ⊦ D3 ≠ E3; (s) ⊦ D3 ≠ E2; (s) ⊦ D3 ≠ D34; (s) ⊦ D3 ≠ D31; (s) ⊦ D3 ≠ D30; (s) ⊦ D3 ≠ D29; (s) ⊦ D3 ≠ D28; (s) ⊦ D3 ≠ D27; (s) ⊦ D3 ≠ D26; (s) ⊦ D3 ≠ D25; (s) ⊦ D3 ≠ D24; (s) ⊦ D3 ≠ D23; (s) ⊦ D3 ≠ D22; (s) ⊦ D3 ≠ D21; (s) ⊦ D3 ≠ D20; (s) ⊦ D3 ≠ D19; (s) ⊦ D3 ≠ D18; (s) ⊦ D3 ≠ D17; (s) ⊦ D3 ≠ D16; (s) ⊦ D3 ≠ D15; (s) ⊦ D3 ≠ D14; (s) ⊦ D3 ≠ D13; (s) ⊦ D3 ≠ D12; (s) ⊦ D3 ≠ D11; (s) ⊦ D3 ≠ D10; (s) ⊦ D3 ≠ D9; (s) ⊦ D3 ≠ D8; (s) ⊦ D3 ≠ D6; (s) ⊦ D3 ≠ D5; (s) ⊦ D3 ≠ D4; (s) ⊦ dom st0 = dom st1 ∧ a ∈ st0 → a ∈ st1; (ss) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, D3, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, D3, a) = D4; (s) Used terms: gs, ls, pc

Proof step 38 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ DMSQLInv(gs, ls, pc) ↔ (pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → (ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ (pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ (pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ (pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ (pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ;gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → 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)) ∧ (pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ (gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ (pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ (pc = E9 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.nxt = null ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ (pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → 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)) ∧ (pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ (pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ (pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns)) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ (pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns))) ∧ (pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)))

A spec-lemma

Proof step 39 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs.vretRefs(tid0) = gstepf(gs, ls, D3, a).vretRefs(tid0), gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D3, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D3, a).vs, gstepf(gs, ls, D3, a).ps, gstepf(gs, ls, D3, a).owns), equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D3, a).vs, gstepf(gs, ls, D3, a).ps), nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, D3, a).vhead, gstepf(gs, ls, D3, a).vs), noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D3, a).orl + gstepf(gs, ls, D3, a).qrl, gstepf(gs, ls, D3, a).vs), ownsRely(tid0, gs.owns, gstepf(gs, ls, D3, a).owns), pre(gs, ls, pc, a), prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D3, a).prvHp), rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D3, a).rvowns, gs.vrvHp), rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D3, a).vretRefs, gstepf(gs, ls, D3, a).vrvHp), gstepf(gs, ls, D3, a).vtail ∈ gstepf(gs, ls, D3, a).orl + gstepf(gs, ls, D3, a).qrl from gs.vtail, gstepf(gs, ls, D3, a).phead ∈ gstepf(gs, ls, D3, a).orl + gstepf(gs, ls, D3, a).qrl from gs.phead, gstepf(gs, ls, D3, a).vhead ∈ gstepf(gs, ls, D3, a).orl + gstepf(gs, ls, D3, a).qrl from gs.vhead, dom gs.vrvHp ⊆ dom gstepf(gs, ls, D3, a).vrvHp, ¬ DMSQRely(gs, tid0, gs0), ∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D3, a).orl + gstepf(gs, ls, D3, a).qrl, ∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D3, a).orl, gs.pretRefs(tid0) = gstepf(gs, ls, D3, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D3, a).pretRefs(tid0) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQRely, seq:⊦ DMSQRely(gs, tid, gs0) ↔ (∃ 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, tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid) = gs0.vretRefs(tid) ∧ ( gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid)) ∧ rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(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(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid, gs.owns, gs0.owns), subst:[gs, tid, gs0] → [gs, tid0, gs0], <all paths>

Additional information

Used simplifier rules: ⊦ pre(gs, ls, D3, a) ↔ a = τ; (s) ⊦ (gs.vretRefs:= vretRefs).prvHp = gs.prvHp; (s) ⊦ prvHpRely(vrvHp, prvHp, prvHp); (s) ⊦ (gs.vretRefs:= vretRefs).rvowns = gs.rvowns; (s) ⊦ rvownsrely(tid, rvowns, rvowns, vrvHp); (s) ⊦ (gs.vretRefs:= vretRefs).vretRefs = vretRefs; (s) ⊦ (gs.vretRefs:= vretRefs).phead = gs.phead; (s) ⊦ (gs.vretRefs:= vretRefs).vtail = gs.vtail; (s) ⊦ (gs.vretRefs:= vretRefs).vrvHp = gs.vrvHp; (s) ⊦ # s = # s0 → (s ⊆ s0 ↔ s = s0); (s) ⊦ equalowns(vs, ps, owns, tid, vs, ps, owns); (s) ⊦ (gs.vretRefs:= vretRefs).ps = gs.ps; (s) ⊦ equalrl(rl, vs, ps, vs, ps); (s) ⊦ (gs.vretRefs:= vretRefs).vhead = gs.vhead; (s) ⊦ nextnottidRely(tid, vhead, vs, vhead, vs); (s) ⊦ (gs.vretRefs:= vretRefs).vs = gs.vs; (s) ⊦ (gs.vretRefs:= vretRefs).owns = gs.owns; (s) ⊦ ownsRely(tid, owns, owns); (s) ⊦ (gs.vretRefs:= vretRefs).qrl = gs.qrl; (s) ⊦ # x = # z → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) ⊦ (gs.vretRefs:= vretRefs).orl = gs.orl; (s) ⊦ gstepf(gs, ls, D3, τ) = gs.vretRefs:= gs.vretRefs(ls.tid; ls.rvref); (s) ⊦ (gs.vretRefs:= vretRefs).pretRefs = gs.pretRefs; (s) ⊦ noidRely(tid, rl, vs, rl, vs); (s) ⊦ [] + x = x; (s) ⊦ x = x + y ↔ y = []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: gs, tid0, gs0

Proof step 40 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ DMSQRely(gs, tid, gs0) ↔ (∃ 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, tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid) = gs0.vretRefs(tid) ∧ (gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid)) ∧ rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(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(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid, gs.owns, gs0.owns)

A spec-lemma

Proof step 41 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D4, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a), ¬ DMSQRely(gs, tid0, gs0) ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:rely-D4-D5, seq:⊦ ls.tid ≠ tid0 ∧ ( ( gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns (gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D4, a) ∧ pcstepf(gs, ls, D4, a) = D5 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D4, a).orl) ∧ gstepf(gs, ls, D4, a).vtail ∈ gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl from gs.vtail ∧ gstepf(gs, ls, D4, a).phead ∈ gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl from gs.phead ∧ gstepf(gs, ls, D4, a).vhead ∈ gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl from gs.vhead ∧ equalrl (gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D4, a).vs, gstepf(gs, ls, D4, a).ps) ∧ equalowns (gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D4, a).vs, gstepf(gs, ls, D4, a).ps, gstepf(gs, ls, D4, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, D4, a).vretRefs(tid0) ∧ ( gs.pretRefs(tid0) = gstepf(gs, ls, D4, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D4, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D4, a).rvowns, gs.vrvHp) ∧ rvrely (tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D4, a).vretRefs, gstepf(gs, ls, D4, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, D4, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D4, a).prvHp) ∧ noidRely (tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl, gstepf(gs, ls, D4, a).vs) ∧ nextnottidRely (tid0, gs.vhead, gs.vs, gstepf(gs, ls, D4, a).vhead, gstepf(gs, ls, D4, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, D4, a).owns), subst:[ls, tid0, gs, a] → [ls, tid0, gs, a]

Additional information

Used terms: ls, tid0, gs, a

Proof step 42 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ ls.tid ≠ tid0 ∧ ( ( gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D4, a) ∧ pcstepf(gs, ls, D4, a) = D5 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D4, a).orl) ∧ gstepf(gs, ls, D4, a).vtail ∈ gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl from gs.vtail ∧ gstepf(gs, ls, D4, a).phead ∈ gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl from gs.phead ∧ gstepf(gs, ls, D4, a).vhead ∈ gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D4, a).vs, gstepf(gs, ls, D4, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D4, a).vs, gstepf(gs, ls, D4, a).ps, gstepf(gs, ls, D4, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, D4, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, D4, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D4, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D4, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D4, a).vretRefs, gstepf(gs, ls, D4, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, D4, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D4, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl, gstepf(gs, ls, D4, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, D4, a).vhead, gstepf(gs, ls, D4, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, D4, a).owns)

Lemma rely-D4-D5

Proof step 43 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D4, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a), ¬ DMSQRely(gs, tid0, gs0), ls.tid ≠ tid0 ∧ ( ( gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D4, a) ∧ pcstepf(gs, ls, D4, a) = D5 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D4, a).orl) ∧ gstepf(gs, ls, D4, a).vtail ∈ gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl from gs.vtail ∧ gstepf(gs, ls, D4, a).phead ∈ gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl from gs.phead ∧ gstepf(gs, ls, D4, a).vhead ∈ gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D4, a).vs, gstepf(gs, ls, D4, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D4, a).vs, gstepf(gs, ls, D4, a).ps, gstepf(gs, ls, D4, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, D4, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, D4, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D4, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D4, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D4, a).vretRefs, gstepf(gs, ls, D4, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, D4, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D4, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl, gstepf(gs, ls, D4, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, D4, a).vhead, gstepf(gs, ls, D4, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, D4, a).owns) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 10

Additional information

Proof step 44 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D4, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a), ¬ DMSQRely(gs, tid0, gs0) ⊦ ls.tid ≠ tid0 ∧ ( ( gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D4, a) ∧ pcstepf(gs, ls, D4, a) = D5

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQGInv, seq:⊦ DMSQGInv(gs) ↔ 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), subst:[gs] → [gs], <all paths>

Additional information

Used terms: gs

Proof step 45 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ DMSQGInv(gs) ↔ 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)

A spec-lemma

Proof step 46 from proof copied-rely-DMSQLInv (previous step) (back to tree)

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D4, pc0 = pcstepf(gs, ls, pc, a), gs.orl ≠ [], ls.tid ≠ tid0, DMSQLInv(gs, ls, pc), 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), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, pc, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ DMSQRely(gs, tid0, gs0), ¬ 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.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.tid ≠ tid0 ∧ ( ( gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D4, a) ∧ pcstepf(gs, ls, D4, a) = D5

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQLInv, seq:⊦ DMSQLInv(gs, ls, pc) ↔ ( pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → ( ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ ( pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ ( pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ ( pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ; gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → 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)) ∧ ( pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ( gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E9 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.nxt = null ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ ( pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → 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)) ∧ ( pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ ( pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) ) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ ( pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) )) ∧ ( pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )), subst:[gs, ls, pc] → [gs, ls, pc], <all paths>

Additional information

Used simplifier rules: ⊦ D4 ≠ crashed; (s) ⊦ D4 ≠ idle; (s) ⊦ D4 ≠ ready; (s) ⊦ D4 ≠ E1; (s) ⊦ D4 ≠ E17; (s) ⊦ D1 ≠ D4; (s) ⊦ D2 ≠ D4; (s) ⊦ D4 ≠ D7; (s) ⊦ D4 ≠ D32; (s) ⊦ D4 ≠ D33; (s) ⊦ D4 ≠ E4; (s) ⊦ D4 ≠ E16; (s) ⊦ D4 ≠ E15; (s) ⊦ D4 ≠ E14; (s) ⊦ D4 ≠ E13; (s) ⊦ D4 ≠ E12; (s) ⊦ D4 ≠ E11; (s) ⊦ D4 ≠ E10; (s) ⊦ D4 ≠ E9; (s) ⊦ D4 ≠ E8; (s) ⊦ D4 ≠ E7; (s) ⊦ D4 ≠ E6; (s) ⊦ D4 ≠ E5; (s) ⊦ D4 ≠ E3; (s) ⊦ D4 ≠ E2; (s) ⊦ D4 ≠ D34; (s) ⊦ D4 ≠ D31; (s) ⊦ D4 ≠ D30; (s) ⊦ D4 ≠ D29; (s) ⊦ D4 ≠ D28; (s) ⊦ D4 ≠ D27; (s) ⊦ D4 ≠ D26; (s) ⊦ D4 ≠ D25; (s) ⊦ D4 ≠ D24; (s) ⊦ D4 ≠ D23; (s) ⊦ D4 ≠ D22; (s) ⊦ D4 ≠ D21; (s) ⊦ D4 ≠ D20; (s) ⊦ D4 ≠ D19; (s) ⊦ D4 ≠ D18; (s) ⊦ D4 ≠ D17; (s) ⊦ D4 ≠ D16; (s) ⊦ D4 ≠ D15; (s) ⊦ D4 ≠ D14; (s) ⊦ D4 ≠ D13; (s) ⊦ D4 ≠ D12; (s) ⊦ D4 ≠ D11; (s) ⊦ D4 ≠ D10; (s) ⊦ D4 ≠ D9; (s) ⊦ D4 ≠ D8; (s) ⊦ D4 ≠ D6; (s) ⊦ D4 ≠ D5; (s) ⊦ D3 ≠ D4; (s) ⊦ dom st0 = dom st1 ∧ a ∈ st0 → a ∈ st1; (ss) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, D4, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, D4, a) = D5; (s) Used terms: gs, ls, pc

Proof step 47 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ DMSQLInv(gs, ls, pc) ↔ (pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → (ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ (pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ (pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ (pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ (pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ;gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → 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)) ∧ (pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ (gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ (pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ (pc = E9 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.nxt = null ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ (pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → 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)) ∧ (pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ (pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ (pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns)) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ (pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns))) ∧ (pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)))

A spec-lemma

Proof step 48 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs.vretRefs(tid0) = gstepf(gs, ls, D4, a).vretRefs(tid0), gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D4, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D4, a).vs, gstepf(gs, ls, D4, a).ps, gstepf(gs, ls, D4, a).owns), equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D4, a).vs, gstepf(gs, ls, D4, a).ps), nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, D4, a).vhead, gstepf(gs, ls, D4, a).vs), noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl, gstepf(gs, ls, D4, a).vs), ownsRely(tid0, gs.owns, gstepf(gs, ls, D4, a).owns), pre(gs, ls, pc, a), prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D4, a).prvHp), rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D4, a).rvowns, gs.vrvHp), rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D4, a).vretRefs, gstepf(gs, ls, D4, a).vrvHp), gstepf(gs, ls, D4, a).vtail ∈ gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl from gs.vtail, gstepf(gs, ls, D4, a).phead ∈ gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl from gs.phead, gstepf(gs, ls, D4, a).vhead ∈ gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl from gs.vhead, dom gs.vrvHp ⊆ dom gstepf(gs, ls, D4, a).vrvHp, ¬ DMSQRely(gs, tid0, gs0), ∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl, ∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D4, a).orl, gs.pretRefs(tid0) = gstepf(gs, ls, D4, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D4, a).pretRefs(tid0) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQRely, seq:⊦ DMSQRely(gs, tid, gs0) ↔ (∃ 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, tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid) = gs0.vretRefs(tid) ∧ ( gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid)) ∧ rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(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(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid, gs.owns, gs0.owns), subst:[gs, tid, gs0] → [gs, tid0, gs0], <all paths>

Additional information

Used simplifier rules: ⊦ pre(gs, ls, D4, a) ↔ a = τ; (s) ⊦ (gs.pretRefs:= vretRefs0).prvHp = gs.prvHp; (s) ⊦ prvHpRely(vrvHp, prvHp, prvHp); (s) ⊦ (gs.pretRefs:= vretRefs0).rvowns = gs.rvowns; (s) ⊦ rvownsrely(tid, rvowns, rvowns, vrvHp); (s) ⊦ (gs.pretRefs:= vretRefs0).vretRefs = gs.vretRefs; (s) ⊦ rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs, vrvHp); (s) ⊦ (gs.pretRefs:= vretRefs0).phead = gs.phead; (s) ⊦ (gs.pretRefs:= vretRefs0).vtail = gs.vtail; (s) ⊦ (gs.pretRefs:= vretRefs0).vrvHp = gs.vrvHp; (s) ⊦ # s = # s0 → (s ⊆ s0 ↔ s = s0); (s) ⊦ equalowns(vs, ps, owns, tid, vs, ps, owns); (s) ⊦ (gs.pretRefs:= vretRefs0).ps = gs.ps; (s) ⊦ equalrl(rl, vs, ps, vs, ps); (s) ⊦ (gs.pretRefs:= vretRefs0).vhead = gs.vhead; (s) ⊦ nextnottidRely(tid, vhead, vs, vhead, vs); (s) ⊦ (gs.pretRefs:= vretRefs0).vs = gs.vs; (s) ⊦ (gs.pretRefs:= vretRefs0).owns = gs.owns; (s) ⊦ ownsRely(tid, owns, owns); (s) ⊦ (gs.pretRefs:= vretRefs0).qrl = gs.qrl; (s) ⊦ # x = # z → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) ⊦ (gs.pretRefs:= vretRefs0).orl = gs.orl; (s) ⊦ gstepf(gs, ls, D4, τ) = gs.pretRefs:= gs.pretRefs(ls.tid; gs.vretRefs(ls.tid)); (s) ⊦ (gs.pretRefs:= vretRefs0).pretRefs = vretRefs0; (s) ⊦ noidRely(tid, rl, vs, rl, vs); (s) ⊦ [] + x = x; (s) ⊦ x = x + y ↔ y = []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: gs, tid0, gs0

Proof step 49 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ DMSQRely(gs, tid, gs0) ↔ (∃ 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, tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid) = gs0.vretRefs(tid) ∧ (gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid)) ∧ rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(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(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid, gs.owns, gs0.owns)

A spec-lemma

Proof step 50 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D13, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a), ¬ DMSQRely(gs, tid0, gs0) ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:rely-D13-D14, seq:⊦ ls.tid ≠ tid0 ∧ ( (ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ ( 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.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D13, a) ∧ pcstepf(gs, ls, D13, a) = D14 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D13, a).orl + gstepf(gs, ls, D13, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D13, a).orl) ∧ gstepf(gs, ls, D13, a).vtail ∈ gstepf(gs, ls, D13, a).orl + gstepf(gs, ls, D13, a).qrl from gs.vtail ∧ gstepf(gs, ls, D13, a).phead ∈ gstepf(gs, ls, D13, a).orl + gstepf(gs, ls, D13, a).qrl from gs.phead ∧ gstepf(gs, ls, D13, a).vhead ∈ gstepf(gs, ls, D13, a).orl + gstepf(gs, ls, D13, a).qrl from gs.vhead ∧ equalrl (gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D13, a).vs, gstepf(gs, ls, D13, a).ps) ∧ equalowns (gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D13, a).vs, gstepf(gs, ls, D13, a).ps, gstepf(gs, ls, D13, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, D13, a).vretRefs(tid0) ∧ ( gs.pretRefs(tid0) = gstepf(gs, ls, D13, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D13, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D13, a).rvowns, gs.vrvHp) ∧ rvrely (tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D13, a).vretRefs, gstepf(gs, ls, D13, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, D13, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D13, a).prvHp) ∧ noidRely (tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D13, a).orl + gstepf(gs, ls, D13, a).qrl, gstepf(gs, ls, D13, a).vs) ∧ nextnottidRely (tid0, gs.vhead, gs.vs, gstepf(gs, ls, D13, a).vhead, gstepf(gs, ls, D13, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, D13, a).owns), subst:[ls, tid0, gs, a] → [ls, tid0, gs, a]

Additional information

Used terms: ls, tid0, gs, a

Proof step 51 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ ls.tid ≠ tid0 ∧ ( (ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ ( 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.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D13, a) ∧ pcstepf(gs, ls, D13, a) = D14 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D13, a).orl + gstepf(gs, ls, D13, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D13, a).orl) ∧ gstepf(gs, ls, D13, a).vtail ∈ gstepf(gs, ls, D13, a).orl + gstepf(gs, ls, D13, a).qrl from gs.vtail ∧ gstepf(gs, ls, D13, a).phead ∈ gstepf(gs, ls, D13, a).orl + gstepf(gs, ls, D13, a).qrl from gs.phead ∧ gstepf(gs, ls, D13, a).vhead ∈ gstepf(gs, ls, D13, a).orl + gstepf(gs, ls, D13, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D13, a).vs, gstepf(gs, ls, D13, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D13, a).vs, gstepf(gs, ls, D13, a).ps, gstepf(gs, ls, D13, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, D13, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, D13, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D13, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D13, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D13, a).vretRefs, gstepf(gs, ls, D13, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, D13, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D13, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D13, a).orl + gstepf(gs, ls, D13, a).qrl, gstepf(gs, ls, D13, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, D13, a).vhead, gstepf(gs, ls, D13, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, D13, a).owns)

Lemma rely-D13-D14

Proof step 52 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D13, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a), ¬ DMSQRely(gs, tid0, gs0), ls.tid ≠ tid0 ∧ ( (ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ ( 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.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D13, a) ∧ pcstepf(gs, ls, D13, a) = D14 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D13, a).orl + gstepf(gs, ls, D13, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D13, a).orl) ∧ gstepf(gs, ls, D13, a).vtail ∈ gstepf(gs, ls, D13, a).orl + gstepf(gs, ls, D13, a).qrl from gs.vtail ∧ gstepf(gs, ls, D13, a).phead ∈ gstepf(gs, ls, D13, a).orl + gstepf(gs, ls, D13, a).qrl from gs.phead ∧ gstepf(gs, ls, D13, a).vhead ∈ gstepf(gs, ls, D13, a).orl + gstepf(gs, ls, D13, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D13, a).vs, gstepf(gs, ls, D13, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D13, a).vs, gstepf(gs, ls, D13, a).ps, gstepf(gs, ls, D13, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, D13, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, D13, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D13, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D13, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D13, a).vretRefs, gstepf(gs, ls, D13, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, D13, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D13, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D13, a).orl + gstepf(gs, ls, D13, a).qrl, gstepf(gs, ls, D13, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, D13, a).vhead, gstepf(gs, ls, D13, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, D13, a).owns) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 10

Additional information

Proof step 53 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D13, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a), ¬ DMSQRely(gs, tid0, gs0) ⊦ ls.tid ≠ tid0 ∧ ( (ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ ( 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.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D13, a) ∧ pcstepf(gs, ls, D13, a) = D14

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQGInv, seq:⊦ DMSQGInv(gs) ↔ 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), subst:[gs] → [gs], <all paths>

Additional information

Used terms: gs

Proof step 54 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ DMSQGInv(gs) ↔ 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)

A spec-lemma

Proof step 55 from proof copied-rely-DMSQLInv (previous step) (back to tree)

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D13, pc0 = pcstepf(gs, ls, pc, a), gs.orl ≠ [], ls.tid ≠ tid0, DMSQLInv(gs, ls, pc), 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), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, pc, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ DMSQRely(gs, tid0, gs0), ¬ 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.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.tid ≠ tid0 ∧ ( (ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ ( 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.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D13, a) ∧ pcstepf(gs, ls, D13, a) = D14

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQLInv, seq:⊦ DMSQLInv(gs, ls, pc) ↔ ( pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → ( ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ ( pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ ( pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ ( pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ; gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → 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)) ∧ ( pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ( gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E9 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.nxt = null ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ ( pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → 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)) ∧ ( pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ ( pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) ) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ ( pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) )) ∧ ( pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )), subst:[gs, ls, pc] → [gs, ls, pc], <all paths>

Additional information

Used simplifier rules: ⊦ D13 ≠ crashed; (s) ⊦ D13 ≠ idle; (s) ⊦ D13 ≠ ready; (s) ⊦ D13 ≠ E1; (s) ⊦ D13 ≠ E17; (s) ⊦ D1 ≠ D13; (s) ⊦ D2 ≠ D13; (s) ⊦ D7 ≠ D13; (s) ⊦ D13 ≠ D32; (s) ⊦ D13 ≠ D33; (s) ⊦ D13 ≠ E4; (s) ⊦ D13 ≠ E16; (s) ⊦ D13 ≠ E15; (s) ⊦ D13 ≠ E14; (s) ⊦ D13 ≠ E13; (s) ⊦ D13 ≠ E12; (s) ⊦ D13 ≠ E11; (s) ⊦ D13 ≠ E10; (s) ⊦ D13 ≠ E9; (s) ⊦ D13 ≠ E8; (s) ⊦ D13 ≠ E7; (s) ⊦ D13 ≠ E6; (s) ⊦ D13 ≠ E5; (s) ⊦ D13 ≠ E3; (s) ⊦ D13 ≠ E2; (s) ⊦ D13 ≠ D34; (s) ⊦ D13 ≠ D31; (s) ⊦ D13 ≠ D30; (s) ⊦ D13 ≠ D29; (s) ⊦ D13 ≠ D28; (s) ⊦ D13 ≠ D27; (s) ⊦ D13 ≠ D26; (s) ⊦ D13 ≠ D25; (s) ⊦ D13 ≠ D24; (s) ⊦ D13 ≠ D23; (s) ⊦ D13 ≠ D22; (s) ⊦ D13 ≠ D21; (s) ⊦ D13 ≠ D20; (s) ⊦ D13 ≠ D19; (s) ⊦ D13 ≠ D18; (s) ⊦ D13 ≠ D17; (s) ⊦ D13 ≠ D16; (s) ⊦ D13 ≠ D15; (s) ⊦ D13 ≠ D14; (s) ⊦ D12 ≠ D13; (s) ⊦ D11 ≠ D13; (s) ⊦ D10 ≠ D13; (s) ⊦ D9 ≠ D13; (s) ⊦ D8 ≠ D13; (s) ⊦ D6 ≠ D13; (s) ⊦ D5 ≠ D13; (s) ⊦ D4 ≠ D13; (s) ⊦ D3 ≠ D13; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, D13, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, D13, a) = D14; (s) Used terms: gs, ls, pc

Proof step 56 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ DMSQLInv(gs, ls, pc) ↔ (pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → (ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ (pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ (pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ (pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ (pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ;gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → 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)) ∧ (pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ (gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ (pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ (pc = E9 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.nxt = null ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ (pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → 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)) ∧ (pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ (pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ (pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns)) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ (pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns))) ∧ (pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)))

A spec-lemma

Proof step 57 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs.vretRefs(tid0) = gstepf(gs, ls, D13, a).vretRefs(tid0), gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D13, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D13, a).vs, gstepf(gs, ls, D13, a).ps, gstepf(gs, ls, D13, a).owns), equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D13, a).vs, gstepf(gs, ls, D13, a).ps), nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, D13, a).vhead, gstepf(gs, ls, D13, a).vs), noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D13, a).orl + gstepf(gs, ls, D13, a).qrl, gstepf(gs, ls, D13, a).vs), ownsRely(tid0, gs.owns, gstepf(gs, ls, D13, a).owns), pre(gs, ls, pc, a), prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D13, a).prvHp), rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D13, a).rvowns, gs.vrvHp), rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D13, a).vretRefs, gstepf(gs, ls, D13, a).vrvHp), gstepf(gs, ls, D13, a).vtail ∈ gstepf(gs, ls, D13, a).orl + gstepf(gs, ls, D13, a).qrl from gs.vtail, gstepf(gs, ls, D13, a).phead ∈ gstepf(gs, ls, D13, a).orl + gstepf(gs, ls, D13, a).qrl from gs.phead, gstepf(gs, ls, D13, a).vhead ∈ gstepf(gs, ls, D13, a).orl + gstepf(gs, ls, D13, a).qrl from gs.vhead, dom gs.vrvHp ⊆ dom gstepf(gs, ls, D13, a).vrvHp, ¬ DMSQRely(gs, tid0, gs0), ∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D13, a).orl + gstepf(gs, ls, D13, a).qrl, ∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D13, a).orl, gs.pretRefs(tid0) = gstepf(gs, ls, D13, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D13, a).pretRefs(tid0) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQRely, seq:⊦ DMSQRely(gs, tid, gs0) ↔ (∃ 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, tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid) = gs0.vretRefs(tid) ∧ ( gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid)) ∧ rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(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(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid, gs.owns, gs0.owns), subst:[gs, tid, gs0] → [gs, tid0, gs0], <all paths>

Additional information

Used simplifier rules: ⊦ pre(gs, ls, D13, a) ↔ a = τ; (s) ⊦ (gs.vrvHp:= vrvHp).prvHp = gs.prvHp; (s) ⊦ prvHpRely(vrvHp, prvHp, prvHp); (s) ⊦ (gs.vrvHp:= vrvHp).rvowns = gs.rvowns; (s) ⊦ rvownsrely(tid, rvowns, rvowns, vrvHp); (s) ⊦ (gs.vrvHp:= vrvHp).vretRefs = gs.vretRefs; (s) ⊦ (gs.vrvHp:= vrvHp).phead = gs.phead; (s) ⊦ (gs.vrvHp:= vrvHp).vtail = gs.vtail; (s) ⊦ (gs.vrvHp:= vrvHp).vrvHp = vrvHp; (s) ⊦ dom st[a, d] = dom st ++ a; (s) ⊦ s ⊆ s ++ a; (s) ⊦ equalowns(vs, ps, owns, tid, vs, ps, owns); (s) ⊦ (gs.vrvHp:= vrvHp).ps = gs.ps; (s) ⊦ equalrl(rl, vs, ps, vs, ps); (s) ⊦ (gs.vrvHp:= vrvHp).vhead = gs.vhead; (s) ⊦ nextnottidRely(tid, vhead, vs, vhead, vs); (s) ⊦ (gs.vrvHp:= vrvHp).vs = gs.vs; (s) ⊦ (gs.vrvHp:= vrvHp).owns = gs.owns; (s) ⊦ ownsRely(tid, owns, owns); (s) ⊦ (gs.vrvHp:= vrvHp).qrl = gs.qrl; (s) ⊦ # x = # z → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) ⊦ (gs.vrvHp:= vrvHp).orl = gs.orl; (s) ⊦ gstepf(gs, ls, D13, τ) = gs.vrvHp:= gs.vrvHp[ls.rvref, Empty]; (s) ⊦ (gs.vrvHp:= vrvHp).pretRefs = gs.pretRefs; (s) ⊦ noidRely(tid, rl, vs, rl, vs); (s) ⊦ [] + x = x; (s) ⊦ x = x + y ↔ y = []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: gs, tid0, gs0

Proof step 58 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ DMSQRely(gs, tid, gs0) ↔ (∃ 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, tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid) = gs0.vretRefs(tid) ∧ (gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid)) ∧ rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(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(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid, gs.owns, gs0.owns)

A spec-lemma

Proof step 59 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D14, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a), ¬ DMSQRely(gs, tid0, gs0) ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:rely-D14-D15, seq:⊦ ls.tid ≠ tid0 ∧ ( ( ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ ( 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.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D14, a) ∧ pcstepf(gs, ls, D14, a) = D15 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D14, a).orl + gstepf(gs, ls, D14, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D14, a).orl) ∧ gstepf(gs, ls, D14, a).vtail ∈ gstepf(gs, ls, D14, a).orl + gstepf(gs, ls, D14, a).qrl from gs.vtail ∧ gstepf(gs, ls, D14, a).phead ∈ gstepf(gs, ls, D14, a).orl + gstepf(gs, ls, D14, a).qrl from gs.phead ∧ gstepf(gs, ls, D14, a).vhead ∈ gstepf(gs, ls, D14, a).orl + gstepf(gs, ls, D14, a).qrl from gs.vhead ∧ equalrl (gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D14, a).vs, gstepf(gs, ls, D14, a).ps) ∧ equalowns (gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D14, a).vs, gstepf(gs, ls, D14, a).ps, gstepf(gs, ls, D14, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, D14, a).vretRefs(tid0) ∧ ( gs.pretRefs(tid0) = gstepf(gs, ls, D14, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D14, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D14, a).rvowns, gs.vrvHp) ∧ rvrely (tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D14, a).vretRefs, gstepf(gs, ls, D14, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, D14, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D14, a).prvHp) ∧ noidRely (tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D14, a).orl + gstepf(gs, ls, D14, a).qrl, gstepf(gs, ls, D14, a).vs) ∧ nextnottidRely (tid0, gs.vhead, gs.vs, gstepf(gs, ls, D14, a).vhead, gstepf(gs, ls, D14, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, D14, a).owns), subst:[ls, tid0, gs, a] → [ls, tid0, gs, a]

Additional information

Used terms: ls, tid0, gs, a

Proof step 60 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ ls.tid ≠ tid0 ∧ ( (ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ ( 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.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D14, a) ∧ pcstepf(gs, ls, D14, a) = D15 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D14, a).orl + gstepf(gs, ls, D14, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D14, a).orl) ∧ gstepf(gs, ls, D14, a).vtail ∈ gstepf(gs, ls, D14, a).orl + gstepf(gs, ls, D14, a).qrl from gs.vtail ∧ gstepf(gs, ls, D14, a).phead ∈ gstepf(gs, ls, D14, a).orl + gstepf(gs, ls, D14, a).qrl from gs.phead ∧ gstepf(gs, ls, D14, a).vhead ∈ gstepf(gs, ls, D14, a).orl + gstepf(gs, ls, D14, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D14, a).vs, gstepf(gs, ls, D14, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D14, a).vs, gstepf(gs, ls, D14, a).ps, gstepf(gs, ls, D14, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, D14, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, D14, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D14, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D14, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D14, a).vretRefs, gstepf(gs, ls, D14, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, D14, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D14, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D14, a).orl + gstepf(gs, ls, D14, a).qrl, gstepf(gs, ls, D14, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, D14, a).vhead, gstepf(gs, ls, D14, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, D14, a).owns)

Lemma rely-D14-D15

Proof step 61 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D14, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a), ¬ DMSQRely(gs, tid0, gs0), ls.tid ≠ tid0 ∧ ( (ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ ( 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.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D14, a) ∧ pcstepf(gs, ls, D14, a) = D15 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D14, a).orl + gstepf(gs, ls, D14, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D14, a).orl) ∧ gstepf(gs, ls, D14, a).vtail ∈ gstepf(gs, ls, D14, a).orl + gstepf(gs, ls, D14, a).qrl from gs.vtail ∧ gstepf(gs, ls, D14, a).phead ∈ gstepf(gs, ls, D14, a).orl + gstepf(gs, ls, D14, a).qrl from gs.phead ∧ gstepf(gs, ls, D14, a).vhead ∈ gstepf(gs, ls, D14, a).orl + gstepf(gs, ls, D14, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D14, a).vs, gstepf(gs, ls, D14, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D14, a).vs, gstepf(gs, ls, D14, a).ps, gstepf(gs, ls, D14, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, D14, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, D14, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D14, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D14, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D14, a).vretRefs, gstepf(gs, ls, D14, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, D14, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D14, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D14, a).orl + gstepf(gs, ls, D14, a).qrl, gstepf(gs, ls, D14, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, D14, a).vhead, gstepf(gs, ls, D14, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, D14, a).owns) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 10

Additional information

Proof step 62 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D14, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a), ¬ DMSQRely(gs, tid0, gs0) ⊦ ls.tid ≠ tid0 ∧ ( (ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ ( 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.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D14, a) ∧ pcstepf(gs, ls, D14, a) = D15

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQGInv, seq:⊦ DMSQGInv(gs) ↔ 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), subst:[gs] → [gs], <all paths>

Additional information

Used terms: gs

Proof step 63 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ DMSQGInv(gs) ↔ 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)

A spec-lemma

Proof step 64 from proof copied-rely-DMSQLInv (previous step) (back to tree)

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D14, pc0 = pcstepf(gs, ls, pc, a), gs.orl ≠ [], ls.tid ≠ tid0, DMSQLInv(gs, ls, pc), 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), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, pc, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ DMSQRely(gs, tid0, gs0), ¬ 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.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.tid ≠ tid0 ∧ ( (ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ ( 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.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D14, a) ∧ pcstepf(gs, ls, D14, a) = D15

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQLInv, seq:⊦ DMSQLInv(gs, ls, pc) ↔ ( pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → ( ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ ( pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ ( pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ ( pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ; gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → 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)) ∧ ( pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ( gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E9 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.nxt = null ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ ( pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → 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)) ∧ ( pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ ( pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) ) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ ( pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) )) ∧ ( pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )), subst:[gs, ls, pc] → [gs, ls, pc], <all paths>

Additional information

Used simplifier rules: ⊦ gstepf(gs, ls, D14, a) = gs.prvHp:= gs.prvHp[ls.rvref, gs.vrvHp[ls.rvref]]; (s) ⊦ D14 ≠ crashed; (s) ⊦ D14 ≠ idle; (s) ⊦ D14 ≠ ready; (s) ⊦ D14 ≠ E1; (s) ⊦ D14 ≠ E17; (s) ⊦ D1 ≠ D14; (s) ⊦ D2 ≠ D14; (s) ⊦ D7 ≠ D14; (s) ⊦ D14 ≠ D32; (s) ⊦ D14 ≠ D33; (s) ⊦ D14 ≠ E4; (s) ⊦ D14 ≠ E16; (s) ⊦ D14 ≠ E15; (s) ⊦ D14 ≠ E14; (s) ⊦ D14 ≠ E13; (s) ⊦ D14 ≠ E12; (s) ⊦ D14 ≠ E11; (s) ⊦ D14 ≠ E10; (s) ⊦ D14 ≠ E9; (s) ⊦ D14 ≠ E8; (s) ⊦ D14 ≠ E7; (s) ⊦ D14 ≠ E6; (s) ⊦ D14 ≠ E5; (s) ⊦ D14 ≠ E3; (s) ⊦ D14 ≠ E2; (s) ⊦ D14 ≠ D34; (s) ⊦ D14 ≠ D31; (s) ⊦ D14 ≠ D30; (s) ⊦ D14 ≠ D29; (s) ⊦ D14 ≠ D28; (s) ⊦ D14 ≠ D27; (s) ⊦ D14 ≠ D26; (s) ⊦ D14 ≠ D25; (s) ⊦ D14 ≠ D24; (s) ⊦ D14 ≠ D23; (s) ⊦ D14 ≠ D22; (s) ⊦ D14 ≠ D21; (s) ⊦ D14 ≠ D20; (s) ⊦ D14 ≠ D19; (s) ⊦ D14 ≠ D18; (s) ⊦ D14 ≠ D17; (s) ⊦ D14 ≠ D16; (s) ⊦ D14 ≠ D15; (s) ⊦ D13 ≠ D14; (s) ⊦ D12 ≠ D14; (s) ⊦ D11 ≠ D14; (s) ⊦ D10 ≠ D14; (s) ⊦ D9 ≠ D14; (s) ⊦ D8 ≠ D14; (s) ⊦ D6 ≠ D14; (s) ⊦ D5 ≠ D14; (s) ⊦ D4 ≠ D14; (s) ⊦ D3 ≠ D14; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, D14, a) ↔ a = doDeqEmpty(ls.tid); (s) ⊦ pcstepf(gs, ls, D14, a) = D15; (s) Used terms: gs, ls, pc

Proof step 65 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ DMSQLInv(gs, ls, pc) ↔ (pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → (ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ (pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ (pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ (pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ (pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ;gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → 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)) ∧ (pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ (gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ (pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ (pc = E9 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.nxt = null ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ (pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → 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)) ∧ (pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ (pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ (pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns)) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ (pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns))) ∧ (pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)))

A spec-lemma

Proof step 66 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs.vretRefs(tid0) = gstepf(gs, ls, D14, a).vretRefs(tid0), gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D14, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D14, a).vs, gstepf(gs, ls, D14, a).ps, gstepf(gs, ls, D14, a).owns), equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D14, a).vs, gstepf(gs, ls, D14, a).ps), nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, D14, a).vhead, gstepf(gs, ls, D14, a).vs), noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D14, a).orl + gstepf(gs, ls, D14, a).qrl, gstepf(gs, ls, D14, a).vs), ownsRely(tid0, gs.owns, gstepf(gs, ls, D14, a).owns), pre(gs, ls, pc, a), prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D14, a).prvHp), rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D14, a).rvowns, gs.vrvHp), rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D14, a).vretRefs, gstepf(gs, ls, D14, a).vrvHp), gstepf(gs, ls, D14, a).vtail ∈ gstepf(gs, ls, D14, a).orl + gstepf(gs, ls, D14, a).qrl from gs.vtail, gstepf(gs, ls, D14, a).phead ∈ gstepf(gs, ls, D14, a).orl + gstepf(gs, ls, D14, a).qrl from gs.phead, gstepf(gs, ls, D14, a).vhead ∈ gstepf(gs, ls, D14, a).orl + gstepf(gs, ls, D14, a).qrl from gs.vhead, dom gs.vrvHp ⊆ dom gstepf(gs, ls, D14, a).vrvHp, ¬ DMSQRely(gs, tid0, gs0), ∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D14, a).orl + gstepf(gs, ls, D14, a).qrl, ∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D14, a).orl, gs.pretRefs(tid0) = gstepf(gs, ls, D14, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D14, a).pretRefs(tid0) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQRely, seq:⊦ DMSQRely(gs, tid, gs0) ↔ (∃ 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, tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid) = gs0.vretRefs(tid) ∧ ( gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid)) ∧ rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(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(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid, gs.owns, gs0.owns), subst:[gs, tid, gs0] → [gs, tid0, gs0], <all paths>

Additional information

Used simplifier rules: ⊦ pre(gs, ls, D14, a) ↔ a = doDeqEmpty(ls.tid); (s) ⊦ # x = # z → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) ⊦ x = x + y ↔ y = []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ (gs.prvHp:= vrvHp0).vtail = gs.vtail; (s) ⊦ (gs.prvHp:= vrvHp0).phead = gs.phead; (s) ⊦ equalrl(rl, vs, ps, vs, ps); (s) ⊦ (gs.prvHp:= vrvHp0).ps = gs.ps; (s) ⊦ equalowns(vs, ps, owns, tid, vs, ps, owns); (s) ⊦ (gs.prvHp:= vrvHp0).pretRefs = gs.pretRefs; (s) ⊦ (gs.prvHp:= vrvHp0).rvowns = gs.rvowns; (s) ⊦ rvownsrely(tid, rvowns, rvowns, vrvHp); (s) ⊦ (gs.prvHp:= vrvHp0).vretRefs = gs.vretRefs; (s) ⊦ rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs, vrvHp); (s) ⊦ (gs.prvHp:= vrvHp0).vrvHp = gs.vrvHp; (s) ⊦ # s = # s0 → (s ⊆ s0 ↔ s = s0); (s) ⊦ (gs.prvHp:= vrvHp0).prvHp = vrvHp0; (s) ⊦ (gs.prvHp:= vrvHp0).orl = gs.orl; (s) ⊦ (gs.prvHp:= vrvHp0).qrl = gs.qrl; (s) ⊦ noidRely(tid, rl, vs, rl, vs); (s) ⊦ (gs.prvHp:= vrvHp0).vhead = gs.vhead; (s) ⊦ (gs.prvHp:= vrvHp0).vs = gs.vs; (s) ⊦ nextnottidRely(tid, vhead, vs, vhead, vs); (s) ⊦ gstepf(gs, ls, D14, a) = gs.prvHp:= gs.prvHp[ls.rvref, gs.vrvHp[ls.rvref]]; (s) ⊦ (gs.prvHp:= vrvHp0).owns = gs.owns; (s) ⊦ ownsRely(tid, owns, owns); (s) Used terms: gs, tid0, gs0

Proof step 67 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ DMSQRely(gs, tid, gs0) ↔ (∃ 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, tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid) = gs0.vretRefs(tid) ∧ (gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid)) ∧ rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(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(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid, gs.owns, gs0.owns)

A spec-lemma

Proof step 68 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D16, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a), ¬ DMSQRely(gs, tid0, gs0) ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:rely-D16-D17, seq:⊦ ls.tid ≠ tid0 ∧ ( ( ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( 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.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D16, a) ∧ pcstepf(gs, ls, D16, a) = D17 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D16, a).orl) ∧ gstepf(gs, ls, D16, a).vtail ∈ gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl from gs.vtail ∧ gstepf(gs, ls, D16, a).phead ∈ gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl from gs.phead ∧ gstepf(gs, ls, D16, a).vhead ∈ gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl from gs.vhead ∧ equalrl (gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D16, a).vs, gstepf(gs, ls, D16, a).ps) ∧ equalowns (gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D16, a).vs, gstepf(gs, ls, D16, a).ps, gstepf(gs, ls, D16, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, D16, a).vretRefs(tid0) ∧ ( gs.pretRefs(tid0) = gstepf(gs, ls, D16, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D16, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D16, a).rvowns, gs.vrvHp) ∧ rvrely (tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D16, a).vretRefs, gstepf(gs, ls, D16, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, D16, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D16, a).prvHp) ∧ noidRely (tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl, gstepf(gs, ls, D16, a).vs) ∧ nextnottidRely (tid0, gs.vhead, gs.vs, gstepf(gs, ls, D16, a).vhead, gstepf(gs, ls, D16, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, D16, a).owns), subst:[ls, tid0, gs, a] → [ls, tid0, gs, a]

Additional information

Used terms: ls, tid0, gs, a

Proof step 69 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ ls.tid ≠ tid0 ∧ ( (ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( 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.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D16, a) ∧ pcstepf(gs, ls, D16, a) = D17 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D16, a).orl) ∧ gstepf(gs, ls, D16, a).vtail ∈ gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl from gs.vtail ∧ gstepf(gs, ls, D16, a).phead ∈ gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl from gs.phead ∧ gstepf(gs, ls, D16, a).vhead ∈ gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D16, a).vs, gstepf(gs, ls, D16, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D16, a).vs, gstepf(gs, ls, D16, a).ps, gstepf(gs, ls, D16, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, D16, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, D16, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D16, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D16, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D16, a).vretRefs, gstepf(gs, ls, D16, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, D16, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D16, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl, gstepf(gs, ls, D16, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, D16, a).vhead, gstepf(gs, ls, D16, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, D16, a).owns)

Lemma rely-D16-D17

Proof step 70 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D16, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a), ¬ DMSQRely(gs, tid0, gs0), ls.tid ≠ tid0 ∧ ( (ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( 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.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D16, a) ∧ pcstepf(gs, ls, D16, a) = D17 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D16, a).orl) ∧ gstepf(gs, ls, D16, a).vtail ∈ gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl from gs.vtail ∧ gstepf(gs, ls, D16, a).phead ∈ gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl from gs.phead ∧ gstepf(gs, ls, D16, a).vhead ∈ gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D16, a).vs, gstepf(gs, ls, D16, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D16, a).vs, gstepf(gs, ls, D16, a).ps, gstepf(gs, ls, D16, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, D16, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, D16, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D16, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D16, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D16, a).vretRefs, gstepf(gs, ls, D16, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, D16, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D16, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl, gstepf(gs, ls, D16, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, D16, a).vhead, gstepf(gs, ls, D16, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, D16, a).owns) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 10

Additional information

Proof step 71 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D16, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a), ¬ DMSQRely(gs, tid0, gs0) ⊦ ls.tid ≠ tid0 ∧ ( (ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( 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.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D16, a) ∧ pcstepf(gs, ls, D16, a) = D17

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQGInv, seq:⊦ DMSQGInv(gs) ↔ 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), subst:[gs] → [gs], <all paths>

Additional information

Used terms: gs

Proof step 72 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ DMSQGInv(gs) ↔ 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)

A spec-lemma

Proof step 73 from proof copied-rely-DMSQLInv (previous step) (back to tree)

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D16, pc0 = pcstepf(gs, ls, pc, a), gs.orl ≠ [], ls.tid ≠ tid0, DMSQLInv(gs, ls, pc), 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), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, pc, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ DMSQRely(gs, tid0, gs0), ¬ 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.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.tid ≠ tid0 ∧ ( (ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( 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.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D16, a) ∧ pcstepf(gs, ls, D16, a) = D17

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQLInv, seq:⊦ DMSQLInv(gs, ls, pc) ↔ ( pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → ( ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ ( pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ ( pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ ( pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ; gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → 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)) ∧ ( pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ( gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E9 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.nxt = null ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ ( pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → 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)) ∧ ( pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ ( pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) ) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ ( pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) )) ∧ ( pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )), subst:[gs, ls, pc] → [gs, ls, pc], <all paths>

Additional information

Used simplifier rules: ⊦ gstepf(gs, ls, D16, a) = ( ( gs .ps:= gs.ps [ls.lst, gs.ps[ls.lst].next:= gs.vs[ls.lst].next ]) .qrl:= (ls.lst = (gs.orl + gs.qrl).last ⊃ gs.qrl + ls.nxt;gs.qrl)) .owns:= (ls.lst = (gs.orl + gs.qrl).last ⊃ gs.owns(ls.nxt; None);gs.owns); (s) ⊦ x + a = x + a '; (s) ⊦ D16 ≠ crashed; (s) ⊦ D16 ≠ idle; (s) ⊦ D16 ≠ ready; (s) ⊦ D16 ≠ E1; (s) ⊦ D16 ≠ E17; (s) ⊦ D1 ≠ D16; (s) ⊦ D2 ≠ D16; (s) ⊦ D7 ≠ D16; (s) ⊦ D16 ≠ E4; (s) ⊦ D16 ≠ E16; (s) ⊦ D16 ≠ E15; (s) ⊦ D16 ≠ E14; (s) ⊦ D16 ≠ E13; (s) ⊦ D16 ≠ E12; (s) ⊦ D16 ≠ E11; (s) ⊦ D16 ≠ E10; (s) ⊦ D16 ≠ E9; (s) ⊦ D16 ≠ E8; (s) ⊦ D16 ≠ E7; (s) ⊦ D16 ≠ E6; (s) ⊦ D16 ≠ E5; (s) ⊦ D16 ≠ E3; (s) ⊦ D16 ≠ E2; (s) ⊦ D16 ≠ D34; (s) ⊦ D16 ≠ D31; (s) ⊦ D16 ≠ D30; (s) ⊦ D16 ≠ D29; (s) ⊦ D16 ≠ D28; (s) ⊦ D16 ≠ D27; (s) ⊦ D16 ≠ D26; (s) ⊦ D16 ≠ D25; (s) ⊦ D16 ≠ D24; (s) ⊦ D16 ≠ D23; (s) ⊦ D16 ≠ D22; (s) ⊦ D16 ≠ D21; (s) ⊦ D16 ≠ D20; (s) ⊦ D16 ≠ D19; (s) ⊦ D16 ≠ D18; (s) ⊦ D16 ≠ D17; (s) ⊦ D15 ≠ D16; (s) ⊦ D14 ≠ D16; (s) ⊦ D13 ≠ D16; (s) ⊦ D12 ≠ D16; (s) ⊦ D11 ≠ D16; (s) ⊦ D10 ≠ D16; (s) ⊦ D9 ≠ D16; (s) ⊦ D8 ≠ D16; (s) ⊦ D6 ≠ D16; (s) ⊦ D5 ≠ D16; (s) ⊦ D4 ≠ D16; (s) ⊦ D3 ≠ D16; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, D16, a) ↔ a = (ls.lst = (gs.orl + gs.qrl).last ⊃ doEnq(gs.owns(ls.nxt).tid);τ); (s) ⊦ pcstepf(gs, ls, D16, a) = D17; (s) Used terms: gs, ls, pc

Proof step 74 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ DMSQLInv(gs, ls, pc) ↔ (pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → (ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ (pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ (pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ (pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ (pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ;gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → 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)) ∧ (pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ (gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ (pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ (pc = E9 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.nxt = null ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ (pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → 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)) ∧ (pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ (pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ (pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns)) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ (pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns))) ∧ (pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)))

A spec-lemma

Proof step 75 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs.vretRefs(tid0) = gstepf(gs, ls, D16, a).vretRefs(tid0), gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D16, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D16, a).vs, gstepf(gs, ls, D16, a).ps, gstepf(gs, ls, D16, a).owns), equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D16, a).vs, gstepf(gs, ls, D16, a).ps), nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, D16, a).vhead, gstepf(gs, ls, D16, a).vs), noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl, gstepf(gs, ls, D16, a).vs), ownsRely(tid0, gs.owns, gstepf(gs, ls, D16, a).owns), pre(gs, ls, pc, a), prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D16, a).prvHp), rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D16, a).rvowns, gs.vrvHp), rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D16, a).vretRefs, gstepf(gs, ls, D16, a).vrvHp), gstepf(gs, ls, D16, a).vtail ∈ gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl from gs.vtail, gstepf(gs, ls, D16, a).phead ∈ gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl from gs.phead, gstepf(gs, ls, D16, a).vhead ∈ gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl from gs.vhead, dom gs.vrvHp ⊆ dom gstepf(gs, ls, D16, a).vrvHp, ¬ DMSQRely(gs, tid0, gs0), ∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl, ∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D16, a).orl, gs.pretRefs(tid0) = gstepf(gs, ls, D16, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D16, a).pretRefs(tid0) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQRely, seq:⊦ DMSQRely(gs, tid, gs0) ↔ (∃ 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, tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid) = gs0.vretRefs(tid) ∧ ( gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid)) ∧ rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(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(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid, gs.owns, gs0.owns), subst:[gs, tid, gs0] → [gs, tid0, gs0], <all paths>

Additional information

Used simplifier rules: ⊦ pre(gs, ls, D16, a) ↔ a = (ls.lst = (gs.orl + gs.qrl).last ⊃ doEnq(gs.owns(ls.nxt).tid);τ); (s) ⊦ x = x + y ↔ y = []; (s) ⊦ (gs.owns:= owns).vtail = gs.vtail; (s) ⊦ (gs.qrl:= qrl).vtail = gs.vtail; (s) ⊦ (gs.ps:= ps).vtail = gs.vtail; (s) ⊦ (gs.owns:= owns).phead = gs.phead; (s) ⊦ (gs.qrl:= qrl).phead = gs.phead; (s) ⊦ (gs.ps:= ps).phead = gs.phead; (s) ⊦ (gs.owns:= owns).ps = gs.ps; (s) ⊦ (gs.qrl:= qrl).ps = gs.ps; (s) ⊦ (gs.ps:= ps).ps = ps; (s) ⊦ (gs.owns:= owns).rvowns = gs.rvowns; (s) ⊦ (gs.qrl:= qrl).rvowns = gs.rvowns; (s) ⊦ (gs.ps:= ps).rvowns = gs.rvowns; (s) ⊦ rvownsrely(tid, rvowns, rvowns, vrvHp); (s) ⊦ (gs.owns:= owns).vretRefs = gs.vretRefs; (s) ⊦ (gs.qrl:= qrl).vretRefs = gs.vretRefs; (s) ⊦ (gs.ps:= ps).vretRefs = gs.vretRefs; (s) ⊦ rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs, vrvHp); (s) ⊦ (gs.owns:= owns).vrvHp = gs.vrvHp; (s) ⊦ (gs.qrl:= qrl).vrvHp = gs.vrvHp; (s) ⊦ (gs.ps:= ps).vrvHp = gs.vrvHp; (s) ⊦ # s = # s0 → (s ⊆ s0 ↔ s = s0); (s) ⊦ (gs.owns:= owns).prvHp = gs.prvHp; (s) ⊦ (gs.qrl:= qrl).prvHp = gs.prvHp; (s) ⊦ (gs.ps:= ps).prvHp = gs.prvHp; (s) ⊦ prvHpRely(vrvHp, prvHp, prvHp); (s) ⊦ (gs.owns:= owns).orl = gs.orl; (s) ⊦ (gs.qrl:= qrl).orl = gs.orl; (s) ⊦ (gs.ps:= ps).orl = gs.orl; (s) ⊦ (gs.owns:= owns).qrl = gs.qrl; (s) ⊦ (gs.qrl:= qrl).qrl = qrl; (s) ⊦ (gs.owns:= owns).vhead = gs.vhead; (s) ⊦ (gs.qrl:= qrl).vhead = gs.vhead; (s) ⊦ (gs.ps:= ps).vhead = gs.vhead; (s) ⊦ (gs.owns:= owns).vs = gs.vs; (s) ⊦ (gs.qrl:= qrl).vs = gs.vs; (s) ⊦ (gs.ps:= ps).vs = gs.vs; (s) ⊦ nextnottidRely(tid, vhead, vs, vhead, vs); (s) ⊦ (gs.owns:= owns).owns = owns; (s) ⊦ gstepf(gs, ls, D16, a) = ( ( gs .ps:= gs.ps [ls.lst, gs.ps[ls.lst].next:= gs.vs[ls.lst].next ]) .qrl:= (ls.lst = (gs.orl + gs.qrl).last ⊃ gs.qrl + ls.nxt;gs.qrl)) .owns:= (ls.lst = (gs.orl + gs.qrl).last ⊃ gs.owns(ls.nxt; None);gs.owns); (s) ⊦ x + a = x + a '; (s) ⊦ (gs.owns:= owns).pretRefs = gs.pretRefs; (s) ⊦ (gs.qrl:= qrl).pretRefs = gs.pretRefs; (s) ⊦ (gs.ps:= ps).pretRefs = gs.pretRefs; (s) ⊦ # x = # z → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: gs, tid0, gs0

Proof step 76 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ DMSQRely(gs, tid, gs0) ↔ (∃ 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, tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid) = gs0.vretRefs(tid) ∧ (gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid)) ∧ rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(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(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid, gs.owns, gs0.owns)

A spec-lemma

Proof step 77 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D17, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a), ¬ DMSQRely(gs, tid0, gs0) ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:rely-D17-D6, seq:⊦ ls.tid ≠ tid0 ∧ ( ( ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( 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.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D17, a) ∧ pcstepf(gs, ls, D17, a) = D6 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D17, a).orl + gstepf(gs, ls, D17, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D17, a).orl) ∧ gstepf(gs, ls, D17, a).vtail ∈ gstepf(gs, ls, D17, a).orl + gstepf(gs, ls, D17, a).qrl from gs.vtail ∧ gstepf(gs, ls, D17, a).phead ∈ gstepf(gs, ls, D17, a).orl + gstepf(gs, ls, D17, a).qrl from gs.phead ∧ gstepf(gs, ls, D17, a).vhead ∈ gstepf(gs, ls, D17, a).orl + gstepf(gs, ls, D17, a).qrl from gs.vhead ∧ equalrl (gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D17, a).vs, gstepf(gs, ls, D17, a).ps) ∧ equalowns (gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D17, a).vs, gstepf(gs, ls, D17, a).ps, gstepf(gs, ls, D17, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, D17, a).vretRefs(tid0) ∧ ( gs.pretRefs(tid0) = gstepf(gs, ls, D17, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D17, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D17, a).rvowns, gs.vrvHp) ∧ rvrely (tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D17, a).vretRefs, gstepf(gs, ls, D17, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, D17, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D17, a).prvHp) ∧ noidRely (tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D17, a).orl + gstepf(gs, ls, D17, a).qrl, gstepf(gs, ls, D17, a).vs) ∧ nextnottidRely (tid0, gs.vhead, gs.vs, gstepf(gs, ls, D17, a).vhead, gstepf(gs, ls, D17, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, D17, a).owns), subst:[ls, tid0, gs, a] → [ls, tid0, gs, a]

Additional information

Used terms: ls, tid0, gs, a

Proof step 78 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ ls.tid ≠ tid0 ∧ ( (ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( 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.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D17, a) ∧ pcstepf(gs, ls, D17, a) = D6 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D17, a).orl + gstepf(gs, ls, D17, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D17, a).orl) ∧ gstepf(gs, ls, D17, a).vtail ∈ gstepf(gs, ls, D17, a).orl + gstepf(gs, ls, D17, a).qrl from gs.vtail ∧ gstepf(gs, ls, D17, a).phead ∈ gstepf(gs, ls, D17, a).orl + gstepf(gs, ls, D17, a).qrl from gs.phead ∧ gstepf(gs, ls, D17, a).vhead ∈ gstepf(gs, ls, D17, a).orl + gstepf(gs, ls, D17, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D17, a).vs, gstepf(gs, ls, D17, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D17, a).vs, gstepf(gs, ls, D17, a).ps, gstepf(gs, ls, D17, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, D17, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, D17, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D17, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D17, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D17, a).vretRefs, gstepf(gs, ls, D17, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, D17, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D17, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D17, a).orl + gstepf(gs, ls, D17, a).qrl, gstepf(gs, ls, D17, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, D17, a).vhead, gstepf(gs, ls, D17, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, D17, a).owns)

Lemma rely-D17-D6

Proof step 79 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D17, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a), ¬ DMSQRely(gs, tid0, gs0), ls.tid ≠ tid0 ∧ ( (ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( 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.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D17, a) ∧ pcstepf(gs, ls, D17, a) = D6 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D17, a).orl + gstepf(gs, ls, D17, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D17, a).orl) ∧ gstepf(gs, ls, D17, a).vtail ∈ gstepf(gs, ls, D17, a).orl + gstepf(gs, ls, D17, a).qrl from gs.vtail ∧ gstepf(gs, ls, D17, a).phead ∈ gstepf(gs, ls, D17, a).orl + gstepf(gs, ls, D17, a).qrl from gs.phead ∧ gstepf(gs, ls, D17, a).vhead ∈ gstepf(gs, ls, D17, a).orl + gstepf(gs, ls, D17, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D17, a).vs, gstepf(gs, ls, D17, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D17, a).vs, gstepf(gs, ls, D17, a).ps, gstepf(gs, ls, D17, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, D17, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, D17, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D17, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D17, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D17, a).vretRefs, gstepf(gs, ls, D17, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, D17, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D17, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D17, a).orl + gstepf(gs, ls, D17, a).qrl, gstepf(gs, ls, D17, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, D17, a).vhead, gstepf(gs, ls, D17, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, D17, a).owns) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 10

Additional information

Proof step 80 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D17, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a), ¬ DMSQRely(gs, tid0, gs0) ⊦ ls.tid ≠ tid0 ∧ ( (ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( 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.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D17, a) ∧ pcstepf(gs, ls, D17, a) = D6

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQGInv, seq:⊦ DMSQGInv(gs) ↔ 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), subst:[gs] → [gs], <all paths>

Additional information

Used terms: gs

Proof step 81 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ DMSQGInv(gs) ↔ 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)

A spec-lemma

Proof step 82 from proof copied-rely-DMSQLInv (previous step) (back to tree)

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D17, pc0 = pcstepf(gs, ls, pc, a), gs.orl ≠ [], ls.tid ≠ tid0, DMSQLInv(gs, ls, pc), 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), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, pc, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ DMSQRely(gs, tid0, gs0), ¬ 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.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.tid ≠ tid0 ∧ ( (ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( 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.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D17, a) ∧ pcstepf(gs, ls, D17, a) = D6

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQLInv, seq:⊦ DMSQLInv(gs, ls, pc) ↔ ( pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → ( ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ ( pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ ( pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ ( pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ; gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → 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)) ∧ ( pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ( gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E9 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.nxt = null ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ ( pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → 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)) ∧ ( pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ ( pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) ) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ ( pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) )) ∧ ( pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )), subst:[gs, ls, pc] → [gs, ls, pc], <all paths>

Additional information

Used simplifier rules: ⊦ gstepf(gs, ls, D17, a) = (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs); (s) ⊦ D17 ≠ crashed; (s) ⊦ D17 ≠ idle; (s) ⊦ D17 ≠ ready; (s) ⊦ D17 ≠ E1; (s) ⊦ D17 ≠ E17; (s) ⊦ D1 ≠ D17; (s) ⊦ D2 ≠ D17; (s) ⊦ D7 ≠ D17; (s) ⊦ D17 ≠ E4; (s) ⊦ D17 ≠ E16; (s) ⊦ D17 ≠ E15; (s) ⊦ D17 ≠ E14; (s) ⊦ D17 ≠ E13; (s) ⊦ D17 ≠ E12; (s) ⊦ D17 ≠ E11; (s) ⊦ D17 ≠ E10; (s) ⊦ D17 ≠ E9; (s) ⊦ D17 ≠ E8; (s) ⊦ D17 ≠ E7; (s) ⊦ D17 ≠ E6; (s) ⊦ D17 ≠ E5; (s) ⊦ D17 ≠ E3; (s) ⊦ D17 ≠ E2; (s) ⊦ D17 ≠ D34; (s) ⊦ D17 ≠ D31; (s) ⊦ D17 ≠ D30; (s) ⊦ D17 ≠ D29; (s) ⊦ D17 ≠ D28; (s) ⊦ D17 ≠ D27; (s) ⊦ D17 ≠ D26; (s) ⊦ D17 ≠ D25; (s) ⊦ D17 ≠ D24; (s) ⊦ D17 ≠ D23; (s) ⊦ D17 ≠ D22; (s) ⊦ D17 ≠ D21; (s) ⊦ D17 ≠ D20; (s) ⊦ D17 ≠ D19; (s) ⊦ D17 ≠ D18; (s) ⊦ D16 ≠ D17; (s) ⊦ D15 ≠ D17; (s) ⊦ D14 ≠ D17; (s) ⊦ D13 ≠ D17; (s) ⊦ D12 ≠ D17; (s) ⊦ D11 ≠ D17; (s) ⊦ D10 ≠ D17; (s) ⊦ D9 ≠ D17; (s) ⊦ D8 ≠ D17; (s) ⊦ D6 ≠ D17; (s) ⊦ D5 ≠ D17; (s) ⊦ D4 ≠ D17; (s) ⊦ D3 ≠ D17; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, D17, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, D17, a) = D6; (s) Used terms: gs, ls, pc

Proof step 83 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ DMSQLInv(gs, ls, pc) ↔ (pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → (ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ (pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ (pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ (pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ (pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ;gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → 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)) ∧ (pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ (gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ (pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ (pc = E9 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.nxt = null ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ (pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → 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)) ∧ (pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ (pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ (pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns)) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ (pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns))) ∧ (pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)))

A spec-lemma

Proof step 84 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs.vretRefs(tid0) = gstepf(gs, ls, D17, a).vretRefs(tid0), gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D17, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D17, a).vs, gstepf(gs, ls, D17, a).ps, gstepf(gs, ls, D17, a).owns), equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D17, a).vs, gstepf(gs, ls, D17, a).ps), nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, D17, a).vhead, gstepf(gs, ls, D17, a).vs), noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D17, a).orl + gstepf(gs, ls, D17, a).qrl, gstepf(gs, ls, D17, a).vs), ownsRely(tid0, gs.owns, gstepf(gs, ls, D17, a).owns), pre(gs, ls, pc, a), prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D17, a).prvHp), rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D17, a).rvowns, gs.vrvHp), rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D17, a).vretRefs, gstepf(gs, ls, D17, a).vrvHp), gstepf(gs, ls, D17, a).vtail ∈ gstepf(gs, ls, D17, a).orl + gstepf(gs, ls, D17, a).qrl from gs.vtail, gstepf(gs, ls, D17, a).phead ∈ gstepf(gs, ls, D17, a).orl + gstepf(gs, ls, D17, a).qrl from gs.phead, gstepf(gs, ls, D17, a).vhead ∈ gstepf(gs, ls, D17, a).orl + gstepf(gs, ls, D17, a).qrl from gs.vhead, dom gs.vrvHp ⊆ dom gstepf(gs, ls, D17, a).vrvHp, ¬ DMSQRely(gs, tid0, gs0), ∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D17, a).orl + gstepf(gs, ls, D17, a).qrl, ∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D17, a).orl, gs.pretRefs(tid0) = gstepf(gs, ls, D17, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D17, a).pretRefs(tid0) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQRely, seq:⊦ DMSQRely(gs, tid, gs0) ↔ (∃ 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, tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid) = gs0.vretRefs(tid) ∧ ( gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid)) ∧ rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(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(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid, gs.owns, gs0.owns), subst:[gs, tid, gs0] → [gs, tid0, gs0], <all paths>

Additional information

Used simplifier rules: ⊦ pre(gs, ls, D17, a) ↔ a = τ; (s) ⊦ gstepf(gs, ls, D17, a) = (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs); (s) ⊦ # x = # z → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: gs, tid0, gs0

Proof step 85 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ DMSQRely(gs, tid, gs0) ↔ (∃ 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, tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid) = gs0.vretRefs(tid) ∧ (gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid)) ∧ rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(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(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid, gs.owns, gs0.owns)

A spec-lemma

Proof step 86 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D19, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a), ¬ DMSQRely(gs, tid0, gs0) ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:rely-D19-D20, seq:⊦ ls.tid ≠ tid0 ∧ ( ( ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( 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.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from 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) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D19, a) ∧ pcstepf(gs, ls, D19, a) = D20 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D19, a).orl) ∧ gstepf(gs, ls, D19, a).vtail ∈ gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl from gs.vtail ∧ gstepf(gs, ls, D19, a).phead ∈ gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl from gs.phead ∧ gstepf(gs, ls, D19, a).vhead ∈ gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl from gs.vhead ∧ equalrl (gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D19, a).vs, gstepf(gs, ls, D19, a).ps) ∧ equalowns (gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D19, a).vs, gstepf(gs, ls, D19, a).ps, gstepf(gs, ls, D19, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, D19, a).vretRefs(tid0) ∧ ( gs.pretRefs(tid0) = gstepf(gs, ls, D19, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D19, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D19, a).rvowns, gs.vrvHp) ∧ rvrely (tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D19, a).vretRefs, gstepf(gs, ls, D19, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, D19, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D19, a).prvHp) ∧ noidRely (tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl, gstepf(gs, ls, D19, a).vs) ∧ nextnottidRely (tid0, gs.vhead, gs.vs, gstepf(gs, ls, D19, a).vhead, gstepf(gs, ls, D19, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, D19, a).owns), subst:[ls, tid0, gs, a] → [ls, tid0, gs, a]

Additional information

Used terms: ls, tid0, gs, a

Proof step 87 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ ls.tid ≠ tid0 ∧ ( (ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( 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.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from 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) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D19, a) ∧ pcstepf(gs, ls, D19, a) = D20 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D19, a).orl) ∧ gstepf(gs, ls, D19, a).vtail ∈ gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl from gs.vtail ∧ gstepf(gs, ls, D19, a).phead ∈ gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl from gs.phead ∧ gstepf(gs, ls, D19, a).vhead ∈ gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D19, a).vs, gstepf(gs, ls, D19, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D19, a).vs, gstepf(gs, ls, D19, a).ps, gstepf(gs, ls, D19, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, D19, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, D19, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D19, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D19, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D19, a).vretRefs, gstepf(gs, ls, D19, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, D19, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D19, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl, gstepf(gs, ls, D19, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, D19, a).vhead, gstepf(gs, ls, D19, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, D19, a).owns)

Lemma rely-D19-D20

Proof step 88 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D19, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a), ¬ DMSQRely(gs, tid0, gs0), ls.tid ≠ tid0 ∧ ( (ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( 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.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from 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) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D19, a) ∧ pcstepf(gs, ls, D19, a) = D20 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D19, a).orl) ∧ gstepf(gs, ls, D19, a).vtail ∈ gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl from gs.vtail ∧ gstepf(gs, ls, D19, a).phead ∈ gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl from gs.phead ∧ gstepf(gs, ls, D19, a).vhead ∈ gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D19, a).vs, gstepf(gs, ls, D19, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D19, a).vs, gstepf(gs, ls, D19, a).ps, gstepf(gs, ls, D19, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, D19, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, D19, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D19, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D19, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D19, a).vretRefs, gstepf(gs, ls, D19, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, D19, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D19, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl, gstepf(gs, ls, D19, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, D19, a).vhead, gstepf(gs, ls, D19, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, D19, a).owns) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 10

Additional information

Proof step 89 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D19, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a), ¬ DMSQRely(gs, tid0, gs0) ⊦ ls.tid ≠ tid0 ∧ ( (ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( 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.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from 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) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D19, a) ∧ pcstepf(gs, ls, D19, a) = D20

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQGInv, seq:⊦ DMSQGInv(gs) ↔ 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), subst:[gs] → [gs], <all paths>

Additional information

Used terms: gs

Proof step 90 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ DMSQGInv(gs) ↔ 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)

A spec-lemma

Proof step 91 from proof copied-rely-DMSQLInv (previous step) (back to tree)

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D19, pc0 = pcstepf(gs, ls, pc, a), gs.orl ≠ [], ls.tid ≠ tid0, DMSQLInv(gs, ls, pc), 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), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, pc, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ DMSQRely(gs, tid0, gs0), ¬ 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.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.tid ≠ tid0 ∧ ( (ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( 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.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from 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) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D19, a) ∧ pcstepf(gs, ls, D19, a) = D20

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQLInv, seq:⊦ DMSQLInv(gs, ls, pc) ↔ ( pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → ( ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ ( pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ ( pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ ( pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ; gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → 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)) ∧ ( pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ( gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E9 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.nxt = null ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ ( pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → 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)) ∧ ( pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ ( pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) ) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ ( pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) )) ∧ ( pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )), subst:[gs, ls, pc] → [gs, ls, pc], <all paths>

Additional information

Used simplifier rules: ⊦ gstepf(gs, ls, D19, a) = ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]) .rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ); (s) ⊦ D19 ≠ crashed; (s) ⊦ D19 ≠ D32; (s) ⊦ D19 ≠ D33; (s) ⊦ D19 ≠ idle; (s) ⊦ D19 ≠ ready; (s) ⊦ D19 ≠ E1; (s) ⊦ D19 ≠ E17; (s) ⊦ D1 ≠ D19; (s) ⊦ D2 ≠ D19; (s) ⊦ D7 ≠ D19; (s) ⊦ D19 ≠ E4; (s) ⊦ D19 ≠ E16; (s) ⊦ D19 ≠ E15; (s) ⊦ D19 ≠ E14; (s) ⊦ D19 ≠ E13; (s) ⊦ D19 ≠ E12; (s) ⊦ D19 ≠ E11; (s) ⊦ D19 ≠ E10; (s) ⊦ D19 ≠ E9; (s) ⊦ D19 ≠ E8; (s) ⊦ D19 ≠ E7; (s) ⊦ D19 ≠ E6; (s) ⊦ D19 ≠ E5; (s) ⊦ D19 ≠ E3; (s) ⊦ D19 ≠ E2; (s) ⊦ D19 ≠ D34; (s) ⊦ D19 ≠ D31; (s) ⊦ D19 ≠ D30; (s) ⊦ D19 ≠ D29; (s) ⊦ D19 ≠ D28; (s) ⊦ D19 ≠ D27; (s) ⊦ D19 ≠ D26; (s) ⊦ D19 ≠ D25; (s) ⊦ D19 ≠ D24; (s) ⊦ D19 ≠ D23; (s) ⊦ D19 ≠ D22; (s) ⊦ D19 ≠ D21; (s) ⊦ D19 ≠ D20; (s) ⊦ D18 ≠ D19; (s) ⊦ D17 ≠ D19; (s) ⊦ D16 ≠ D19; (s) ⊦ D15 ≠ D19; (s) ⊦ D14 ≠ D19; (s) ⊦ D13 ≠ D19; (s) ⊦ D12 ≠ D19; (s) ⊦ D11 ≠ D19; (s) ⊦ D10 ≠ D19; (s) ⊦ D9 ≠ D19; (s) ⊦ D8 ≠ D19; (s) ⊦ D6 ≠ D19; (s) ⊦ D5 ≠ D19; (s) ⊦ D4 ≠ D19; (s) ⊦ D3 ≠ D19; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, D19, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, D19, a) = D20; (s) Used terms: gs, ls, pc

Proof step 92 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ DMSQLInv(gs, ls, pc) ↔ (pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → (ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ (pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ (pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ (pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ (pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ;gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → 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)) ∧ (pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ (gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ (pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ (pc = E9 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.nxt = null ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ (pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → 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)) ∧ (pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ (pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ (pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns)) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ (pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns))) ∧ (pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)))

A spec-lemma

Proof step 93 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs.vretRefs(tid0) = gstepf(gs, ls, D19, a).vretRefs(tid0), gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D19, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D19, a).vs, gstepf(gs, ls, D19, a).ps, gstepf(gs, ls, D19, a).owns), equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D19, a).vs, gstepf(gs, ls, D19, a).ps), nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, D19, a).vhead, gstepf(gs, ls, D19, a).vs), noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl, gstepf(gs, ls, D19, a).vs), ownsRely(tid0, gs.owns, gstepf(gs, ls, D19, a).owns), pre(gs, ls, pc, a), prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D19, a).prvHp), rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D19, a).rvowns, gs.vrvHp), rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D19, a).vretRefs, gstepf(gs, ls, D19, a).vrvHp), gstepf(gs, ls, D19, a).vtail ∈ gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl from gs.vtail, gstepf(gs, ls, D19, a).phead ∈ gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl from gs.phead, gstepf(gs, ls, D19, a).vhead ∈ gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl from gs.vhead, dom gs.vrvHp ⊆ dom gstepf(gs, ls, D19, a).vrvHp, ¬ DMSQRely(gs, tid0, gs0), ∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl, ∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D19, a).orl, gs.pretRefs(tid0) = gstepf(gs, ls, D19, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D19, a).pretRefs(tid0) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQRely, seq:⊦ DMSQRely(gs, tid, gs0) ↔ (∃ 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, tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid) = gs0.vretRefs(tid) ∧ ( gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid)) ∧ rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(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(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid, gs.owns, gs0.owns), subst:[gs, tid, gs0] → [gs, tid0, gs0], <all paths>

Additional information

Used simplifier rules: ⊦ pre(gs, ls, D19, a) ↔ a = τ; (s) ⊦ gstepf(gs, ls, D19, a) = ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]) .rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ); (s) ⊦ # x = # z → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: gs, tid0, gs0

Proof step 94 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ DMSQRely(gs, tid, gs0) ↔ (∃ 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, tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid) = gs0.vretRefs(tid) ∧ (gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid)) ∧ rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(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(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid, gs.owns, gs0.owns)

A spec-lemma

Proof step 95 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D21, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a), ¬ DMSQRely(gs, tid0, gs0) ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:rely-D21-D22, seq:⊦ ls.tid ≠ tid0 ∧ ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns (gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.first ≠ 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)) ∧ pre(gs, ls, D21, a) ∧ pcstepf(gs, ls, D21, a) = D22 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D21, a).orl + gstepf(gs, ls, D21, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D21, a).orl) ∧ gstepf(gs, ls, D21, a).vtail ∈ gstepf(gs, ls, D21, a).orl + gstepf(gs, ls, D21, a).qrl from gs.vtail ∧ gstepf(gs, ls, D21, a).phead ∈ gstepf(gs, ls, D21, a).orl + gstepf(gs, ls, D21, a).qrl from gs.phead ∧ gstepf(gs, ls, D21, a).vhead ∈ gstepf(gs, ls, D21, a).orl + gstepf(gs, ls, D21, a).qrl from gs.vhead ∧ equalrl (gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D21, a).vs, gstepf(gs, ls, D21, a).ps) ∧ equalowns (gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D21, a).vs, gstepf(gs, ls, D21, a).ps, gstepf(gs, ls, D21, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, D21, a).vretRefs(tid0) ∧ ( gs.pretRefs(tid0) = gstepf(gs, ls, D21, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D21, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D21, a).rvowns, gs.vrvHp) ∧ rvrely (tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D21, a).vretRefs, gstepf(gs, ls, D21, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, D21, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D21, a).prvHp) ∧ noidRely (tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D21, a).orl + gstepf(gs, ls, D21, a).qrl, gstepf(gs, ls, D21, a).vs) ∧ nextnottidRely (tid0, gs.vhead, gs.vs, gstepf(gs, ls, D21, a).vhead, gstepf(gs, ls, D21, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, D21, a).owns), subst:[ls, tid0, gs, a] → [ls, tid0, gs, a]

Additional information

Used terms: ls, tid0, gs, a

Proof step 96 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ ls.tid ≠ tid0 ∧ ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.first ≠ 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)) ∧ pre(gs, ls, D21, a) ∧ pcstepf(gs, ls, D21, a) = D22 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D21, a).orl + gstepf(gs, ls, D21, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D21, a).orl) ∧ gstepf(gs, ls, D21, a).vtail ∈ gstepf(gs, ls, D21, a).orl + gstepf(gs, ls, D21, a).qrl from gs.vtail ∧ gstepf(gs, ls, D21, a).phead ∈ gstepf(gs, ls, D21, a).orl + gstepf(gs, ls, D21, a).qrl from gs.phead ∧ gstepf(gs, ls, D21, a).vhead ∈ gstepf(gs, ls, D21, a).orl + gstepf(gs, ls, D21, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D21, a).vs, gstepf(gs, ls, D21, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D21, a).vs, gstepf(gs, ls, D21, a).ps, gstepf(gs, ls, D21, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, D21, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, D21, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D21, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D21, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D21, a).vretRefs, gstepf(gs, ls, D21, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, D21, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D21, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D21, a).orl + gstepf(gs, ls, D21, a).qrl, gstepf(gs, ls, D21, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, D21, a).vhead, gstepf(gs, ls, D21, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, D21, a).owns)

Lemma rely-D21-D22

Proof step 97 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D21, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a), ¬ DMSQRely(gs, tid0, gs0), ls.tid ≠ tid0 ∧ ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.first ≠ 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)) ∧ pre(gs, ls, D21, a) ∧ pcstepf(gs, ls, D21, a) = D22 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D21, a).orl + gstepf(gs, ls, D21, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D21, a).orl) ∧ gstepf(gs, ls, D21, a).vtail ∈ gstepf(gs, ls, D21, a).orl + gstepf(gs, ls, D21, a).qrl from gs.vtail ∧ gstepf(gs, ls, D21, a).phead ∈ gstepf(gs, ls, D21, a).orl + gstepf(gs, ls, D21, a).qrl from gs.phead ∧ gstepf(gs, ls, D21, a).vhead ∈ gstepf(gs, ls, D21, a).orl + gstepf(gs, ls, D21, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D21, a).vs, gstepf(gs, ls, D21, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D21, a).vs, gstepf(gs, ls, D21, a).ps, gstepf(gs, ls, D21, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, D21, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, D21, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D21, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D21, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D21, a).vretRefs, gstepf(gs, ls, D21, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, D21, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D21, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D21, a).orl + gstepf(gs, ls, D21, a).qrl, gstepf(gs, ls, D21, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, D21, a).vhead, gstepf(gs, ls, D21, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, D21, a).owns) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 10

Additional information

Proof step 98 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D21, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a), ¬ DMSQRely(gs, tid0, gs0) ⊦ ls.tid ≠ tid0 ∧ ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.first ≠ 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)) ∧ pre(gs, ls, D21, a) ∧ pcstepf(gs, ls, D21, a) = D22

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQGInv, seq:⊦ DMSQGInv(gs) ↔ 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), subst:[gs] → [gs], <all paths>

Additional information

Used terms: gs

Proof step 99 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ DMSQGInv(gs) ↔ 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)

A spec-lemma

Proof step 100 from proof copied-rely-DMSQLInv (previous step) (back to tree)

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D21, pc0 = pcstepf(gs, ls, pc, a), gs.orl ≠ [], ls.tid ≠ tid0, DMSQLInv(gs, ls, pc), 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), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, pc, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ DMSQRely(gs, tid0, gs0), ¬ 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.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.tid ≠ tid0 ∧ ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.first ≠ 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)) ∧ pre(gs, ls, D21, a) ∧ pcstepf(gs, ls, D21, a) = D22

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQLInv, seq:⊦ DMSQLInv(gs, ls, pc) ↔ ( pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → ( ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ ( pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ ( pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ ( pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ; gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → 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)) ∧ ( pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ( gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E9 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.nxt = null ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ ( pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → 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)) ∧ ( pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ ( pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) ) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ ( pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) )) ∧ ( pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )), subst:[gs, ls, pc] → [gs, ls, pc], <all paths>

Additional information

Used simplifier rules: ⊦ gstepf(gs, ls, D21, a) = ( ( gs .ps:= gs.ps [ls.nxt, gs.ps[ls.nxt].deqID:= gs.vs[ls.nxt].deqID ]) .orl:= (gs.ps[ls.nxt].deqID = None ⊃ gs.orl + gs.qrl.head;gs.orl)) .qrl:= (gs.ps[ls.nxt].deqID = None ⊃ gs.qrl.tail;gs.qrl); (s) ⊦ x + a = x + a '; (s) ⊦ D21 ≠ crashed; (s) ⊦ D21 ≠ idle; (s) ⊦ D21 ≠ ready; (s) ⊦ D21 ≠ E1; (s) ⊦ D21 ≠ E17; (s) ⊦ D1 ≠ D21; (s) ⊦ D2 ≠ D21; (s) ⊦ D7 ≠ D21; (s) ⊦ D21 ≠ D32; (s) ⊦ D21 ≠ D33; (s) ⊦ D21 ≠ E4; (s) ⊦ D21 ≠ E16; (s) ⊦ D21 ≠ E15; (s) ⊦ D21 ≠ E14; (s) ⊦ D21 ≠ E13; (s) ⊦ D21 ≠ E12; (s) ⊦ D21 ≠ E11; (s) ⊦ D21 ≠ E10; (s) ⊦ D21 ≠ E9; (s) ⊦ D21 ≠ E8; (s) ⊦ D21 ≠ E7; (s) ⊦ D21 ≠ E6; (s) ⊦ D21 ≠ E5; (s) ⊦ D21 ≠ E3; (s) ⊦ D21 ≠ E2; (s) ⊦ D21 ≠ D34; (s) ⊦ D21 ≠ D31; (s) ⊦ D21 ≠ D30; (s) ⊦ D21 ≠ D29; (s) ⊦ D21 ≠ D28; (s) ⊦ D21 ≠ D27; (s) ⊦ D21 ≠ D26; (s) ⊦ D21 ≠ D25; (s) ⊦ D21 ≠ D24; (s) ⊦ D21 ≠ D23; (s) ⊦ D21 ≠ D22; (s) ⊦ D20 ≠ D21; (s) ⊦ D19 ≠ D21; (s) ⊦ D18 ≠ D21; (s) ⊦ D17 ≠ D21; (s) ⊦ D16 ≠ D21; (s) ⊦ D15 ≠ D21; (s) ⊦ D14 ≠ D21; (s) ⊦ D13 ≠ D21; (s) ⊦ D12 ≠ D21; (s) ⊦ D11 ≠ D21; (s) ⊦ D10 ≠ D21; (s) ⊦ D9 ≠ D21; (s) ⊦ D8 ≠ D21; (s) ⊦ D6 ≠ D21; (s) ⊦ D5 ≠ D21; (s) ⊦ D4 ≠ D21; (s) ⊦ D3 ≠ D21; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, D21, a) ↔ a = (gs.ps[ls.nxt].deqID = None ⊃ doDeq(ls.tid);τ); (s) ⊦ pcstepf(gs, ls, D21, a) = D22; (s) Used terms: gs, ls, pc

Proof step 101 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ DMSQLInv(gs, ls, pc) ↔ (pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → (ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ (pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ (pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ (pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ (pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ;gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → 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)) ∧ (pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ (gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ (pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ (pc = E9 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.nxt = null ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ (pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → 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)) ∧ (pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ (pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ (pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns)) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ (pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns))) ∧ (pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)))

A spec-lemma

Proof step 102 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs.vretRefs(tid0) = gstepf(gs, ls, D21, a).vretRefs(tid0), gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D21, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D21, a).vs, gstepf(gs, ls, D21, a).ps, gstepf(gs, ls, D21, a).owns), equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D21, a).vs, gstepf(gs, ls, D21, a).ps), nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, D21, a).vhead, gstepf(gs, ls, D21, a).vs), noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D21, a).orl + gstepf(gs, ls, D21, a).qrl, gstepf(gs, ls, D21, a).vs), ownsRely(tid0, gs.owns, gstepf(gs, ls, D21, a).owns), pre(gs, ls, pc, a), prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D21, a).prvHp), rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D21, a).rvowns, gs.vrvHp), rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D21, a).vretRefs, gstepf(gs, ls, D21, a).vrvHp), gstepf(gs, ls, D21, a).vtail ∈ gstepf(gs, ls, D21, a).orl + gstepf(gs, ls, D21, a).qrl from gs.vtail, gstepf(gs, ls, D21, a).phead ∈ gstepf(gs, ls, D21, a).orl + gstepf(gs, ls, D21, a).qrl from gs.phead, gstepf(gs, ls, D21, a).vhead ∈ gstepf(gs, ls, D21, a).orl + gstepf(gs, ls, D21, a).qrl from gs.vhead, dom gs.vrvHp ⊆ dom gstepf(gs, ls, D21, a).vrvHp, ¬ DMSQRely(gs, tid0, gs0), ∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D21, a).orl + gstepf(gs, ls, D21, a).qrl, ∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D21, a).orl, gs.pretRefs(tid0) = gstepf(gs, ls, D21, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D21, a).pretRefs(tid0) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQRely, seq:⊦ DMSQRely(gs, tid, gs0) ↔ (∃ 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, tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid) = gs0.vretRefs(tid) ∧ ( gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid)) ∧ rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(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(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid, gs.owns, gs0.owns), subst:[gs, tid, gs0] → [gs, tid0, gs0], <all paths>

Additional information

Used simplifier rules: ⊦ pre(gs, ls, D21, a) ↔ a = (gs.ps[ls.nxt].deqID = None ⊃ doDeq(ls.tid);τ); (s) ⊦ (gs.qrl:= qrl).vtail = gs.vtail; (s) ⊦ (gs.orl:= qrl0).vtail = gs.vtail; (s) ⊦ (gs.ps:= ps).vtail = gs.vtail; (s) ⊦ (gs.qrl:= qrl).phead = gs.phead; (s) ⊦ (gs.orl:= qrl0).phead = gs.phead; (s) ⊦ (gs.ps:= ps).phead = gs.phead; (s) ⊦ (gs.qrl:= qrl).ps = gs.ps; (s) ⊦ (gs.orl:= qrl0).ps = gs.ps; (s) ⊦ (gs.ps:= ps).ps = ps; (s) ⊦ (gs.qrl:= qrl).rvowns = gs.rvowns; (s) ⊦ (gs.orl:= qrl0).rvowns = gs.rvowns; (s) ⊦ (gs.ps:= ps).rvowns = gs.rvowns; (s) ⊦ rvownsrely(tid, rvowns, rvowns, vrvHp); (s) ⊦ (gs.qrl:= qrl).vretRefs = gs.vretRefs; (s) ⊦ (gs.orl:= qrl0).vretRefs = gs.vretRefs; (s) ⊦ (gs.ps:= ps).vretRefs = gs.vretRefs; (s) ⊦ rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs, vrvHp); (s) ⊦ (gs.qrl:= qrl).vrvHp = gs.vrvHp; (s) ⊦ (gs.orl:= qrl0).vrvHp = gs.vrvHp; (s) ⊦ (gs.ps:= ps).vrvHp = gs.vrvHp; (s) ⊦ # s = # s0 → (s ⊆ s0 ↔ s = s0); (s) ⊦ (gs.qrl:= qrl).prvHp = gs.prvHp; (s) ⊦ (gs.orl:= qrl0).prvHp = gs.prvHp; (s) ⊦ (gs.ps:= ps).prvHp = gs.prvHp; (s) ⊦ prvHpRely(vrvHp, prvHp, prvHp); (s) ⊦ (gs.qrl:= qrl).orl = gs.orl; (s) ⊦ (gs.orl:= qrl0).orl = qrl0; (s) ⊦ (gs.qrl:= qrl).qrl = qrl; (s) ⊦ (gs.qrl:= qrl).vhead = gs.vhead; (s) ⊦ (gs.orl:= qrl0).vhead = gs.vhead; (s) ⊦ (gs.ps:= ps).vhead = gs.vhead; (s) ⊦ (gs.qrl:= qrl).vs = gs.vs; (s) ⊦ (gs.orl:= qrl0).vs = gs.vs; (s) ⊦ (gs.ps:= ps).vs = gs.vs; (s) ⊦ nextnottidRely(tid, vhead, vs, vhead, vs); (s) ⊦ (gs.qrl:= qrl).owns = gs.owns; (s) ⊦ (gs.orl:= qrl0).owns = gs.owns; (s) ⊦ (gs.ps:= ps).owns = gs.owns; (s) ⊦ ownsRely(tid, owns, owns); (s) ⊦ gstepf(gs, ls, D21, a) = ( ( gs .ps:= gs.ps [ls.nxt, gs.ps[ls.nxt].deqID:= gs.vs[ls.nxt].deqID ]) .orl:= (gs.ps[ls.nxt].deqID = None ⊃ gs.orl + gs.qrl.head;gs.orl)) .qrl:= (gs.ps[ls.nxt].deqID = None ⊃ gs.qrl.tail;gs.qrl); (s) ⊦ x + a = x + a '; (s) ⊦ (gs.qrl:= qrl).pretRefs = gs.pretRefs; (s) ⊦ (gs.orl:= qrl0).pretRefs = gs.pretRefs; (s) ⊦ (gs.ps:= ps).pretRefs = gs.pretRefs; (s) ⊦ # x = # z → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: gs, tid0, gs0

Proof step 103 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ DMSQRely(gs, tid, gs0) ↔ (∃ 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, tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid) = gs0.vretRefs(tid) ∧ (gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid)) ∧ rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(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(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid, gs.owns, gs0.owns)

A spec-lemma

Proof step 104 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D22, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a), ¬ DMSQRely(gs, tid0, gs0) ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:rely-D22-D23, seq:⊦ ls.tid ≠ tid0 ∧ ( ( gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns (gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.first ≠ 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)) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D22, a) ∧ pcstepf(gs, ls, D22, a) = D23 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D22, a).orl + gstepf(gs, ls, D22, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D22, a).orl) ∧ gstepf(gs, ls, D22, a).vtail ∈ gstepf(gs, ls, D22, a).orl + gstepf(gs, ls, D22, a).qrl from gs.vtail ∧ gstepf(gs, ls, D22, a).phead ∈ gstepf(gs, ls, D22, a).orl + gstepf(gs, ls, D22, a).qrl from gs.phead ∧ gstepf(gs, ls, D22, a).vhead ∈ gstepf(gs, ls, D22, a).orl + gstepf(gs, ls, D22, a).qrl from gs.vhead ∧ equalrl (gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D22, a).vs, gstepf(gs, ls, D22, a).ps) ∧ equalowns (gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D22, a).vs, gstepf(gs, ls, D22, a).ps, gstepf(gs, ls, D22, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, D22, a).vretRefs(tid0) ∧ ( gs.pretRefs(tid0) = gstepf(gs, ls, D22, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D22, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D22, a).rvowns, gs.vrvHp) ∧ rvrely (tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D22, a).vretRefs, gstepf(gs, ls, D22, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, D22, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D22, a).prvHp) ∧ noidRely (tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D22, a).orl + gstepf(gs, ls, D22, a).qrl, gstepf(gs, ls, D22, a).vs) ∧ nextnottidRely (tid0, gs.vhead, gs.vs, gstepf(gs, ls, D22, a).vhead, gstepf(gs, ls, D22, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, D22, a).owns), subst:[ls, tid0, gs, a] → [ls, tid0, gs, a]

Additional information

Used terms: ls, tid0, gs, a

Proof step 105 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ ls.tid ≠ tid0 ∧ ( (gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.first ≠ 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)) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D22, a) ∧ pcstepf(gs, ls, D22, a) = D23 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D22, a).orl + gstepf(gs, ls, D22, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D22, a).orl) ∧ gstepf(gs, ls, D22, a).vtail ∈ gstepf(gs, ls, D22, a).orl + gstepf(gs, ls, D22, a).qrl from gs.vtail ∧ gstepf(gs, ls, D22, a).phead ∈ gstepf(gs, ls, D22, a).orl + gstepf(gs, ls, D22, a).qrl from gs.phead ∧ gstepf(gs, ls, D22, a).vhead ∈ gstepf(gs, ls, D22, a).orl + gstepf(gs, ls, D22, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D22, a).vs, gstepf(gs, ls, D22, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D22, a).vs, gstepf(gs, ls, D22, a).ps, gstepf(gs, ls, D22, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, D22, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, D22, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D22, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D22, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D22, a).vretRefs, gstepf(gs, ls, D22, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, D22, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D22, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D22, a).orl + gstepf(gs, ls, D22, a).qrl, gstepf(gs, ls, D22, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, D22, a).vhead, gstepf(gs, ls, D22, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, D22, a).owns)

Lemma rely-D22-D23

Proof step 106 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D22, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a), ¬ DMSQRely(gs, tid0, gs0), ls.tid ≠ tid0 ∧ ( (gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.first ≠ 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)) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D22, a) ∧ pcstepf(gs, ls, D22, a) = D23 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D22, a).orl + gstepf(gs, ls, D22, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D22, a).orl) ∧ gstepf(gs, ls, D22, a).vtail ∈ gstepf(gs, ls, D22, a).orl + gstepf(gs, ls, D22, a).qrl from gs.vtail ∧ gstepf(gs, ls, D22, a).phead ∈ gstepf(gs, ls, D22, a).orl + gstepf(gs, ls, D22, a).qrl from gs.phead ∧ gstepf(gs, ls, D22, a).vhead ∈ gstepf(gs, ls, D22, a).orl + gstepf(gs, ls, D22, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D22, a).vs, gstepf(gs, ls, D22, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D22, a).vs, gstepf(gs, ls, D22, a).ps, gstepf(gs, ls, D22, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, D22, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, D22, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D22, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D22, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D22, a).vretRefs, gstepf(gs, ls, D22, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, D22, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D22, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D22, a).orl + gstepf(gs, ls, D22, a).qrl, gstepf(gs, ls, D22, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, D22, a).vhead, gstepf(gs, ls, D22, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, D22, a).owns) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 10

Additional information

Proof step 107 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D22, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a), ¬ DMSQRely(gs, tid0, gs0) ⊦ ls.tid ≠ tid0 ∧ ( (gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.first ≠ 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)) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D22, a) ∧ pcstepf(gs, ls, D22, a) = D23

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQGInv, seq:⊦ DMSQGInv(gs) ↔ 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), subst:[gs] → [gs], <all paths>

Additional information

Used terms: gs

Proof step 108 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ DMSQGInv(gs) ↔ 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)

A spec-lemma

Proof step 109 from proof copied-rely-DMSQLInv (previous step) (back to tree)

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D22, pc0 = pcstepf(gs, ls, pc, a), gs.orl ≠ [], ls.tid ≠ tid0, DMSQLInv(gs, ls, pc), 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), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, pc, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ DMSQRely(gs, tid0, gs0), ¬ 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.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.tid ≠ tid0 ∧ ( (gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.first ≠ 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)) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D22, a) ∧ pcstepf(gs, ls, D22, a) = D23

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQLInv, seq:⊦ DMSQLInv(gs, ls, pc) ↔ ( pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → ( ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ ( pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ ( pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ ( pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ; gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → 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)) ∧ ( pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ( gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E9 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.nxt = null ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ ( pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → 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)) ∧ ( pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ ( pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) ) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ ( pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) )) ∧ ( pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )), subst:[gs, ls, pc] → [gs, ls, pc], <all paths>

Additional information

Used simplifier rules: ⊦ D22 ≠ crashed; (s) ⊦ D22 ≠ idle; (s) ⊦ D22 ≠ ready; (s) ⊦ D22 ≠ E1; (s) ⊦ D22 ≠ E17; (s) ⊦ D1 ≠ D22; (s) ⊦ D2 ≠ D22; (s) ⊦ D7 ≠ D22; (s) ⊦ D22 ≠ D32; (s) ⊦ D22 ≠ D33; (s) ⊦ D22 ≠ E4; (s) ⊦ D22 ≠ E16; (s) ⊦ D22 ≠ E15; (s) ⊦ D22 ≠ E14; (s) ⊦ D22 ≠ E13; (s) ⊦ D22 ≠ E12; (s) ⊦ D22 ≠ E11; (s) ⊦ D22 ≠ E10; (s) ⊦ D22 ≠ E9; (s) ⊦ D22 ≠ E8; (s) ⊦ D22 ≠ E7; (s) ⊦ D22 ≠ E6; (s) ⊦ D22 ≠ E5; (s) ⊦ D22 ≠ E3; (s) ⊦ D22 ≠ E2; (s) ⊦ D22 ≠ D34; (s) ⊦ D22 ≠ D31; (s) ⊦ D22 ≠ D30; (s) ⊦ D22 ≠ D29; (s) ⊦ D22 ≠ D28; (s) ⊦ D22 ≠ D27; (s) ⊦ D22 ≠ D26; (s) ⊦ D22 ≠ D25; (s) ⊦ D22 ≠ D24; (s) ⊦ D22 ≠ D23; (s) ⊦ D21 ≠ D22; (s) ⊦ D20 ≠ D22; (s) ⊦ D19 ≠ D22; (s) ⊦ D18 ≠ D22; (s) ⊦ D17 ≠ D22; (s) ⊦ D16 ≠ D22; (s) ⊦ D15 ≠ D22; (s) ⊦ D14 ≠ D22; (s) ⊦ D13 ≠ D22; (s) ⊦ D12 ≠ D22; (s) ⊦ D11 ≠ D22; (s) ⊦ D10 ≠ D22; (s) ⊦ D9 ≠ D22; (s) ⊦ D8 ≠ D22; (s) ⊦ D6 ≠ D22; (s) ⊦ D5 ≠ D22; (s) ⊦ D4 ≠ D22; (s) ⊦ D3 ≠ D22; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, D22, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, D22, a) = D23; (s) Used terms: gs, ls, pc

Proof step 110 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ DMSQLInv(gs, ls, pc) ↔ (pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → (ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ (pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ (pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ (pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ (pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ;gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → 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)) ∧ (pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ (gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ (pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ (pc = E9 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.nxt = null ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ (pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → 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)) ∧ (pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ (pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ (pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns)) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ (pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns))) ∧ (pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)))

A spec-lemma

Proof step 111 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs.vretRefs(tid0) = gstepf(gs, ls, D22, a).vretRefs(tid0), gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D22, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D22, a).vs, gstepf(gs, ls, D22, a).ps, gstepf(gs, ls, D22, a).owns), equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D22, a).vs, gstepf(gs, ls, D22, a).ps), nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, D22, a).vhead, gstepf(gs, ls, D22, a).vs), noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D22, a).orl + gstepf(gs, ls, D22, a).qrl, gstepf(gs, ls, D22, a).vs), ownsRely(tid0, gs.owns, gstepf(gs, ls, D22, a).owns), pre(gs, ls, pc, a), prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D22, a).prvHp), rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D22, a).rvowns, gs.vrvHp), rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D22, a).vretRefs, gstepf(gs, ls, D22, a).vrvHp), gstepf(gs, ls, D22, a).vtail ∈ gstepf(gs, ls, D22, a).orl + gstepf(gs, ls, D22, a).qrl from gs.vtail, gstepf(gs, ls, D22, a).phead ∈ gstepf(gs, ls, D22, a).orl + gstepf(gs, ls, D22, a).qrl from gs.phead, gstepf(gs, ls, D22, a).vhead ∈ gstepf(gs, ls, D22, a).orl + gstepf(gs, ls, D22, a).qrl from gs.vhead, dom gs.vrvHp ⊆ dom gstepf(gs, ls, D22, a).vrvHp, ¬ DMSQRely(gs, tid0, gs0), ∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D22, a).orl + gstepf(gs, ls, D22, a).qrl, ∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D22, a).orl, gs.pretRefs(tid0) = gstepf(gs, ls, D22, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D22, a).pretRefs(tid0) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQRely, seq:⊦ DMSQRely(gs, tid, gs0) ↔ (∃ 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, tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid) = gs0.vretRefs(tid) ∧ ( gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid)) ∧ rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(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(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid, gs.owns, gs0.owns), subst:[gs, tid, gs0] → [gs, tid0, gs0], <all paths>

Additional information

Used simplifier rules: ⊦ pre(gs, ls, D22, a) ↔ a = τ; (s) ⊦ (gs.vrvHp:= vrvHp).prvHp = gs.prvHp; (s) ⊦ prvHpRely(vrvHp, prvHp, prvHp); (s) ⊦ (gs.vrvHp:= vrvHp).rvowns = gs.rvowns; (s) ⊦ rvownsrely(tid, rvowns, rvowns, vrvHp); (s) ⊦ (gs.vrvHp:= vrvHp).vretRefs = gs.vretRefs; (s) ⊦ (gs.vrvHp:= vrvHp).phead = gs.phead; (s) ⊦ (gs.vrvHp:= vrvHp).vtail = gs.vtail; (s) ⊦ (gs.vrvHp:= vrvHp).vrvHp = vrvHp; (s) ⊦ dom st[a, d] = dom st ++ a; (s) ⊦ s ⊆ s ++ a; (s) ⊦ equalowns(vs, ps, owns, tid, vs, ps, owns); (s) ⊦ (gs.vrvHp:= vrvHp).ps = gs.ps; (s) ⊦ equalrl(rl, vs, ps, vs, ps); (s) ⊦ (gs.vrvHp:= vrvHp).vhead = gs.vhead; (s) ⊦ nextnottidRely(tid, vhead, vs, vhead, vs); (s) ⊦ (gs.vrvHp:= vrvHp).vs = gs.vs; (s) ⊦ (gs.vrvHp:= vrvHp).owns = gs.owns; (s) ⊦ ownsRely(tid, owns, owns); (s) ⊦ (gs.vrvHp:= vrvHp).qrl = gs.qrl; (s) ⊦ # x = # z → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) ⊦ (gs.vrvHp:= vrvHp).orl = gs.orl; (s) ⊦ gstepf(gs, ls, D22, τ) = gs.vrvHp:= gs.vrvHp[ls.rvref, ls.optval]; (s) ⊦ (gs.vrvHp:= vrvHp).pretRefs = gs.pretRefs; (s) ⊦ noidRely(tid, rl, vs, rl, vs); (s) ⊦ [] + x = x; (s) ⊦ x = x + y ↔ y = []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: gs, tid0, gs0

Proof step 112 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ DMSQRely(gs, tid, gs0) ↔ (∃ 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, tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid) = gs0.vretRefs(tid) ∧ (gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid)) ∧ rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(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(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid, gs.owns, gs0.owns)

A spec-lemma

Proof step 113 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D23, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a), ¬ DMSQRely(gs, tid0, gs0) ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:rely-D23-D24, seq:⊦ ls.tid ≠ tid0 ∧ ( ( gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns (gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.first ≠ 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)) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D23, a) ∧ pcstepf(gs, ls, D23, a) = D24 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D23, a).orl + gstepf(gs, ls, D23, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D23, a).orl) ∧ gstepf(gs, ls, D23, a).vtail ∈ gstepf(gs, ls, D23, a).orl + gstepf(gs, ls, D23, a).qrl from gs.vtail ∧ gstepf(gs, ls, D23, a).phead ∈ gstepf(gs, ls, D23, a).orl + gstepf(gs, ls, D23, a).qrl from gs.phead ∧ gstepf(gs, ls, D23, a).vhead ∈ gstepf(gs, ls, D23, a).orl + gstepf(gs, ls, D23, a).qrl from gs.vhead ∧ equalrl (gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D23, a).vs, gstepf(gs, ls, D23, a).ps) ∧ equalowns (gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D23, a).vs, gstepf(gs, ls, D23, a).ps, gstepf(gs, ls, D23, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, D23, a).vretRefs(tid0) ∧ ( gs.pretRefs(tid0) = gstepf(gs, ls, D23, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D23, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D23, a).rvowns, gs.vrvHp) ∧ rvrely (tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D23, a).vretRefs, gstepf(gs, ls, D23, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, D23, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D23, a).prvHp) ∧ noidRely (tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D23, a).orl + gstepf(gs, ls, D23, a).qrl, gstepf(gs, ls, D23, a).vs) ∧ nextnottidRely (tid0, gs.vhead, gs.vs, gstepf(gs, ls, D23, a).vhead, gstepf(gs, ls, D23, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, D23, a).owns), subst:[ls, tid0, gs, a] → [ls, tid0, gs, a]

Additional information

Used terms: ls, tid0, gs, a

Proof step 114 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ ls.tid ≠ tid0 ∧ ( (gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.first ≠ 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)) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D23, a) ∧ pcstepf(gs, ls, D23, a) = D24 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D23, a).orl + gstepf(gs, ls, D23, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D23, a).orl) ∧ gstepf(gs, ls, D23, a).vtail ∈ gstepf(gs, ls, D23, a).orl + gstepf(gs, ls, D23, a).qrl from gs.vtail ∧ gstepf(gs, ls, D23, a).phead ∈ gstepf(gs, ls, D23, a).orl + gstepf(gs, ls, D23, a).qrl from gs.phead ∧ gstepf(gs, ls, D23, a).vhead ∈ gstepf(gs, ls, D23, a).orl + gstepf(gs, ls, D23, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D23, a).vs, gstepf(gs, ls, D23, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D23, a).vs, gstepf(gs, ls, D23, a).ps, gstepf(gs, ls, D23, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, D23, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, D23, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D23, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D23, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D23, a).vretRefs, gstepf(gs, ls, D23, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, D23, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D23, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D23, a).orl + gstepf(gs, ls, D23, a).qrl, gstepf(gs, ls, D23, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, D23, a).vhead, gstepf(gs, ls, D23, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, D23, a).owns)

Lemma rely-D23-D24

Proof step 115 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D23, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a), ¬ DMSQRely(gs, tid0, gs0), ls.tid ≠ tid0 ∧ ( (gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.first ≠ 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)) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D23, a) ∧ pcstepf(gs, ls, D23, a) = D24 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D23, a).orl + gstepf(gs, ls, D23, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D23, a).orl) ∧ gstepf(gs, ls, D23, a).vtail ∈ gstepf(gs, ls, D23, a).orl + gstepf(gs, ls, D23, a).qrl from gs.vtail ∧ gstepf(gs, ls, D23, a).phead ∈ gstepf(gs, ls, D23, a).orl + gstepf(gs, ls, D23, a).qrl from gs.phead ∧ gstepf(gs, ls, D23, a).vhead ∈ gstepf(gs, ls, D23, a).orl + gstepf(gs, ls, D23, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D23, a).vs, gstepf(gs, ls, D23, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D23, a).vs, gstepf(gs, ls, D23, a).ps, gstepf(gs, ls, D23, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, D23, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, D23, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D23, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D23, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D23, a).vretRefs, gstepf(gs, ls, D23, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, D23, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D23, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D23, a).orl + gstepf(gs, ls, D23, a).qrl, gstepf(gs, ls, D23, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, D23, a).vhead, gstepf(gs, ls, D23, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, D23, a).owns) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 10

Additional information

Proof step 116 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D23, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a), ¬ DMSQRely(gs, tid0, gs0) ⊦ ls.tid ≠ tid0 ∧ ( (gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.first ≠ 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)) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D23, a) ∧ pcstepf(gs, ls, D23, a) = D24

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQGInv, seq:⊦ DMSQGInv(gs) ↔ 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), subst:[gs] → [gs], <all paths>

Additional information

Used terms: gs

Proof step 117 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ DMSQGInv(gs) ↔ 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)

A spec-lemma

Proof step 118 from proof copied-rely-DMSQLInv (previous step) (back to tree)

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D23, pc0 = pcstepf(gs, ls, pc, a), gs.orl ≠ [], ls.tid ≠ tid0, DMSQLInv(gs, ls, pc), 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), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, pc, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ DMSQRely(gs, tid0, gs0), ¬ 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.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.tid ≠ tid0 ∧ ( (gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.first ≠ 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)) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D23, a) ∧ pcstepf(gs, ls, D23, a) = D24

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQLInv, seq:⊦ DMSQLInv(gs, ls, pc) ↔ ( pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → ( ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ ( pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ ( pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ ( pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ; gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → 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)) ∧ ( pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ( gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E9 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.nxt = null ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ ( pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → 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)) ∧ ( pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ ( pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) ) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ ( pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) )) ∧ ( pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )), subst:[gs, ls, pc] → [gs, ls, pc], <all paths>

Additional information

Used simplifier rules: ⊦ D23 ≠ crashed; (s) ⊦ D23 ≠ idle; (s) ⊦ D23 ≠ ready; (s) ⊦ D23 ≠ E1; (s) ⊦ D23 ≠ E17; (s) ⊦ D1 ≠ D23; (s) ⊦ D2 ≠ D23; (s) ⊦ D7 ≠ D23; (s) ⊦ D23 ≠ D32; (s) ⊦ D23 ≠ D33; (s) ⊦ D23 ≠ E4; (s) ⊦ D23 ≠ E16; (s) ⊦ D23 ≠ E15; (s) ⊦ D23 ≠ E14; (s) ⊦ D23 ≠ E13; (s) ⊦ D23 ≠ E12; (s) ⊦ D23 ≠ E11; (s) ⊦ D23 ≠ E10; (s) ⊦ D23 ≠ E9; (s) ⊦ D23 ≠ E8; (s) ⊦ D23 ≠ E7; (s) ⊦ D23 ≠ E6; (s) ⊦ D23 ≠ E5; (s) ⊦ D23 ≠ E3; (s) ⊦ D23 ≠ E2; (s) ⊦ D23 ≠ D34; (s) ⊦ D23 ≠ D31; (s) ⊦ D23 ≠ D30; (s) ⊦ D23 ≠ D29; (s) ⊦ D23 ≠ D28; (s) ⊦ D23 ≠ D27; (s) ⊦ D23 ≠ D26; (s) ⊦ D23 ≠ D25; (s) ⊦ D23 ≠ D24; (s) ⊦ D22 ≠ D23; (s) ⊦ D21 ≠ D23; (s) ⊦ D20 ≠ D23; (s) ⊦ D19 ≠ D23; (s) ⊦ D18 ≠ D23; (s) ⊦ D17 ≠ D23; (s) ⊦ D16 ≠ D23; (s) ⊦ D15 ≠ D23; (s) ⊦ D14 ≠ D23; (s) ⊦ D13 ≠ D23; (s) ⊦ D12 ≠ D23; (s) ⊦ D11 ≠ D23; (s) ⊦ D10 ≠ D23; (s) ⊦ D9 ≠ D23; (s) ⊦ D8 ≠ D23; (s) ⊦ D6 ≠ D23; (s) ⊦ D5 ≠ D23; (s) ⊦ D4 ≠ D23; (s) ⊦ D3 ≠ D23; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, D23, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, D23, a) = D24; (s) Used terms: gs, ls, pc

Proof step 119 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ DMSQLInv(gs, ls, pc) ↔ (pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → (ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ (pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ (pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ (pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ (pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ;gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → 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)) ∧ (pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ (gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ (pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ (pc = E9 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.nxt = null ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ (pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → 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)) ∧ (pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ (pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ (pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns)) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ (pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns))) ∧ (pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)))

A spec-lemma

Proof step 120 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs.vretRefs(tid0) = gstepf(gs, ls, D23, a).vretRefs(tid0), gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D23, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D23, a).vs, gstepf(gs, ls, D23, a).ps, gstepf(gs, ls, D23, a).owns), equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D23, a).vs, gstepf(gs, ls, D23, a).ps), nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, D23, a).vhead, gstepf(gs, ls, D23, a).vs), noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D23, a).orl + gstepf(gs, ls, D23, a).qrl, gstepf(gs, ls, D23, a).vs), ownsRely(tid0, gs.owns, gstepf(gs, ls, D23, a).owns), pre(gs, ls, pc, a), prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D23, a).prvHp), rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D23, a).rvowns, gs.vrvHp), rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D23, a).vretRefs, gstepf(gs, ls, D23, a).vrvHp), gstepf(gs, ls, D23, a).vtail ∈ gstepf(gs, ls, D23, a).orl + gstepf(gs, ls, D23, a).qrl from gs.vtail, gstepf(gs, ls, D23, a).phead ∈ gstepf(gs, ls, D23, a).orl + gstepf(gs, ls, D23, a).qrl from gs.phead, gstepf(gs, ls, D23, a).vhead ∈ gstepf(gs, ls, D23, a).orl + gstepf(gs, ls, D23, a).qrl from gs.vhead, dom gs.vrvHp ⊆ dom gstepf(gs, ls, D23, a).vrvHp, ¬ DMSQRely(gs, tid0, gs0), ∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D23, a).orl + gstepf(gs, ls, D23, a).qrl, ∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D23, a).orl, gs.pretRefs(tid0) = gstepf(gs, ls, D23, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D23, a).pretRefs(tid0) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQRely, seq:⊦ DMSQRely(gs, tid, gs0) ↔ (∃ 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, tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid) = gs0.vretRefs(tid) ∧ ( gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid)) ∧ rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(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(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid, gs.owns, gs0.owns), subst:[gs, tid, gs0] → [gs, tid0, gs0], <all paths>

Additional information

Used simplifier rules: ⊦ pre(gs, ls, D23, a) ↔ a = τ; (s) ⊦ (gs.prvHp:= vrvHp0).prvHp = vrvHp0; (s) ⊦ (gs.prvHp:= vrvHp0).rvowns = gs.rvowns; (s) ⊦ rvownsrely(tid, rvowns, rvowns, vrvHp); (s) ⊦ (gs.prvHp:= vrvHp0).vretRefs = gs.vretRefs; (s) ⊦ rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs, vrvHp); (s) ⊦ (gs.prvHp:= vrvHp0).phead = gs.phead; (s) ⊦ (gs.prvHp:= vrvHp0).vtail = gs.vtail; (s) ⊦ (gs.prvHp:= vrvHp0).vrvHp = gs.vrvHp; (s) ⊦ # s = # s0 → (s ⊆ s0 ↔ s = s0); (s) ⊦ equalowns(vs, ps, owns, tid, vs, ps, owns); (s) ⊦ (gs.prvHp:= vrvHp0).ps = gs.ps; (s) ⊦ equalrl(rl, vs, ps, vs, ps); (s) ⊦ (gs.prvHp:= vrvHp0).vhead = gs.vhead; (s) ⊦ nextnottidRely(tid, vhead, vs, vhead, vs); (s) ⊦ (gs.prvHp:= vrvHp0).vs = gs.vs; (s) ⊦ (gs.prvHp:= vrvHp0).owns = gs.owns; (s) ⊦ ownsRely(tid, owns, owns); (s) ⊦ (gs.prvHp:= vrvHp0).qrl = gs.qrl; (s) ⊦ # x = # z → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) ⊦ (gs.prvHp:= vrvHp0).orl = gs.orl; (s) ⊦ gstepf(gs, ls, D23, τ) = gs.prvHp:= gs.prvHp[ls.rvref, gs.vrvHp[ls.rvref]]; (s) ⊦ (gs.prvHp:= vrvHp0).pretRefs = gs.pretRefs; (s) ⊦ noidRely(tid, rl, vs, rl, vs); (s) ⊦ [] + x = x; (s) ⊦ x = x + y ↔ y = []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: gs, tid0, gs0

Proof step 121 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ DMSQRely(gs, tid, gs0) ↔ (∃ 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, tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid) = gs0.vretRefs(tid) ∧ (gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid)) ∧ rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(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(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid, gs.owns, gs0.owns)

A spec-lemma

Proof step 122 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D24, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a), ¬ DMSQRely(gs, tid0, gs0) ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:rely-D24-D6, seq:⊦ ls.tid ≠ tid0 ∧ ( ( gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns (gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.first ≠ 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)) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D24, a) ∧ pcstepf(gs, ls, D24, a) = D6 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D24, a).orl) ∧ gstepf(gs, ls, D24, a).vtail ∈ gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl from gs.vtail ∧ gstepf(gs, ls, D24, a).phead ∈ gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl from gs.phead ∧ gstepf(gs, ls, D24, a).vhead ∈ gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl from gs.vhead ∧ equalrl (gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D24, a).vs, gstepf(gs, ls, D24, a).ps) ∧ equalowns (gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D24, a).vs, gstepf(gs, ls, D24, a).ps, gstepf(gs, ls, D24, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, D24, a).vretRefs(tid0) ∧ ( gs.pretRefs(tid0) = gstepf(gs, ls, D24, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D24, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D24, a).rvowns, gs.vrvHp) ∧ rvrely (tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D24, a).vretRefs, gstepf(gs, ls, D24, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, D24, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D24, a).prvHp) ∧ noidRely (tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl, gstepf(gs, ls, D24, a).vs) ∧ nextnottidRely (tid0, gs.vhead, gs.vs, gstepf(gs, ls, D24, a).vhead, gstepf(gs, ls, D24, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, D24, a).owns), subst:[ls, tid0, gs, a] → [ls, tid0, gs, a]

Additional information

Used terms: ls, tid0, gs, a

Proof step 123 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ ls.tid ≠ tid0 ∧ ( ( gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.first ≠ 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)) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D24, a) ∧ pcstepf(gs, ls, D24, a) = D6 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D24, a).orl) ∧ gstepf(gs, ls, D24, a).vtail ∈ gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl from gs.vtail ∧ gstepf(gs, ls, D24, a).phead ∈ gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl from gs.phead ∧ gstepf(gs, ls, D24, a).vhead ∈ gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D24, a).vs, gstepf(gs, ls, D24, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D24, a).vs, gstepf(gs, ls, D24, a).ps, gstepf(gs, ls, D24, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, D24, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, D24, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D24, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D24, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D24, a).vretRefs, gstepf(gs, ls, D24, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, D24, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D24, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl, gstepf(gs, ls, D24, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, D24, a).vhead, gstepf(gs, ls, D24, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, D24, a).owns)

Lemma rely-D24-D6

Proof step 124 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D24, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a), ¬ DMSQRely(gs, tid0, gs0), ls.tid ≠ tid0 ∧ ( ( gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.first ≠ 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)) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D24, a) ∧ pcstepf(gs, ls, D24, a) = D6 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D24, a).orl) ∧ gstepf(gs, ls, D24, a).vtail ∈ gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl from gs.vtail ∧ gstepf(gs, ls, D24, a).phead ∈ gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl from gs.phead ∧ gstepf(gs, ls, D24, a).vhead ∈ gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D24, a).vs, gstepf(gs, ls, D24, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D24, a).vs, gstepf(gs, ls, D24, a).ps, gstepf(gs, ls, D24, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, D24, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, D24, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D24, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D24, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D24, a).vretRefs, gstepf(gs, ls, D24, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, D24, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D24, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl, gstepf(gs, ls, D24, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, D24, a).vhead, gstepf(gs, ls, D24, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, D24, a).owns) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 10

Additional information

Proof step 125 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D24, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a), ¬ DMSQRely(gs, tid0, gs0) ⊦ ls.tid ≠ tid0 ∧ ( ( gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.first ≠ 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)) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D24, a) ∧ pcstepf(gs, ls, D24, a) = D6

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQGInv, seq:⊦ DMSQGInv(gs) ↔ 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), subst:[gs] → [gs], <all paths>

Additional information

Used terms: gs

Proof step 126 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ DMSQGInv(gs) ↔ 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)

A spec-lemma

Proof step 127 from proof copied-rely-DMSQLInv (previous step) (back to tree)

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D24, pc0 = pcstepf(gs, ls, pc, a), gs.orl ≠ [], ls.tid ≠ tid0, DMSQLInv(gs, ls, pc), 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), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, pc, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ DMSQRely(gs, tid0, gs0), ¬ 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.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.tid ≠ tid0 ∧ ( ( gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.first ≠ 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)) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D24, a) ∧ pcstepf(gs, ls, D24, a) = D6

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQLInv, seq:⊦ DMSQLInv(gs, ls, pc) ↔ ( pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → ( ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ ( pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ ( pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ ( pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ; gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → 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)) ∧ ( pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ( gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E9 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.nxt = null ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ ( pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → 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)) ∧ ( pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ ( pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) ) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ ( pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) )) ∧ ( pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )), subst:[gs, ls, pc] → [gs, ls, pc], <all paths>

Additional information

Used simplifier rules: ⊦ gstepf(gs, ls, D24, a) = (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs); (s) ⊦ D24 ≠ crashed; (s) ⊦ D24 ≠ idle; (s) ⊦ D24 ≠ ready; (s) ⊦ D24 ≠ E1; (s) ⊦ D24 ≠ E17; (s) ⊦ D1 ≠ D24; (s) ⊦ D2 ≠ D24; (s) ⊦ D7 ≠ D24; (s) ⊦ D24 ≠ D32; (s) ⊦ D24 ≠ D33; (s) ⊦ D24 ≠ E4; (s) ⊦ D24 ≠ E16; (s) ⊦ D24 ≠ E15; (s) ⊦ D24 ≠ E14; (s) ⊦ D24 ≠ E13; (s) ⊦ D24 ≠ E12; (s) ⊦ D24 ≠ E11; (s) ⊦ D24 ≠ E10; (s) ⊦ D24 ≠ E9; (s) ⊦ D24 ≠ E8; (s) ⊦ D24 ≠ E7; (s) ⊦ D24 ≠ E6; (s) ⊦ D24 ≠ E5; (s) ⊦ D24 ≠ E3; (s) ⊦ D24 ≠ E2; (s) ⊦ D24 ≠ D34; (s) ⊦ D24 ≠ D31; (s) ⊦ D24 ≠ D30; (s) ⊦ D24 ≠ D29; (s) ⊦ D24 ≠ D28; (s) ⊦ D24 ≠ D27; (s) ⊦ D24 ≠ D26; (s) ⊦ D24 ≠ D25; (s) ⊦ D23 ≠ D24; (s) ⊦ D22 ≠ D24; (s) ⊦ D21 ≠ D24; (s) ⊦ D20 ≠ D24; (s) ⊦ D19 ≠ D24; (s) ⊦ D18 ≠ D24; (s) ⊦ D17 ≠ D24; (s) ⊦ D16 ≠ D24; (s) ⊦ D15 ≠ D24; (s) ⊦ D14 ≠ D24; (s) ⊦ D13 ≠ D24; (s) ⊦ D12 ≠ D24; (s) ⊦ D11 ≠ D24; (s) ⊦ D10 ≠ D24; (s) ⊦ D9 ≠ D24; (s) ⊦ D8 ≠ D24; (s) ⊦ D6 ≠ D24; (s) ⊦ D5 ≠ D24; (s) ⊦ D4 ≠ D24; (s) ⊦ D3 ≠ D24; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, D24, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, D24, a) = D6; (s) Used terms: gs, ls, pc

Proof step 128 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ DMSQLInv(gs, ls, pc) ↔ (pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → (ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ (pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ (pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ (pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ (pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ;gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → 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)) ∧ (pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ (gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ (pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ (pc = E9 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.nxt = null ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ (pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → 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)) ∧ (pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ (pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ (pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns)) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ (pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns))) ∧ (pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)))

A spec-lemma

Proof step 129 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs.vretRefs(tid0) = gstepf(gs, ls, D24, a).vretRefs(tid0), gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D24, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D24, a).vs, gstepf(gs, ls, D24, a).ps, gstepf(gs, ls, D24, a).owns), equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D24, a).vs, gstepf(gs, ls, D24, a).ps), nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, D24, a).vhead, gstepf(gs, ls, D24, a).vs), noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl, gstepf(gs, ls, D24, a).vs), ownsRely(tid0, gs.owns, gstepf(gs, ls, D24, a).owns), pre(gs, ls, pc, a), prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D24, a).prvHp), rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D24, a).rvowns, gs.vrvHp), rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D24, a).vretRefs, gstepf(gs, ls, D24, a).vrvHp), gstepf(gs, ls, D24, a).vtail ∈ gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl from gs.vtail, gstepf(gs, ls, D24, a).phead ∈ gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl from gs.phead, gstepf(gs, ls, D24, a).vhead ∈ gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl from gs.vhead, dom gs.vrvHp ⊆ dom gstepf(gs, ls, D24, a).vrvHp, ¬ DMSQRely(gs, tid0, gs0), ∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl, ∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D24, a).orl, gs.pretRefs(tid0) = gstepf(gs, ls, D24, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D24, a).pretRefs(tid0) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQRely, seq:⊦ DMSQRely(gs, tid, gs0) ↔ (∃ 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, tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid) = gs0.vretRefs(tid) ∧ ( gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid)) ∧ rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(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(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid, gs.owns, gs0.owns), subst:[gs, tid, gs0] → [gs, tid0, gs0], <all paths>

Additional information

Used simplifier rules: ⊦ pre(gs, ls, D24, a) ↔ a = τ; (s) ⊦ gstepf(gs, ls, D24, a) = (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs); (s) ⊦ # x = # z → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: gs, tid0, gs0

Proof step 130 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ DMSQRely(gs, tid, gs0) ↔ (∃ 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, tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid) = gs0.vretRefs(tid) ∧ (gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid)) ∧ rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(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(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid, gs.owns, gs0.owns)

A spec-lemma

Proof step 131 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D28, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a), ¬ DMSQRely(gs, tid0, gs0) ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:rely-D28-D29, seq:⊦ ls.tid ≠ tid0 ∧ ( ( ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( 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.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ ( gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D28, a) ∧ pcstepf(gs, ls, D28, a) = D29 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D28, a).orl) ∧ gstepf(gs, ls, D28, a).vtail ∈ gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl from gs.vtail ∧ gstepf(gs, ls, D28, a).phead ∈ gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl from gs.phead ∧ gstepf(gs, ls, D28, a).vhead ∈ gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl from gs.vhead ∧ equalrl (gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D28, a).vs, gstepf(gs, ls, D28, a).ps) ∧ equalowns (gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D28, a).vs, gstepf(gs, ls, D28, a).ps, gstepf(gs, ls, D28, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, D28, a).vretRefs(tid0) ∧ ( gs.pretRefs(tid0) = gstepf(gs, ls, D28, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D28, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D28, a).rvowns, gs.vrvHp) ∧ rvrely (tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D28, a).vretRefs, gstepf(gs, ls, D28, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, D28, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D28, a).prvHp) ∧ noidRely (tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl, gstepf(gs, ls, D28, a).vs) ∧ nextnottidRely (tid0, gs.vhead, gs.vs, gstepf(gs, ls, D28, a).vhead, gstepf(gs, ls, D28, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, D28, a).owns), subst:[ls, tid0, gs, a] → [ls, tid0, gs, a]

Additional information

Used terms: ls, tid0, gs, a

Proof step 132 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ ls.tid ≠ tid0 ∧ ( ( ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( 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.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ (ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D28, a) ∧ pcstepf(gs, ls, D28, a) = D29 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D28, a).orl) ∧ gstepf(gs, ls, D28, a).vtail ∈ gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl from gs.vtail ∧ gstepf(gs, ls, D28, a).phead ∈ gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl from gs.phead ∧ gstepf(gs, ls, D28, a).vhead ∈ gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D28, a).vs, gstepf(gs, ls, D28, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D28, a).vs, gstepf(gs, ls, D28, a).ps, gstepf(gs, ls, D28, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, D28, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, D28, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D28, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D28, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D28, a).vretRefs, gstepf(gs, ls, D28, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, D28, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D28, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl, gstepf(gs, ls, D28, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, D28, a).vhead, gstepf(gs, ls, D28, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, D28, a).owns)

Lemma rely-D28-D29

Proof step 133 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D28, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a), ¬ DMSQRely(gs, tid0, gs0), ls.tid ≠ tid0 ∧ ( ( ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( 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.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ (ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D28, a) ∧ pcstepf(gs, ls, D28, a) = D29 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D28, a).orl) ∧ gstepf(gs, ls, D28, a).vtail ∈ gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl from gs.vtail ∧ gstepf(gs, ls, D28, a).phead ∈ gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl from gs.phead ∧ gstepf(gs, ls, D28, a).vhead ∈ gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D28, a).vs, gstepf(gs, ls, D28, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D28, a).vs, gstepf(gs, ls, D28, a).ps, gstepf(gs, ls, D28, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, D28, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, D28, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D28, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D28, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D28, a).vretRefs, gstepf(gs, ls, D28, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, D28, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D28, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl, gstepf(gs, ls, D28, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, D28, a).vhead, gstepf(gs, ls, D28, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, D28, a).owns) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 10

Additional information

Proof step 134 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D28, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a), ¬ DMSQRely(gs, tid0, gs0) ⊦ ls.tid ≠ tid0 ∧ ( ( ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( 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.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ (ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D28, a) ∧ pcstepf(gs, ls, D28, a) = D29

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQGInv, seq:⊦ DMSQGInv(gs) ↔ 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), subst:[gs] → [gs], <all paths>

Additional information

Used terms: gs

Proof step 135 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ DMSQGInv(gs) ↔ 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)

A spec-lemma

Proof step 136 from proof copied-rely-DMSQLInv (previous step) (back to tree)

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D28, pc0 = pcstepf(gs, ls, pc, a), gs.orl ≠ [], ls.tid ≠ tid0, DMSQLInv(gs, ls, pc), 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), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, pc, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ DMSQRely(gs, tid0, gs0), ¬ 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.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.tid ≠ tid0 ∧ ( ( ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( 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.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ (ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D28, a) ∧ pcstepf(gs, ls, D28, a) = D29

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQLInv, seq:⊦ DMSQLInv(gs, ls, pc) ↔ ( pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → ( ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ ( pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ ( pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ ( pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ; gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → 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)) ∧ ( pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ( gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E9 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.nxt = null ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ ( pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → 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)) ∧ ( pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ ( pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) ) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ ( pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) )) ∧ ( pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )), subst:[gs, ls, pc] → [gs, ls, pc], <all paths>

Additional information

Used simplifier rules: ⊦ gstepf(gs, ls, D28, a) = ( ( gs .ps:= gs.ps[ls.nxt, gs.ps[ls.nxt].deqID:= Some(ls.othertid)]) .orl:= (gs.ps[ls.nxt].deqID = None ⊃ gs.orl + gs.qrl.head;gs.orl)) .qrl:= (gs.ps[ls.nxt].deqID = None ⊃ gs.qrl.tail;gs.qrl); (s) ⊦ x + a = x + a '; (s) ⊦ D28 ≠ crashed; (s) ⊦ D28 ≠ idle; (s) ⊦ D28 ≠ ready; (s) ⊦ D28 ≠ E1; (s) ⊦ D28 ≠ E17; (s) ⊦ D1 ≠ D28; (s) ⊦ D2 ≠ D28; (s) ⊦ D7 ≠ D28; (s) ⊦ D28 ≠ E4; (s) ⊦ D28 ≠ E16; (s) ⊦ D28 ≠ E15; (s) ⊦ D28 ≠ E14; (s) ⊦ D28 ≠ E13; (s) ⊦ D28 ≠ E12; (s) ⊦ D28 ≠ E11; (s) ⊦ D28 ≠ E10; (s) ⊦ D28 ≠ E9; (s) ⊦ D28 ≠ E8; (s) ⊦ D28 ≠ E7; (s) ⊦ D28 ≠ E6; (s) ⊦ D28 ≠ E5; (s) ⊦ D28 ≠ E3; (s) ⊦ D28 ≠ E2; (s) ⊦ D28 ≠ D34; (s) ⊦ D28 ≠ D31; (s) ⊦ D28 ≠ D30; (s) ⊦ D28 ≠ D29; (s) ⊦ D27 ≠ D28; (s) ⊦ D26 ≠ D28; (s) ⊦ D25 ≠ D28; (s) ⊦ D24 ≠ D28; (s) ⊦ D23 ≠ D28; (s) ⊦ D22 ≠ D28; (s) ⊦ D21 ≠ D28; (s) ⊦ D20 ≠ D28; (s) ⊦ D19 ≠ D28; (s) ⊦ D18 ≠ D28; (s) ⊦ D17 ≠ D28; (s) ⊦ D16 ≠ D28; (s) ⊦ D15 ≠ D28; (s) ⊦ D14 ≠ D28; (s) ⊦ D13 ≠ D28; (s) ⊦ D12 ≠ D28; (s) ⊦ D11 ≠ D28; (s) ⊦ D10 ≠ D28; (s) ⊦ D9 ≠ D28; (s) ⊦ D8 ≠ D28; (s) ⊦ D6 ≠ D28; (s) ⊦ D5 ≠ D28; (s) ⊦ D4 ≠ D28; (s) ⊦ D3 ≠ D28; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, D28, a) ↔ a = (gs.ps[ls.nxt].deqID = None ⊃ doDeq(ls.othertid);τ); (s) ⊦ pcstepf(gs, ls, D28, a) = D29; (s) Used terms: gs, ls, pc

Proof step 137 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ DMSQLInv(gs, ls, pc) ↔ (pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → (ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ (pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ (pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ (pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ (pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ;gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → 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)) ∧ (pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ (gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ (pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ (pc = E9 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.nxt = null ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ (pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → 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)) ∧ (pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ (pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ (pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns)) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ (pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns))) ∧ (pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)))

A spec-lemma

Proof step 138 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs.vretRefs(tid0) = gstepf(gs, ls, D28, a).vretRefs(tid0), gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D28, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D28, a).vs, gstepf(gs, ls, D28, a).ps, gstepf(gs, ls, D28, a).owns), equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D28, a).vs, gstepf(gs, ls, D28, a).ps), nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, D28, a).vhead, gstepf(gs, ls, D28, a).vs), noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl, gstepf(gs, ls, D28, a).vs), ownsRely(tid0, gs.owns, gstepf(gs, ls, D28, a).owns), pre(gs, ls, pc, a), prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D28, a).prvHp), rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D28, a).rvowns, gs.vrvHp), rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D28, a).vretRefs, gstepf(gs, ls, D28, a).vrvHp), gstepf(gs, ls, D28, a).vtail ∈ gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl from gs.vtail, gstepf(gs, ls, D28, a).phead ∈ gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl from gs.phead, gstepf(gs, ls, D28, a).vhead ∈ gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl from gs.vhead, dom gs.vrvHp ⊆ dom gstepf(gs, ls, D28, a).vrvHp, ¬ DMSQRely(gs, tid0, gs0), ∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl, ∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D28, a).orl, gs.pretRefs(tid0) = gstepf(gs, ls, D28, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D28, a).pretRefs(tid0) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQRely, seq:⊦ DMSQRely(gs, tid, gs0) ↔ (∃ 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, tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid) = gs0.vretRefs(tid) ∧ ( gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid)) ∧ rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(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(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid, gs.owns, gs0.owns), subst:[gs, tid, gs0] → [gs, tid0, gs0], <all paths>

Additional information

Used simplifier rules: ⊦ pre(gs, ls, D28, a) ↔ a = (gs.ps[ls.nxt].deqID = None ⊃ doDeq(ls.othertid);τ); (s) ⊦ (gs.qrl:= qrl).vtail = gs.vtail; (s) ⊦ (gs.orl:= qrl0).vtail = gs.vtail; (s) ⊦ (gs.ps:= ps).vtail = gs.vtail; (s) ⊦ (gs.qrl:= qrl).phead = gs.phead; (s) ⊦ (gs.orl:= qrl0).phead = gs.phead; (s) ⊦ (gs.ps:= ps).phead = gs.phead; (s) ⊦ (gs.qrl:= qrl).ps = gs.ps; (s) ⊦ (gs.orl:= qrl0).ps = gs.ps; (s) ⊦ (gs.ps:= ps).ps = ps; (s) ⊦ (gs.qrl:= qrl).rvowns = gs.rvowns; (s) ⊦ (gs.orl:= qrl0).rvowns = gs.rvowns; (s) ⊦ (gs.ps:= ps).rvowns = gs.rvowns; (s) ⊦ rvownsrely(tid, rvowns, rvowns, vrvHp); (s) ⊦ (gs.qrl:= qrl).vretRefs = gs.vretRefs; (s) ⊦ (gs.orl:= qrl0).vretRefs = gs.vretRefs; (s) ⊦ (gs.ps:= ps).vretRefs = gs.vretRefs; (s) ⊦ rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs, vrvHp); (s) ⊦ (gs.qrl:= qrl).vrvHp = gs.vrvHp; (s) ⊦ (gs.orl:= qrl0).vrvHp = gs.vrvHp; (s) ⊦ (gs.ps:= ps).vrvHp = gs.vrvHp; (s) ⊦ # s = # s0 → (s ⊆ s0 ↔ s = s0); (s) ⊦ (gs.qrl:= qrl).prvHp = gs.prvHp; (s) ⊦ (gs.orl:= qrl0).prvHp = gs.prvHp; (s) ⊦ (gs.ps:= ps).prvHp = gs.prvHp; (s) ⊦ prvHpRely(vrvHp, prvHp, prvHp); (s) ⊦ (gs.qrl:= qrl).orl = gs.orl; (s) ⊦ (gs.orl:= qrl0).orl = qrl0; (s) ⊦ (gs.qrl:= qrl).qrl = qrl; (s) ⊦ (gs.qrl:= qrl).vhead = gs.vhead; (s) ⊦ (gs.orl:= qrl0).vhead = gs.vhead; (s) ⊦ (gs.ps:= ps).vhead = gs.vhead; (s) ⊦ (gs.qrl:= qrl).vs = gs.vs; (s) ⊦ (gs.orl:= qrl0).vs = gs.vs; (s) ⊦ (gs.ps:= ps).vs = gs.vs; (s) ⊦ nextnottidRely(tid, vhead, vs, vhead, vs); (s) ⊦ (gs.qrl:= qrl).owns = gs.owns; (s) ⊦ (gs.orl:= qrl0).owns = gs.owns; (s) ⊦ (gs.ps:= ps).owns = gs.owns; (s) ⊦ ownsRely(tid, owns, owns); (s) ⊦ gstepf(gs, ls, D28, a) = ( ( gs .ps:= gs.ps[ls.nxt, gs.ps[ls.nxt].deqID:= Some(ls.othertid)]) .orl:= (gs.ps[ls.nxt].deqID = None ⊃ gs.orl + gs.qrl.head;gs.orl)) .qrl:= (gs.ps[ls.nxt].deqID = None ⊃ gs.qrl.tail;gs.qrl); (s) ⊦ x + a = x + a '; (s) ⊦ (gs.qrl:= qrl).pretRefs = gs.pretRefs; (s) ⊦ (gs.orl:= qrl0).pretRefs = gs.pretRefs; (s) ⊦ (gs.ps:= ps).pretRefs = gs.pretRefs; (s) ⊦ # x = # z → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: gs, tid0, gs0

Proof step 139 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ DMSQRely(gs, tid, gs0) ↔ (∃ 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, tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid) = gs0.vretRefs(tid) ∧ (gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid)) ∧ rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(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(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid, gs.owns, gs0.owns)

A spec-lemma

Proof step 140 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D29, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a), ¬ DMSQRely(gs, tid0, gs0) ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:rely-D29-D30, seq:⊦ ls.tid ≠ tid0 ∧ ( ( ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( 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.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D29, a) ∧ pcstepf(gs, ls, D29, a) = D30 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D29, a).orl + gstepf(gs, ls, D29, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D29, a).orl) ∧ gstepf(gs, ls, D29, a).vtail ∈ gstepf(gs, ls, D29, a).orl + gstepf(gs, ls, D29, a).qrl from gs.vtail ∧ gstepf(gs, ls, D29, a).phead ∈ gstepf(gs, ls, D29, a).orl + gstepf(gs, ls, D29, a).qrl from gs.phead ∧ gstepf(gs, ls, D29, a).vhead ∈ gstepf(gs, ls, D29, a).orl + gstepf(gs, ls, D29, a).qrl from gs.vhead ∧ equalrl (gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D29, a).vs, gstepf(gs, ls, D29, a).ps) ∧ equalowns (gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D29, a).vs, gstepf(gs, ls, D29, a).ps, gstepf(gs, ls, D29, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, D29, a).vretRefs(tid0) ∧ ( gs.pretRefs(tid0) = gstepf(gs, ls, D29, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D29, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D29, a).rvowns, gs.vrvHp) ∧ rvrely (tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D29, a).vretRefs, gstepf(gs, ls, D29, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, D29, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D29, a).prvHp) ∧ noidRely (tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D29, a).orl + gstepf(gs, ls, D29, a).qrl, gstepf(gs, ls, D29, a).vs) ∧ nextnottidRely (tid0, gs.vhead, gs.vs, gstepf(gs, ls, D29, a).vhead, gstepf(gs, ls, D29, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, D29, a).owns), subst:[ls, tid0, gs, a] → [ls, tid0, gs, a]

Additional information

Used terms: ls, tid0, gs, a

Proof step 141 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ ls.tid ≠ tid0 ∧ ( ( ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( 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.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ (ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D29, a) ∧ pcstepf(gs, ls, D29, a) = D30 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D29, a).orl + gstepf(gs, ls, D29, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D29, a).orl) ∧ gstepf(gs, ls, D29, a).vtail ∈ gstepf(gs, ls, D29, a).orl + gstepf(gs, ls, D29, a).qrl from gs.vtail ∧ gstepf(gs, ls, D29, a).phead ∈ gstepf(gs, ls, D29, a).orl + gstepf(gs, ls, D29, a).qrl from gs.phead ∧ gstepf(gs, ls, D29, a).vhead ∈ gstepf(gs, ls, D29, a).orl + gstepf(gs, ls, D29, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D29, a).vs, gstepf(gs, ls, D29, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D29, a).vs, gstepf(gs, ls, D29, a).ps, gstepf(gs, ls, D29, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, D29, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, D29, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D29, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D29, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D29, a).vretRefs, gstepf(gs, ls, D29, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, D29, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D29, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D29, a).orl + gstepf(gs, ls, D29, a).qrl, gstepf(gs, ls, D29, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, D29, a).vhead, gstepf(gs, ls, D29, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, D29, a).owns)

Lemma rely-D29-D30

Proof step 142 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D29, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a), ¬ DMSQRely(gs, tid0, gs0), ls.tid ≠ tid0 ∧ ( ( ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( 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.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ (ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D29, a) ∧ pcstepf(gs, ls, D29, a) = D30 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D29, a).orl + gstepf(gs, ls, D29, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D29, a).orl) ∧ gstepf(gs, ls, D29, a).vtail ∈ gstepf(gs, ls, D29, a).orl + gstepf(gs, ls, D29, a).qrl from gs.vtail ∧ gstepf(gs, ls, D29, a).phead ∈ gstepf(gs, ls, D29, a).orl + gstepf(gs, ls, D29, a).qrl from gs.phead ∧ gstepf(gs, ls, D29, a).vhead ∈ gstepf(gs, ls, D29, a).orl + gstepf(gs, ls, D29, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D29, a).vs, gstepf(gs, ls, D29, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D29, a).vs, gstepf(gs, ls, D29, a).ps, gstepf(gs, ls, D29, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, D29, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, D29, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D29, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D29, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D29, a).vretRefs, gstepf(gs, ls, D29, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, D29, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D29, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D29, a).orl + gstepf(gs, ls, D29, a).qrl, gstepf(gs, ls, D29, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, D29, a).vhead, gstepf(gs, ls, D29, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, D29, a).owns) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 10

Additional information

Proof step 143 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D29, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a), ¬ DMSQRely(gs, tid0, gs0) ⊦ ls.tid ≠ tid0 ∧ ( ( ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( 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.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ (ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D29, a) ∧ pcstepf(gs, ls, D29, a) = D30

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQGInv, seq:⊦ DMSQGInv(gs) ↔ 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), subst:[gs] → [gs], <all paths>

Additional information

Used terms: gs

Proof step 144 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ DMSQGInv(gs) ↔ 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)

A spec-lemma

Proof step 145 from proof copied-rely-DMSQLInv (previous step) (back to tree)

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D29, pc0 = pcstepf(gs, ls, pc, a), gs.orl ≠ [], ls.tid ≠ tid0, DMSQLInv(gs, ls, pc), 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), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, pc, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ DMSQRely(gs, tid0, gs0), ¬ 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.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.tid ≠ tid0 ∧ ( ( ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( 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.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ (ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D29, a) ∧ pcstepf(gs, ls, D29, a) = D30

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQLInv, seq:⊦ DMSQLInv(gs, ls, pc) ↔ ( pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → ( ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ ( pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ ( pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ ( pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ; gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → 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)) ∧ ( pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ( gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E9 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.nxt = null ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ ( pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → 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)) ∧ ( pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ ( pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) ) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ ( pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) )) ∧ ( pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )), subst:[gs, ls, pc] → [gs, ls, pc], <all paths>

Additional information

Used simplifier rules: ⊦ D29 ≠ crashed; (s) ⊦ D29 ≠ idle; (s) ⊦ D29 ≠ ready; (s) ⊦ D29 ≠ E1; (s) ⊦ D29 ≠ E17; (s) ⊦ D1 ≠ D29; (s) ⊦ D2 ≠ D29; (s) ⊦ D7 ≠ D29; (s) ⊦ D29 ≠ E4; (s) ⊦ D29 ≠ E16; (s) ⊦ D29 ≠ E15; (s) ⊦ D29 ≠ E14; (s) ⊦ D29 ≠ E13; (s) ⊦ D29 ≠ E12; (s) ⊦ D29 ≠ E11; (s) ⊦ D29 ≠ E10; (s) ⊦ D29 ≠ E9; (s) ⊦ D29 ≠ E8; (s) ⊦ D29 ≠ E7; (s) ⊦ D29 ≠ E6; (s) ⊦ D29 ≠ E5; (s) ⊦ D29 ≠ E3; (s) ⊦ D29 ≠ E2; (s) ⊦ D29 ≠ D34; (s) ⊦ D29 ≠ D31; (s) ⊦ D29 ≠ D30; (s) ⊦ D28 ≠ D29; (s) ⊦ D27 ≠ D29; (s) ⊦ D26 ≠ D29; (s) ⊦ D25 ≠ D29; (s) ⊦ D24 ≠ D29; (s) ⊦ D23 ≠ D29; (s) ⊦ D22 ≠ D29; (s) ⊦ D21 ≠ D29; (s) ⊦ D20 ≠ D29; (s) ⊦ D19 ≠ D29; (s) ⊦ D18 ≠ D29; (s) ⊦ D17 ≠ D29; (s) ⊦ D16 ≠ D29; (s) ⊦ D15 ≠ D29; (s) ⊦ D14 ≠ D29; (s) ⊦ D13 ≠ D29; (s) ⊦ D12 ≠ D29; (s) ⊦ D11 ≠ D29; (s) ⊦ D10 ≠ D29; (s) ⊦ D9 ≠ D29; (s) ⊦ D8 ≠ D29; (s) ⊦ D6 ≠ D29; (s) ⊦ D5 ≠ D29; (s) ⊦ D4 ≠ D29; (s) ⊦ D3 ≠ D29; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, D29, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, D29, a) = D30; (s) Used terms: gs, ls, pc

Proof step 146 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ DMSQLInv(gs, ls, pc) ↔ (pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → (ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ (pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ (pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ (pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ (pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ;gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → 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)) ∧ (pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ (gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ (pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ (pc = E9 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.nxt = null ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ (pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → 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)) ∧ (pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ (pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ (pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns)) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ (pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns))) ∧ (pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)))

A spec-lemma

Proof step 147 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs.vretRefs(tid0) = gstepf(gs, ls, D29, a).vretRefs(tid0), gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D29, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D29, a).vs, gstepf(gs, ls, D29, a).ps, gstepf(gs, ls, D29, a).owns), equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D29, a).vs, gstepf(gs, ls, D29, a).ps), nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, D29, a).vhead, gstepf(gs, ls, D29, a).vs), noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D29, a).orl + gstepf(gs, ls, D29, a).qrl, gstepf(gs, ls, D29, a).vs), ownsRely(tid0, gs.owns, gstepf(gs, ls, D29, a).owns), pre(gs, ls, pc, a), prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D29, a).prvHp), rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D29, a).rvowns, gs.vrvHp), rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D29, a).vretRefs, gstepf(gs, ls, D29, a).vrvHp), gstepf(gs, ls, D29, a).vtail ∈ gstepf(gs, ls, D29, a).orl + gstepf(gs, ls, D29, a).qrl from gs.vtail, gstepf(gs, ls, D29, a).phead ∈ gstepf(gs, ls, D29, a).orl + gstepf(gs, ls, D29, a).qrl from gs.phead, gstepf(gs, ls, D29, a).vhead ∈ gstepf(gs, ls, D29, a).orl + gstepf(gs, ls, D29, a).qrl from gs.vhead, dom gs.vrvHp ⊆ dom gstepf(gs, ls, D29, a).vrvHp, ¬ DMSQRely(gs, tid0, gs0), ∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D29, a).orl + gstepf(gs, ls, D29, a).qrl, ∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D29, a).orl, gs.pretRefs(tid0) = gstepf(gs, ls, D29, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D29, a).pretRefs(tid0) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQRely, seq:⊦ DMSQRely(gs, tid, gs0) ↔ (∃ 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, tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid) = gs0.vretRefs(tid) ∧ ( gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid)) ∧ rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(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(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid, gs.owns, gs0.owns), subst:[gs, tid, gs0] → [gs, tid0, gs0], <all paths>

Additional information

Used simplifier rules: ⊦ pre(gs, ls, D29, a) ↔ a = τ; (s) ⊦ (gs.vrvHp:= vrvHp).prvHp = gs.prvHp; (s) ⊦ prvHpRely(vrvHp, prvHp, prvHp); (s) ⊦ (gs.vrvHp:= vrvHp).rvowns = gs.rvowns; (s) ⊦ rvownsrely(tid, rvowns, rvowns, vrvHp); (s) ⊦ (gs.vrvHp:= vrvHp).vretRefs = gs.vretRefs; (s) ⊦ (gs.vrvHp:= vrvHp).phead = gs.phead; (s) ⊦ (gs.vrvHp:= vrvHp).vtail = gs.vtail; (s) ⊦ (gs.vrvHp:= vrvHp).vrvHp = vrvHp; (s) ⊦ dom st[a, d] = dom st ++ a; (s) ⊦ s ⊆ s ++ a; (s) ⊦ equalowns(vs, ps, owns, tid, vs, ps, owns); (s) ⊦ (gs.vrvHp:= vrvHp).ps = gs.ps; (s) ⊦ equalrl(rl, vs, ps, vs, ps); (s) ⊦ (gs.vrvHp:= vrvHp).vhead = gs.vhead; (s) ⊦ nextnottidRely(tid, vhead, vs, vhead, vs); (s) ⊦ (gs.vrvHp:= vrvHp).vs = gs.vs; (s) ⊦ (gs.vrvHp:= vrvHp).owns = gs.owns; (s) ⊦ ownsRely(tid, owns, owns); (s) ⊦ (gs.vrvHp:= vrvHp).qrl = gs.qrl; (s) ⊦ # x = # z → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) ⊦ (gs.vrvHp:= vrvHp).orl = gs.orl; (s) ⊦ gstepf(gs, ls, D29, τ) = gs.vrvHp:= gs.vrvHp[ls.addr, ls.optval]; (s) ⊦ (gs.vrvHp:= vrvHp).pretRefs = gs.pretRefs; (s) ⊦ noidRely(tid, rl, vs, rl, vs); (s) ⊦ [] + x = x; (s) ⊦ x = x + y ↔ y = []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: gs, tid0, gs0

Proof step 148 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ DMSQRely(gs, tid, gs0) ↔ (∃ 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, tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid) = gs0.vretRefs(tid) ∧ (gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid)) ∧ rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(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(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid, gs.owns, gs0.owns)

A spec-lemma

Proof step 149 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D30, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a), ¬ DMSQRely(gs, tid0, gs0) ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:rely-D30-D31, seq:⊦ ls.tid ≠ tid0 ∧ ( ( ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( 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.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D30, a) ∧ pcstepf(gs, ls, D30, a) = D31 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D30, a).orl + gstepf(gs, ls, D30, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D30, a).orl) ∧ gstepf(gs, ls, D30, a).vtail ∈ gstepf(gs, ls, D30, a).orl + gstepf(gs, ls, D30, a).qrl from gs.vtail ∧ gstepf(gs, ls, D30, a).phead ∈ gstepf(gs, ls, D30, a).orl + gstepf(gs, ls, D30, a).qrl from gs.phead ∧ gstepf(gs, ls, D30, a).vhead ∈ gstepf(gs, ls, D30, a).orl + gstepf(gs, ls, D30, a).qrl from gs.vhead ∧ equalrl (gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D30, a).vs, gstepf(gs, ls, D30, a).ps) ∧ equalowns (gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D30, a).vs, gstepf(gs, ls, D30, a).ps, gstepf(gs, ls, D30, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, D30, a).vretRefs(tid0) ∧ ( gs.pretRefs(tid0) = gstepf(gs, ls, D30, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D30, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D30, a).rvowns, gs.vrvHp) ∧ rvrely (tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D30, a).vretRefs, gstepf(gs, ls, D30, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, D30, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D30, a).prvHp) ∧ noidRely (tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D30, a).orl + gstepf(gs, ls, D30, a).qrl, gstepf(gs, ls, D30, a).vs) ∧ nextnottidRely (tid0, gs.vhead, gs.vs, gstepf(gs, ls, D30, a).vhead, gstepf(gs, ls, D30, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, D30, a).owns), subst:[ls, tid0, gs, a] → [ls, tid0, gs, a]

Additional information

Used terms: ls, tid0, gs, a

Proof step 150 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ ls.tid ≠ tid0 ∧ ( ( ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( 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.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ (ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D30, a) ∧ pcstepf(gs, ls, D30, a) = D31 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D30, a).orl + gstepf(gs, ls, D30, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D30, a).orl) ∧ gstepf(gs, ls, D30, a).vtail ∈ gstepf(gs, ls, D30, a).orl + gstepf(gs, ls, D30, a).qrl from gs.vtail ∧ gstepf(gs, ls, D30, a).phead ∈ gstepf(gs, ls, D30, a).orl + gstepf(gs, ls, D30, a).qrl from gs.phead ∧ gstepf(gs, ls, D30, a).vhead ∈ gstepf(gs, ls, D30, a).orl + gstepf(gs, ls, D30, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D30, a).vs, gstepf(gs, ls, D30, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D30, a).vs, gstepf(gs, ls, D30, a).ps, gstepf(gs, ls, D30, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, D30, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, D30, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D30, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D30, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D30, a).vretRefs, gstepf(gs, ls, D30, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, D30, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D30, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D30, a).orl + gstepf(gs, ls, D30, a).qrl, gstepf(gs, ls, D30, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, D30, a).vhead, gstepf(gs, ls, D30, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, D30, a).owns)

Lemma rely-D30-D31

Proof step 151 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D30, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a), ¬ DMSQRely(gs, tid0, gs0), ls.tid ≠ tid0 ∧ ( ( ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( 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.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ (ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D30, a) ∧ pcstepf(gs, ls, D30, a) = D31 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D30, a).orl + gstepf(gs, ls, D30, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D30, a).orl) ∧ gstepf(gs, ls, D30, a).vtail ∈ gstepf(gs, ls, D30, a).orl + gstepf(gs, ls, D30, a).qrl from gs.vtail ∧ gstepf(gs, ls, D30, a).phead ∈ gstepf(gs, ls, D30, a).orl + gstepf(gs, ls, D30, a).qrl from gs.phead ∧ gstepf(gs, ls, D30, a).vhead ∈ gstepf(gs, ls, D30, a).orl + gstepf(gs, ls, D30, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D30, a).vs, gstepf(gs, ls, D30, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D30, a).vs, gstepf(gs, ls, D30, a).ps, gstepf(gs, ls, D30, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, D30, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, D30, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D30, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D30, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D30, a).vretRefs, gstepf(gs, ls, D30, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, D30, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D30, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D30, a).orl + gstepf(gs, ls, D30, a).qrl, gstepf(gs, ls, D30, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, D30, a).vhead, gstepf(gs, ls, D30, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, D30, a).owns) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 10

Additional information

Proof step 152 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D30, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a), ¬ DMSQRely(gs, tid0, gs0) ⊦ ls.tid ≠ tid0 ∧ ( ( ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( 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.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ (ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D30, a) ∧ pcstepf(gs, ls, D30, a) = D31

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQGInv, seq:⊦ DMSQGInv(gs) ↔ 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), subst:[gs] → [gs], <all paths>

Additional information

Used terms: gs

Proof step 153 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ DMSQGInv(gs) ↔ 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)

A spec-lemma

Proof step 154 from proof copied-rely-DMSQLInv (previous step) (back to tree)

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D30, pc0 = pcstepf(gs, ls, pc, a), gs.orl ≠ [], ls.tid ≠ tid0, DMSQLInv(gs, ls, pc), 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), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, pc, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ DMSQRely(gs, tid0, gs0), ¬ 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.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.tid ≠ tid0 ∧ ( ( ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( 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.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ (ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D30, a) ∧ pcstepf(gs, ls, D30, a) = D31

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQLInv, seq:⊦ DMSQLInv(gs, ls, pc) ↔ ( pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → ( ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ ( pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ ( pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ ( pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ; gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → 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)) ∧ ( pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ( gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E9 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.nxt = null ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ ( pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → 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)) ∧ ( pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ ( pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) ) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ ( pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) )) ∧ ( pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )), subst:[gs, ls, pc] → [gs, ls, pc], <all paths>

Additional information

Used simplifier rules: ⊦ D30 ≠ crashed; (s) ⊦ D30 ≠ idle; (s) ⊦ D30 ≠ ready; (s) ⊦ D30 ≠ E1; (s) ⊦ D30 ≠ E17; (s) ⊦ D1 ≠ D30; (s) ⊦ D2 ≠ D30; (s) ⊦ D7 ≠ D30; (s) ⊦ D30 ≠ E4; (s) ⊦ D30 ≠ E16; (s) ⊦ D30 ≠ E15; (s) ⊦ D30 ≠ E14; (s) ⊦ D30 ≠ E13; (s) ⊦ D30 ≠ E12; (s) ⊦ D30 ≠ E11; (s) ⊦ D30 ≠ E10; (s) ⊦ D30 ≠ E9; (s) ⊦ D30 ≠ E8; (s) ⊦ D30 ≠ E7; (s) ⊦ D30 ≠ E6; (s) ⊦ D30 ≠ E5; (s) ⊦ D30 ≠ E3; (s) ⊦ D30 ≠ E2; (s) ⊦ D30 ≠ D34; (s) ⊦ D30 ≠ D31; (s) ⊦ D29 ≠ D30; (s) ⊦ D28 ≠ D30; (s) ⊦ D27 ≠ D30; (s) ⊦ D26 ≠ D30; (s) ⊦ D25 ≠ D30; (s) ⊦ D24 ≠ D30; (s) ⊦ D23 ≠ D30; (s) ⊦ D22 ≠ D30; (s) ⊦ D21 ≠ D30; (s) ⊦ D20 ≠ D30; (s) ⊦ D19 ≠ D30; (s) ⊦ D18 ≠ D30; (s) ⊦ D17 ≠ D30; (s) ⊦ D16 ≠ D30; (s) ⊦ D15 ≠ D30; (s) ⊦ D14 ≠ D30; (s) ⊦ D13 ≠ D30; (s) ⊦ D12 ≠ D30; (s) ⊦ D11 ≠ D30; (s) ⊦ D10 ≠ D30; (s) ⊦ D9 ≠ D30; (s) ⊦ D8 ≠ D30; (s) ⊦ D6 ≠ D30; (s) ⊦ D5 ≠ D30; (s) ⊦ D4 ≠ D30; (s) ⊦ D3 ≠ D30; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, D30, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, D30, a) = D31; (s) Used terms: gs, ls, pc

Proof step 155 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ DMSQLInv(gs, ls, pc) ↔ (pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → (ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ (pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ (pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ (pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ (pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ;gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → 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)) ∧ (pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ (gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ (pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ (pc = E9 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.nxt = null ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ (pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → 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)) ∧ (pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ (pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ (pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns)) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ (pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns))) ∧ (pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)))

A spec-lemma

Proof step 156 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs.vretRefs(tid0) = gstepf(gs, ls, D30, a).vretRefs(tid0), gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D30, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D30, a).vs, gstepf(gs, ls, D30, a).ps, gstepf(gs, ls, D30, a).owns), equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D30, a).vs, gstepf(gs, ls, D30, a).ps), nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, D30, a).vhead, gstepf(gs, ls, D30, a).vs), noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D30, a).orl + gstepf(gs, ls, D30, a).qrl, gstepf(gs, ls, D30, a).vs), ownsRely(tid0, gs.owns, gstepf(gs, ls, D30, a).owns), pre(gs, ls, pc, a), prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D30, a).prvHp), rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D30, a).rvowns, gs.vrvHp), rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D30, a).vretRefs, gstepf(gs, ls, D30, a).vrvHp), gstepf(gs, ls, D30, a).vtail ∈ gstepf(gs, ls, D30, a).orl + gstepf(gs, ls, D30, a).qrl from gs.vtail, gstepf(gs, ls, D30, a).phead ∈ gstepf(gs, ls, D30, a).orl + gstepf(gs, ls, D30, a).qrl from gs.phead, gstepf(gs, ls, D30, a).vhead ∈ gstepf(gs, ls, D30, a).orl + gstepf(gs, ls, D30, a).qrl from gs.vhead, dom gs.vrvHp ⊆ dom gstepf(gs, ls, D30, a).vrvHp, ¬ DMSQRely(gs, tid0, gs0), ∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D30, a).orl + gstepf(gs, ls, D30, a).qrl, ∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D30, a).orl, gs.pretRefs(tid0) = gstepf(gs, ls, D30, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D30, a).pretRefs(tid0) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQRely, seq:⊦ DMSQRely(gs, tid, gs0) ↔ (∃ 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, tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid) = gs0.vretRefs(tid) ∧ ( gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid)) ∧ rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(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(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid, gs.owns, gs0.owns), subst:[gs, tid, gs0] → [gs, tid0, gs0], <all paths>

Additional information

Used simplifier rules: ⊦ pre(gs, ls, D30, a) ↔ a = τ; (s) ⊦ (gs.prvHp:= vrvHp0).prvHp = vrvHp0; (s) ⊦ (gs.prvHp:= vrvHp0).rvowns = gs.rvowns; (s) ⊦ rvownsrely(tid, rvowns, rvowns, vrvHp); (s) ⊦ (gs.prvHp:= vrvHp0).vretRefs = gs.vretRefs; (s) ⊦ rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs, vrvHp); (s) ⊦ (gs.prvHp:= vrvHp0).phead = gs.phead; (s) ⊦ (gs.prvHp:= vrvHp0).vtail = gs.vtail; (s) ⊦ (gs.prvHp:= vrvHp0).vrvHp = gs.vrvHp; (s) ⊦ # s = # s0 → (s ⊆ s0 ↔ s = s0); (s) ⊦ equalowns(vs, ps, owns, tid, vs, ps, owns); (s) ⊦ (gs.prvHp:= vrvHp0).ps = gs.ps; (s) ⊦ equalrl(rl, vs, ps, vs, ps); (s) ⊦ (gs.prvHp:= vrvHp0).vhead = gs.vhead; (s) ⊦ nextnottidRely(tid, vhead, vs, vhead, vs); (s) ⊦ (gs.prvHp:= vrvHp0).vs = gs.vs; (s) ⊦ (gs.prvHp:= vrvHp0).owns = gs.owns; (s) ⊦ ownsRely(tid, owns, owns); (s) ⊦ (gs.prvHp:= vrvHp0).qrl = gs.qrl; (s) ⊦ # x = # z → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) ⊦ (gs.prvHp:= vrvHp0).orl = gs.orl; (s) ⊦ gstepf(gs, ls, D30, τ) = gs.prvHp:= gs.prvHp[ls.addr, gs.vrvHp[ls.addr]]; (s) ⊦ (gs.prvHp:= vrvHp0).pretRefs = gs.pretRefs; (s) ⊦ noidRely(tid, rl, vs, rl, vs); (s) ⊦ [] + x = x; (s) ⊦ x = x + y ↔ y = []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: gs, tid0, gs0

Proof step 157 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ DMSQRely(gs, tid, gs0) ↔ (∃ 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, tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid) = gs0.vretRefs(tid) ∧ (gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid)) ∧ rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(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(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid, gs.owns, gs0.owns)

A spec-lemma

Proof step 158 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D31, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a), ¬ DMSQRely(gs, tid0, gs0) ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:rely-D31-D6, seq:⊦ ls.tid ≠ tid0 ∧ ( ( ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( 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.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D31, a) ∧ pcstepf(gs, ls, D31, a) = D6 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D31, a).orl + gstepf(gs, ls, D31, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D31, a).orl) ∧ gstepf(gs, ls, D31, a).vtail ∈ gstepf(gs, ls, D31, a).orl + gstepf(gs, ls, D31, a).qrl from gs.vtail ∧ gstepf(gs, ls, D31, a).phead ∈ gstepf(gs, ls, D31, a).orl + gstepf(gs, ls, D31, a).qrl from gs.phead ∧ gstepf(gs, ls, D31, a).vhead ∈ gstepf(gs, ls, D31, a).orl + gstepf(gs, ls, D31, a).qrl from gs.vhead ∧ equalrl (gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D31, a).vs, gstepf(gs, ls, D31, a).ps) ∧ equalowns (gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D31, a).vs, gstepf(gs, ls, D31, a).ps, gstepf(gs, ls, D31, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, D31, a).vretRefs(tid0) ∧ ( gs.pretRefs(tid0) = gstepf(gs, ls, D31, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D31, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D31, a).rvowns, gs.vrvHp) ∧ rvrely (tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D31, a).vretRefs, gstepf(gs, ls, D31, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, D31, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D31, a).prvHp) ∧ noidRely (tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D31, a).orl + gstepf(gs, ls, D31, a).qrl, gstepf(gs, ls, D31, a).vs) ∧ nextnottidRely (tid0, gs.vhead, gs.vs, gstepf(gs, ls, D31, a).vhead, gstepf(gs, ls, D31, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, D31, a).owns), subst:[ls, tid0, gs, a] → [ls, tid0, gs, a]

Additional information

Used terms: ls, tid0, gs, a

Proof step 159 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ ls.tid ≠ tid0 ∧ ( (ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( 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.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D31, a) ∧ pcstepf(gs, ls, D31, a) = D6 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D31, a).orl + gstepf(gs, ls, D31, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D31, a).orl) ∧ gstepf(gs, ls, D31, a).vtail ∈ gstepf(gs, ls, D31, a).orl + gstepf(gs, ls, D31, a).qrl from gs.vtail ∧ gstepf(gs, ls, D31, a).phead ∈ gstepf(gs, ls, D31, a).orl + gstepf(gs, ls, D31, a).qrl from gs.phead ∧ gstepf(gs, ls, D31, a).vhead ∈ gstepf(gs, ls, D31, a).orl + gstepf(gs, ls, D31, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D31, a).vs, gstepf(gs, ls, D31, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D31, a).vs, gstepf(gs, ls, D31, a).ps, gstepf(gs, ls, D31, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, D31, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, D31, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D31, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D31, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D31, a).vretRefs, gstepf(gs, ls, D31, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, D31, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D31, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D31, a).orl + gstepf(gs, ls, D31, a).qrl, gstepf(gs, ls, D31, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, D31, a).vhead, gstepf(gs, ls, D31, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, D31, a).owns)

Lemma rely-D31-D6

Proof step 160 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D31, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a), ¬ DMSQRely(gs, tid0, gs0), ls.tid ≠ tid0 ∧ ( (ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( 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.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D31, a) ∧ pcstepf(gs, ls, D31, a) = D6 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D31, a).orl + gstepf(gs, ls, D31, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D31, a).orl) ∧ gstepf(gs, ls, D31, a).vtail ∈ gstepf(gs, ls, D31, a).orl + gstepf(gs, ls, D31, a).qrl from gs.vtail ∧ gstepf(gs, ls, D31, a).phead ∈ gstepf(gs, ls, D31, a).orl + gstepf(gs, ls, D31, a).qrl from gs.phead ∧ gstepf(gs, ls, D31, a).vhead ∈ gstepf(gs, ls, D31, a).orl + gstepf(gs, ls, D31, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D31, a).vs, gstepf(gs, ls, D31, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D31, a).vs, gstepf(gs, ls, D31, a).ps, gstepf(gs, ls, D31, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, D31, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, D31, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D31, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D31, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D31, a).vretRefs, gstepf(gs, ls, D31, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, D31, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D31, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D31, a).orl + gstepf(gs, ls, D31, a).qrl, gstepf(gs, ls, D31, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, D31, a).vhead, gstepf(gs, ls, D31, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, D31, a).owns) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 10

Additional information

Proof step 161 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D31, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a), ¬ DMSQRely(gs, tid0, gs0) ⊦ ls.tid ≠ tid0 ∧ ( (ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( 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.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D31, a) ∧ pcstepf(gs, ls, D31, a) = D6

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQGInv, seq:⊦ DMSQGInv(gs) ↔ 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), subst:[gs] → [gs], <all paths>

Additional information

Used terms: gs

Proof step 162 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ DMSQGInv(gs) ↔ 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)

A spec-lemma

Proof step 163 from proof copied-rely-DMSQLInv (previous step) (back to tree)

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D31, pc0 = pcstepf(gs, ls, pc, a), gs.orl ≠ [], ls.tid ≠ tid0, DMSQLInv(gs, ls, pc), 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), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, pc, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ DMSQRely(gs, tid0, gs0), ¬ 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.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.tid ≠ tid0 ∧ ( (ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( 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.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D31, a) ∧ pcstepf(gs, ls, D31, a) = D6

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQLInv, seq:⊦ DMSQLInv(gs, ls, pc) ↔ ( pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → ( ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ ( pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ ( pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ ( pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ; gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → 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)) ∧ ( pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ( gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E9 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.nxt = null ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ ( pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → 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)) ∧ ( pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ ( pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) ) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ ( pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) )) ∧ ( pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )), subst:[gs, ls, pc] → [gs, ls, pc], <all paths>

Additional information

Used simplifier rules: ⊦ gstepf(gs, ls, D31, a) = (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs); (s) ⊦ D31 ≠ crashed; (s) ⊦ D31 ≠ idle; (s) ⊦ D31 ≠ ready; (s) ⊦ D31 ≠ E1; (s) ⊦ D31 ≠ E17; (s) ⊦ D1 ≠ D31; (s) ⊦ D2 ≠ D31; (s) ⊦ D7 ≠ D31; (s) ⊦ D31 ≠ E4; (s) ⊦ D31 ≠ E16; (s) ⊦ D31 ≠ E15; (s) ⊦ D31 ≠ E14; (s) ⊦ D31 ≠ E13; (s) ⊦ D31 ≠ E12; (s) ⊦ D31 ≠ E11; (s) ⊦ D31 ≠ E10; (s) ⊦ D31 ≠ E9; (s) ⊦ D31 ≠ E8; (s) ⊦ D31 ≠ E7; (s) ⊦ D31 ≠ E6; (s) ⊦ D31 ≠ E5; (s) ⊦ D31 ≠ E3; (s) ⊦ D31 ≠ E2; (s) ⊦ D31 ≠ D34; (s) ⊦ D30 ≠ D31; (s) ⊦ D29 ≠ D31; (s) ⊦ D28 ≠ D31; (s) ⊦ D27 ≠ D31; (s) ⊦ D26 ≠ D31; (s) ⊦ D25 ≠ D31; (s) ⊦ D24 ≠ D31; (s) ⊦ D23 ≠ D31; (s) ⊦ D22 ≠ D31; (s) ⊦ D21 ≠ D31; (s) ⊦ D20 ≠ D31; (s) ⊦ D19 ≠ D31; (s) ⊦ D18 ≠ D31; (s) ⊦ D17 ≠ D31; (s) ⊦ D16 ≠ D31; (s) ⊦ D15 ≠ D31; (s) ⊦ D14 ≠ D31; (s) ⊦ D13 ≠ D31; (s) ⊦ D12 ≠ D31; (s) ⊦ D11 ≠ D31; (s) ⊦ D10 ≠ D31; (s) ⊦ D9 ≠ D31; (s) ⊦ D8 ≠ D31; (s) ⊦ D6 ≠ D31; (s) ⊦ D5 ≠ D31; (s) ⊦ D4 ≠ D31; (s) ⊦ D3 ≠ D31; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, D31, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, D31, a) = D6; (s) Used terms: gs, ls, pc

Proof step 164 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ DMSQLInv(gs, ls, pc) ↔ (pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → (ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ (pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ (pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ (pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ (pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ;gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → 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)) ∧ (pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ (gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ (pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ (pc = E9 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.nxt = null ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ (pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → 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)) ∧ (pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ (pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ (pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns)) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ (pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns))) ∧ (pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)))

A spec-lemma

Proof step 165 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs.vretRefs(tid0) = gstepf(gs, ls, D31, a).vretRefs(tid0), gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D31, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D31, a).vs, gstepf(gs, ls, D31, a).ps, gstepf(gs, ls, D31, a).owns), equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D31, a).vs, gstepf(gs, ls, D31, a).ps), nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, D31, a).vhead, gstepf(gs, ls, D31, a).vs), noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D31, a).orl + gstepf(gs, ls, D31, a).qrl, gstepf(gs, ls, D31, a).vs), ownsRely(tid0, gs.owns, gstepf(gs, ls, D31, a).owns), pre(gs, ls, pc, a), prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D31, a).prvHp), rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D31, a).rvowns, gs.vrvHp), rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D31, a).vretRefs, gstepf(gs, ls, D31, a).vrvHp), gstepf(gs, ls, D31, a).vtail ∈ gstepf(gs, ls, D31, a).orl + gstepf(gs, ls, D31, a).qrl from gs.vtail, gstepf(gs, ls, D31, a).phead ∈ gstepf(gs, ls, D31, a).orl + gstepf(gs, ls, D31, a).qrl from gs.phead, gstepf(gs, ls, D31, a).vhead ∈ gstepf(gs, ls, D31, a).orl + gstepf(gs, ls, D31, a).qrl from gs.vhead, dom gs.vrvHp ⊆ dom gstepf(gs, ls, D31, a).vrvHp, ¬ DMSQRely(gs, tid0, gs0), ∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D31, a).orl + gstepf(gs, ls, D31, a).qrl, ∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D31, a).orl, gs.pretRefs(tid0) = gstepf(gs, ls, D31, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D31, a).pretRefs(tid0) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQRely, seq:⊦ DMSQRely(gs, tid, gs0) ↔ (∃ 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, tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid) = gs0.vretRefs(tid) ∧ ( gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid)) ∧ rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(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(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid, gs.owns, gs0.owns), subst:[gs, tid, gs0] → [gs, tid0, gs0], <all paths>

Additional information

Used simplifier rules: ⊦ pre(gs, ls, D31, a) ↔ a = τ; (s) ⊦ gstepf(gs, ls, D31, a) = (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs); (s) ⊦ # x = # z → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: gs, tid0, gs0

Proof step 166 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ DMSQRely(gs, tid, gs0) ↔ (∃ 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, tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid) = gs0.vretRefs(tid) ∧ (gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid)) ∧ rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(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(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid, gs.owns, gs0.owns)

A spec-lemma

Proof step 167 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = E1, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a), ¬ DMSQRely(gs, tid0, gs0) ⊦

User applied rule subst equation

And obtained the following new goals

Rule argument

pos: left 3, flags: discard

Additional information

Proof step 168 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E1, a), ls0 = lstepf(gs, ls, E1, a), pc0 = pcstepf(gs, ls, E1, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, E1), pre(gs, ls, E1, a), ¬ DMSQRely(gs, tid0, gs0) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:pre-E1, seq:⊦ pre(gs, ls, E1, a) ↔ (∃ node0, nd0, success0. ( ¬ node0 ∈ gs.vs ∧ ¬ node0 ∈ gs.ps ∧ node0 ≠ null ∧ (success0 ↔ false)) ∧ a = chooseE1(node0, nd0, success0)) ∨ a = τ ∧ ¬ (∃ node0, nd0, success0. ¬ node0 ∈ gs.vs ∧ ¬ node0 ∈ gs.ps ∧ node0 ≠ null ∧ (success0 ↔ false)), subst:[gs, ls, a] → [gs, ls, a], <all paths>

Additional information

Used terms: gs, ls, a

Proof step 169 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ pre(gs, ls, E1, a) ↔ (∃ node0, nd0, success0. (¬ node0 ∈ gs.vs ∧ ¬ node0 ∈ gs.ps ∧ node0 ≠ null ∧ (success0 ↔ false)) ∧ a = chooseE1(node0, nd0, success0)) ∨ a = τ ∧ ¬(∃ node0, nd0, success0. ¬ node0 ∈ gs.vs ∧ ¬ node0 ∈ gs.ps ∧ node0 ≠ null ∧ (success0 ↔ false))

A spec-lemma

Proof step 170 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E1, a), ls0 = lstepf(gs, ls, E1, a), pc0 = pcstepf(gs, ls, E1, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, E1), ¬ DMSQRely(gs, tid0, gs0), (∃ node0, nd0, success0. (¬ node0 ∈ gs.vs ∧ ¬ node0 ∈ gs.ps ∧ node0 ≠ null ∧ (success0 ↔ false)) ∧ a = chooseE1(node0, nd0, success0)) ∨ a = τ ∧ ¬(∃ node0, nd0, success0. ¬ node0 ∈ gs.vs ∧ ¬ node0 ∈ gs.ps ∧ node0 ≠ null ∧ (success0 ↔ false)) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 8

Additional information

Used simplifier rules: Relypred-reflexive: ⊦ DMSQGInv(gs) → DMSQRely(gs, tid, gs); ⊦ gstepf(gs, ls, E1, τ) = gs; (s)

Proof step 171 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E1, a), ls0 = lstepf(gs, ls, E1, a), pc0 = pcstepf(gs, ls, E1, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, E1), ¬ DMSQRely(gs, tid0, gs0), ∃ node0, nd0, success0. (¬ node0 ∈ gs.vs ∧ ¬ node0 ∈ gs.ps ∧ node0 ≠ null ∧ (success0 ↔ false)) ∧ a = chooseE1(node0, nd0, success0) ⊦

User applied rule exists left

And obtained the following new goals

Rule argument

pos: left 8

Additional information

Proof step 172 from proof copied-rely-DMSQLInv (previous step) (back to tree)

success0 ↔ false, a = chooseE1(node0, nd0, success0), gs0 = gstepf(gs, ls, E1, a), ls0 = lstepf(gs, ls, E1, a), pc0 = pcstepf(gs, ls, E1, a), ls.tid ≠ tid0, node0 ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, E1), ¬ DMSQRely(gs, tid0, gs0), ¬ node0 ∈ gs.ps, ¬ node0 ∈ gs.vs ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:rely-E1-E2, seq:⊦ ls.tid ≠ tid0 ∧ ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns (gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, E1, a) ∧ pcstepf(gs, ls, E1, a) = E2 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, E1, a).orl) ∧ gstepf(gs, ls, E1, a).vtail ∈ gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl from gs.vtail ∧ gstepf(gs, ls, E1, a).phead ∈ gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl from gs.phead ∧ gstepf(gs, ls, E1, a).vhead ∈ gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl from gs.vhead ∧ equalrl (gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, E1, a).vs, gstepf(gs, ls, E1, a).ps) ∧ equalowns (gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, E1, a).vs, gstepf(gs, ls, E1, a).ps, gstepf(gs, ls, E1, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, E1, a).vretRefs(tid0) ∧ ( gs.pretRefs(tid0) = gstepf(gs, ls, E1, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, E1, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, E1, a).rvowns, gs.vrvHp) ∧ rvrely (tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, E1, a).vretRefs, gstepf(gs, ls, E1, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, E1, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, E1, a).prvHp) ∧ noidRely (tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl, gstepf(gs, ls, E1, a).vs) ∧ nextnottidRely (tid0, gs.vhead, gs.vs, gstepf(gs, ls, E1, a).vhead, gstepf(gs, ls, E1, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, E1, a).owns), subst:[ls, tid0, gs, a] → [ls, tid0, gs, a]

Additional information

Used terms: ls, tid0, gs, a

Proof step 173 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ ls.tid ≠ tid0 ∧ ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, E1, a) ∧ pcstepf(gs, ls, E1, a) = E2 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, E1, a).orl) ∧ gstepf(gs, ls, E1, a).vtail ∈ gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl from gs.vtail ∧ gstepf(gs, ls, E1, a).phead ∈ gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl from gs.phead ∧ gstepf(gs, ls, E1, a).vhead ∈ gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, E1, a).vs, gstepf(gs, ls, E1, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, E1, a).vs, gstepf(gs, ls, E1, a).ps, gstepf(gs, ls, E1, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, E1, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, E1, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, E1, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, E1, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, E1, a).vretRefs, gstepf(gs, ls, E1, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, E1, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, E1, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl, gstepf(gs, ls, E1, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, E1, a).vhead, gstepf(gs, ls, E1, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, E1, a).owns)

Lemma rely-E1-E2

Proof step 174 from proof copied-rely-DMSQLInv (previous step) (back to tree)

success0 ↔ false, a = chooseE1(node0, nd0, success0), gs0 = gstepf(gs, ls, E1, a), ls0 = lstepf(gs, ls, E1, a), pc0 = pcstepf(gs, ls, E1, a), ls.tid ≠ tid0, node0 ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, E1), ¬ DMSQRely(gs, tid0, gs0), ¬ node0 ∈ gs.ps, ¬ node0 ∈ gs.vs, ls.tid ≠ tid0 ∧ ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, E1, a) ∧ pcstepf(gs, ls, E1, a) = E2 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, E1, a).orl) ∧ gstepf(gs, ls, E1, a).vtail ∈ gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl from gs.vtail ∧ gstepf(gs, ls, E1, a).phead ∈ gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl from gs.phead ∧ gstepf(gs, ls, E1, a).vhead ∈ gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, E1, a).vs, gstepf(gs, ls, E1, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, E1, a).vs, gstepf(gs, ls, E1, a).ps, gstepf(gs, ls, E1, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, E1, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, E1, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, E1, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, E1, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, E1, a).vretRefs, gstepf(gs, ls, E1, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, E1, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, E1, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl, gstepf(gs, ls, E1, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, E1, a).vhead, gstepf(gs, ls, E1, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, E1, a).owns) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 13

Additional information

Proof step 175 from proof copied-rely-DMSQLInv (previous step) (back to tree)

success0 ↔ false, a = chooseE1(node0, nd0, success0), gs0 = gstepf(gs, ls, E1, a), ls0 = lstepf(gs, ls, E1, a), pc0 = pcstepf(gs, ls, E1, a), ls.tid ≠ tid0, node0 ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, E1), ¬ DMSQRely(gs, tid0, gs0), ¬ node0 ∈ gs.ps, ¬ node0 ∈ gs.vs ⊦ ls.tid ≠ tid0 ∧ ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, E1, a) ∧ pcstepf(gs, ls, E1, a) = E2

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQGInv, seq:⊦ DMSQGInv(gs) ↔ 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), subst:[gs] → [gs], <all paths>

Additional information

Used terms: gs

Proof step 176 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ DMSQGInv(gs) ↔ 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)

A spec-lemma

Proof step 177 from proof copied-rely-DMSQLInv (previous step) (back to tree)

success0 ↔ false, a = chooseE1(node0, nd0, success0), dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, E1, a), ls0 = lstepf(gs, ls, E1, a), pc0 = pcstepf(gs, ls, E1, a), gs.orl ≠ [], ls.tid ≠ tid0, node0 ≠ null, DMSQLInv(gs, ls, E1), 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), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ DMSQRely(gs, tid0, gs0), ¬ dups(gs.orl + gs.qrl), ¬ node0 ∈ gs.ps, ¬ node0 ∈ gs.vs, 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.tid ≠ tid0 ∧ ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, E1, a) ∧ pcstepf(gs, ls, E1, a) = E2

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQLInv, seq:⊦ DMSQLInv(gs, ls, pc) ↔ ( pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → ( ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ ( pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ ( pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ ( pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ; gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → 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)) ∧ ( pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ( gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E9 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.nxt = null ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ ( pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → 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)) ∧ ( pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ ( pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) ) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ ( pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) )) ∧ ( pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )), subst:[gs, ls, pc] → [gs, ls, E1], <all paths>

Additional information

Used terms: gs, ls, E1

Proof step 178 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ DMSQLInv(gs, ls, pc) ↔ (pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → (ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ (pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ (pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ (pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ (pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ;gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → 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)) ∧ (pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ (gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ (pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ (pc = E9 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.nxt = null ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ (pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → 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)) ∧ (pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ (pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ (pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns)) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ (pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns))) ∧ (pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)))

A spec-lemma

Proof step 179 from proof copied-rely-DMSQLInv (previous step) (back to tree)

success0 ↔ false, a = chooseE1(node0, nd0, success0), dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, E1, a), ls0 = lstepf(gs, ls, E1, a), pc0 = pcstepf(gs, ls, E1, a), gs.orl ≠ [], ls.tid ≠ tid0, node0 ≠ null, 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), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ DMSQRely(gs, tid0, gs0), ¬ dups(gs.orl + gs.qrl), ¬ node0 ∈ gs.ps, ¬ node0 ∈ gs.vs, 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), E1 = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null, E1 = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null, E1 = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid), E1 = D6 → (ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val)), E1 = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first, E1 = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst, E1 = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next), E1 = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next), E1 = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next), E1 = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null, E1 = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null, E1 = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty, E1 = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null, E1 = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null, E1 = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next, E1 = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val), E1 = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ;gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ), E1 = D21 → 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), E1 = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next, E1 = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref], E1 = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref], E1 = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val)), E1 = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val)), E1 = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ (gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)), E1 = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val), E1 = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val), E1 = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val), E1 = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next, E1 = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val)), E1 = E2 → gs.owns(ls.node) = Some(ls.tid), E1 = E3 → gs.owns(ls.node) = Some(ls.tid), E1 = E5 → gs.owns(ls.node) = Some(ls.tid), E1 = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail), E1 = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst), E1 = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst), E1 = E9 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.nxt = null ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst), E1 = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node), E1 = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node), E1 = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null, E1 = E13 → gs.owns(ls.node) = Some(ls.tid), E1 = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null, E1 = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null, E1 = E16 → gs.owns(ls.node) = Some(ls.tid), E1 = E2 ∨ E1 = E3 ∨ E1 = E5 ∨ E1 = E6 ∨ E1 = E7 ∨ E1 = E8 ∨ E1 = E9 ∨ E1 = E13 ∨ E1 = E14 ∨ E1 = E15 ∨ E1 = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl, E1 = E4 ∨ E1 = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node], E1 = E3 ∨ E1 = E5 ∨ E1 = E6 ∨ E1 = E7 ∨ E1 = E8 ∨ E1 = E9 ∨ E1 = E13 ∨ E1 = E14 ∨ E1 = E15 ∨ E1 = E16 → gs.vs[ls.node] = mk(ls.value, None, null), E1 = E5 ∨ E1 = E6 ∨ E1 = E7 ∨ E1 = E8 ∨ E1 = E9 ∨ E1 = E13 ∨ E1 = E14 ∨ E1 = E15 ∨ E1 = E16 → gs.ps[ls.node] = gs.vs[ls.node], E1 = D7 ∨ E1 = D8 ∨ E1 = D9 ∨ E1 = D10 ∨ E1 = D11 ∨ E1 = D12 ∨ E1 = D16 ∨ E1 = D17 ∨ E1 = D18 ∨ E1 = D19 ∨ E1 = D25 ∨ E1 = D26 ∨ E1 = D27 ∨ E1 = D28 ∨ E1 = D29 ∨ E1 = D30 ∨ E1 = D31 ∨ E1 = D32 ∨ E1 = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid), E1 = D13 ∨ E1 = D14 ∨ E1 = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid), E1 = E2 ∨ E1 = E3 ∨ E1 = E5 ∨ E1 = E6 ∨ E1 = E7 ∨ E1 = E8 ∨ E1 = E9 ∨ E1 = E13 ∨ E1 = E14 ∨ E1 = E15 ∨ E1 = E16 → ¬ ls.success, E1 = D8 ∨ E1 = D9 ∨ E1 = D10 ∨ E1 = D11 ∨ E1 = D12 ∨ E1 = D13 ∨ E1 = D14 ∨ E1 = D15 ∨ E1 = D18 ∨ E1 = D19 ∨ E1 = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first, E1 = D18 ∨ E1 = D19 ∨ E1 = D20 ∨ E1 = D21 ∨ E1 = D22 ∨ E1 = D23 ∨ E1 = D24 ∨ E1 = D25 ∨ E1 = D26 ∨ E1 = D27 ∨ E1 = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst, E1 = D9 ∨ E1 = D10 ∨ E1 = D11 ∨ E1 = D18 ∨ E1 = D19 ∨ E1 = D20 ∨ E1 = D21 ∨ E1 = D22 ∨ E1 = D23 ∨ E1 = D24 ∨ E1 = D25 ∨ E1 = D26 ∨ E1 = D27 ∨ E1 = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first, E1 = D5 ∨ E1 = D6 ∨ E1 = D7 ∨ E1 = D8 ∨ E1 = D9 ∨ E1 = D10 ∨ E1 = D11 ∨ E1 = D12 ∨ E1 = D13 ∨ E1 = D14 ∨ E1 = D15 ∨ E1 = D16 ∨ E1 = D17 ∨ E1 = D18 ∨ E1 = D19 ∨ E1 = D20 ∨ E1 = D21 ∨ E1 = D22 ∨ E1 = D23 ∨ E1 = D24 ∨ E1 = D25 ∨ E1 = D26 ∨ E1 = D27 ∨ E1 = D28 ∨ E1 = D29 ∨ E1 = D30 ∨ E1 = D31 ∨ E1 = D32 ∨ E1 = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null, E1 = D21 ∨ E1 = D22 ∨ E1 = D23 ∨ E1 = D24 → 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), E1 = D27 ∨ E1 = D28 ∨ E1 = D29 ∨ E1 = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val), E1 = idle ∨ E1 = ready ∨ E1 = E1 ∨ E1 = E2 ∨ E1 = E3 ∨ E1 = E4 ∨ E1 = E5 ∨ E1 = E6 ∨ E1 = E7 ∨ E1 = E8 ∨ E1 = E9 ∨ E1 = E10 ∨ E1 = E11 ∨ E1 = E12 ∨ E1 = E13 ∨ E1 = E14 ∨ E1 = E15 ∨ E1 = E16 ∨ E1 = E17 ∨ E1 = D1 ∨ E1 = D2 ∨ E1 = D3 ∨ E1 = D4 ∨ E1 = D5 ∨ E1 = D6 ∨ E1 = D7 ∨ E1 = D8 ∨ E1 = D9 ∨ E1 = D10 ∨ E1 = D11 ∨ E1 = D12 ∨ E1 = D13 ∨ E1 = D14 ∨ E1 = D15 ∨ E1 = D16 ∨ E1 = D17 ∨ E1 = D18 ∨ E1 = D19 ∨ E1 = D25 ∨ E1 = D26 ∨ E1 = D27 ∨ E1 = D28 ∨ E1 = D29 ∨ E1 = D30 ∨ E1 = D31 ∨ E1 = D32 ∨ E1 = D33 ∨ E1 = D34 → nextnottid(ls.tid, gs.vhead, gs.vs), E1 = D20 ∨ E1 = D21 ∨ E1 = D22 ∨ E1 = D23 ∨ E1 = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs), E1 = crashed ∨ E1 = idle ∨ E1 = ready ∨ E1 = E1 ∨ E1 = E2 ∨ E1 = E3 ∨ E1 = E4 ∨ E1 = E5 ∨ E1 = E6 ∨ E1 = E7 ∨ E1 = E8 ∨ E1 = E9 ∨ E1 = E10 ∨ E1 = E11 ∨ E1 = E12 ∨ E1 = E13 ∨ E1 = E14 ∨ E1 = E15 ∨ E1 = E16 ∨ E1 = E17 ∨ E1 = D1 ∨ E1 = D2 ∨ E1 = D3 ∨ E1 = D4 ∨ E1 = D5 ∨ E1 = D6 ∨ E1 = D7 ∨ E1 = D16 ∨ E1 = D17 ∨ E1 = D25 ∨ E1 = D26 ∨ E1 = D27 ∨ E1 = D28 ∨ E1 = D29 ∨ E1 = D30 ∨ E1 = D31 ∨ E1 = D32 ∨ E1 = D33 ∨ E1 = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), E1 = D8 ∨ E1 = D9 ∨ E1 = D10 ∨ E1 = D11 ∨ E1 = D12 ∨ E1 = D13 ∨ E1 = D14 ∨ E1 = D15 ∨ E1 = D18 ∨ E1 = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs), E1 = D22 ∨ E1 = D23 ∨ E1 = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs), E1 = crashed ∨ E1 = idle ∨ E1 = ready ∨ E1 = D1 ∨ E1 = D2 ∨ E1 = D3 ∨ E1 = D4 ∨ E1 = D5 ∨ E1 = D6 ∨ E1 = D7 ∨ E1 = D8 ∨ E1 = D9 ∨ E1 = D10 ∨ E1 = D11 ∨ E1 = D12 ∨ E1 = D13 ∨ E1 = D14 ∨ E1 = D15 ∨ E1 = D16 ∨ E1 = D17 ∨ E1 = D18 ∨ E1 = D19 ∨ E1 = D20 ∨ E1 = D21 ∨ E1 = D22 ∨ E1 = D23 ∨ E1 = D24 ∨ E1 = D25 ∨ E1 = D26 ∨ E1 = D27 ∨ E1 = D28 ∨ E1 = D29 ∨ E1 = D30 ∨ E1 = D31 ∨ E1 = D32 ∨ E1 = D33 ∨ E1 = D34 ∨ E1 = E1 ∨ E1 = E12 ∨ E1 = E17 → noowns(ls.tid, gs.owns), E1 = E2 ∨ E1 = E3 ∨ E1 = E5 ∨ E1 = E6 ∨ E1 = E7 ∨ E1 = E8 ∨ E1 = E9 ∨ E1 = E13 ∨ E1 = E14 ∨ E1 = E15 ∨ E1 = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps), E1 = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns)) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ), E1 = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns)), E1 = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)), 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, 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) ⊦ ls.tid ≠ tid0 ∧ ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, E1, a) ∧ pcstepf(gs, ls, E1, a) = E2

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Used simplifier rules: ⊦ gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)) = ( ( gs .ps:= gs.ps [(((ls.node:= node0).nd:= nd0).success:= success0 ).node, (((ls.node:= node0).nd:= nd0).success:= success0).nd ]) .vs:= gs.vs [(((ls.node:= node0).nd:= nd0).success:= success0).node, (((ls.node:= node0).nd:= nd0).success:= success0).nd ]) .owns:= gs.owns ((((ls.node:= node0).nd:= nd0).success:= success0).node ; Some((((ls.node:= node0).nd:= nd0).success:= success0).tid) ); (s) ⊦ (ls.success:= success).nd = ls.nd; (s) ⊦ (ls.nd:= nd).nd = nd; (s) ⊦ (ls.success:= success).node = ls.node; (s) ⊦ (ls.nd:= nd).node = ls.node; (s) ⊦ (ls.node:= node).node = node; (s) ⊦ (ls.success:= success).tid = ls.tid; (s) ⊦ (ls.nd:= nd).tid = ls.tid; (s) ⊦ (ls.node:= node).tid = ls.tid; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ E1 ≠ E11; (s) ⊦ E1 ≠ E12; (s) ⊦ E1 ≠ E4; (s) ⊦ E1 ≠ E10; (s) ⊦ E1 ≠ E2; (s) ⊦ E1 ≠ E3; (s) ⊦ E1 ≠ E5; (s) ⊦ E1 ≠ E6; (s) ⊦ E1 ≠ E7; (s) ⊦ E1 ≠ E8; (s) ⊦ E1 ≠ E9; (s) ⊦ E1 ≠ E13; (s) ⊦ E1 ≠ E14; (s) ⊦ E1 ≠ E15; (s) ⊦ E1 ≠ E16; (s) ⊦ E1 ≠ crashed; (s) ⊦ E1 ≠ idle; (s) ⊦ E1 ≠ ready; (s) ⊦ D1 ≠ E1; (s) ⊦ D2 ≠ E1; (s) ⊦ D3 ≠ E1; (s) ⊦ D4 ≠ E1; (s) ⊦ D5 ≠ E1; (s) ⊦ D6 ≠ E1; (s) ⊦ D7 ≠ E1; (s) ⊦ D8 ≠ E1; (s) ⊦ D9 ≠ E1; (s) ⊦ D10 ≠ E1; (s) ⊦ D11 ≠ E1; (s) ⊦ D12 ≠ E1; (s) ⊦ D13 ≠ E1; (s) ⊦ D14 ≠ E1; (s) ⊦ D15 ≠ E1; (s) ⊦ D16 ≠ E1; (s) ⊦ D17 ≠ E1; (s) ⊦ D18 ≠ E1; (s) ⊦ D19 ≠ E1; (s) ⊦ D20 ≠ E1; (s) ⊦ D21 ≠ E1; (s) ⊦ D22 ≠ E1; (s) ⊦ D23 ≠ E1; (s) ⊦ D24 ≠ E1; (s) ⊦ D25 ≠ E1; (s) ⊦ D26 ≠ E1; (s) ⊦ D27 ≠ E1; (s) ⊦ D28 ≠ E1; (s) ⊦ D29 ≠ E1; (s) ⊦ D30 ≠ E1; (s) ⊦ D31 ≠ E1; (s) ⊦ D32 ≠ E1; (s) ⊦ D33 ≠ E1; (s) ⊦ D34 ≠ E1; (s)

Proof step 180 from proof copied-rely-DMSQLInv (previous step) (back to tree)

success0 ↔ false, a = chooseE1(node0, nd0, success0), dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, E1, a), ls0 = lstepf(gs, ls, E1, a), pc0 = pcstepf(gs, ls, E1, a), gs.orl ≠ [], ls.tid ≠ tid0, node0 ≠ null, 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), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ DMSQRely(gs, tid0, gs0), ¬ dups(gs.orl + gs.qrl), ¬ pre(gs, ls, E1, a), ¬ node0 ∈ gs.ps, ¬ node0 ∈ gs.vs, E1 = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)), E1 = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns)), E1 = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns)) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ), E1 = E2 ∨ E1 = E3 ∨ E1 = E5 ∨ E1 = E6 ∨ E1 = E7 ∨ E1 = E8 ∨ E1 = E9 ∨ E1 = E13 ∨ E1 = E14 ∨ E1 = E15 ∨ E1 = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps), E1 = crashed ∨ E1 = idle ∨ E1 = ready ∨ E1 = D1 ∨ E1 = D2 ∨ E1 = D3 ∨ E1 = D4 ∨ E1 = D5 ∨ E1 = D6 ∨ E1 = D7 ∨ E1 = D8 ∨ E1 = D9 ∨ E1 = D10 ∨ E1 = D11 ∨ E1 = D12 ∨ E1 = D13 ∨ E1 = D14 ∨ E1 = D15 ∨ E1 = D16 ∨ E1 = D17 ∨ E1 = D18 ∨ E1 = D19 ∨ E1 = D20 ∨ E1 = D21 ∨ E1 = D22 ∨ E1 = D23 ∨ E1 = D24 ∨ E1 = D25 ∨ E1 = D26 ∨ E1 = D27 ∨ E1 = D28 ∨ E1 = D29 ∨ E1 = D30 ∨ E1 = D31 ∨ E1 = D32 ∨ E1 = D33 ∨ E1 = D34 ∨ E1 = E1 ∨ E1 = E12 ∨ E1 = E17 → noowns(ls.tid, gs.owns), E1 = D22 ∨ E1 = D23 ∨ E1 = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs), E1 = D8 ∨ E1 = D9 ∨ E1 = D10 ∨ E1 = D11 ∨ E1 = D12 ∨ E1 = D13 ∨ E1 = D14 ∨ E1 = D15 ∨ E1 = D18 ∨ E1 = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs), E1 = crashed ∨ E1 = idle ∨ E1 = ready ∨ E1 = E1 ∨ E1 = E2 ∨ E1 = E3 ∨ E1 = E4 ∨ E1 = E5 ∨ E1 = E6 ∨ E1 = E7 ∨ E1 = E8 ∨ E1 = E9 ∨ E1 = E10 ∨ E1 = E11 ∨ E1 = E12 ∨ E1 = E13 ∨ E1 = E14 ∨ E1 = E15 ∨ E1 = E16 ∨ E1 = E17 ∨ E1 = D1 ∨ E1 = D2 ∨ E1 = D3 ∨ E1 = D4 ∨ E1 = D5 ∨ E1 = D6 ∨ E1 = D7 ∨ E1 = D16 ∨ E1 = D17 ∨ E1 = D25 ∨ E1 = D26 ∨ E1 = D27 ∨ E1 = D28 ∨ E1 = D29 ∨ E1 = D30 ∨ E1 = D31 ∨ E1 = D32 ∨ E1 = D33 ∨ E1 = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), E1 = D20 ∨ E1 = D21 ∨ E1 = D22 ∨ E1 = D23 ∨ E1 = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs), E1 = idle ∨ E1 = ready ∨ E1 = E1 ∨ E1 = E2 ∨ E1 = E3 ∨ E1 = E4 ∨ E1 = E5 ∨ E1 = E6 ∨ E1 = E7 ∨ E1 = E8 ∨ E1 = E9 ∨ E1 = E10 ∨ E1 = E11 ∨ E1 = E12 ∨ E1 = E13 ∨ E1 = E14 ∨ E1 = E15 ∨ E1 = E16 ∨ E1 = E17 ∨ E1 = D1 ∨ E1 = D2 ∨ E1 = D3 ∨ E1 = D4 ∨ E1 = D5 ∨ E1 = D6 ∨ E1 = D7 ∨ E1 = D8 ∨ E1 = D9 ∨ E1 = D10 ∨ E1 = D11 ∨ E1 = D12 ∨ E1 = D13 ∨ E1 = D14 ∨ E1 = D15 ∨ E1 = D16 ∨ E1 = D17 ∨ E1 = D18 ∨ E1 = D19 ∨ E1 = D25 ∨ E1 = D26 ∨ E1 = D27 ∨ E1 = D28 ∨ E1 = D29 ∨ E1 = D30 ∨ E1 = D31 ∨ E1 = D32 ∨ E1 = D33 ∨ E1 = D34 → nextnottid(ls.tid, gs.vhead, gs.vs), E1 = D27 ∨ E1 = D28 ∨ E1 = D29 ∨ E1 = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val), E1 = D21 ∨ E1 = D22 ∨ E1 = D23 ∨ E1 = D24 → 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), E1 = D5 ∨ E1 = D6 ∨ E1 = D7 ∨ E1 = D8 ∨ E1 = D9 ∨ E1 = D10 ∨ E1 = D11 ∨ E1 = D12 ∨ E1 = D13 ∨ E1 = D14 ∨ E1 = D15 ∨ E1 = D16 ∨ E1 = D17 ∨ E1 = D18 ∨ E1 = D19 ∨ E1 = D20 ∨ E1 = D21 ∨ E1 = D22 ∨ E1 = D23 ∨ E1 = D24 ∨ E1 = D25 ∨ E1 = D26 ∨ E1 = D27 ∨ E1 = D28 ∨ E1 = D29 ∨ E1 = D30 ∨ E1 = D31 ∨ E1 = D32 ∨ E1 = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null, E1 = D9 ∨ E1 = D10 ∨ E1 = D11 ∨ E1 = D18 ∨ E1 = D19 ∨ E1 = D20 ∨ E1 = D21 ∨ E1 = D22 ∨ E1 = D23 ∨ E1 = D24 ∨ E1 = D25 ∨ E1 = D26 ∨ E1 = D27 ∨ E1 = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first, E1 = D18 ∨ E1 = D19 ∨ E1 = D20 ∨ E1 = D21 ∨ E1 = D22 ∨ E1 = D23 ∨ E1 = D24 ∨ E1 = D25 ∨ E1 = D26 ∨ E1 = D27 ∨ E1 = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst, E1 = D8 ∨ E1 = D9 ∨ E1 = D10 ∨ E1 = D11 ∨ E1 = D12 ∨ E1 = D13 ∨ E1 = D14 ∨ E1 = D15 ∨ E1 = D18 ∨ E1 = D19 ∨ E1 = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first, E1 = E2 ∨ E1 = E3 ∨ E1 = E5 ∨ E1 = E6 ∨ E1 = E7 ∨ E1 = E8 ∨ E1 = E9 ∨ E1 = E13 ∨ E1 = E14 ∨ E1 = E15 ∨ E1 = E16 → ¬ ls.success, E1 = D13 ∨ E1 = D14 ∨ E1 = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid), E1 = D7 ∨ E1 = D8 ∨ E1 = D9 ∨ E1 = D10 ∨ E1 = D11 ∨ E1 = D12 ∨ E1 = D16 ∨ E1 = D17 ∨ E1 = D18 ∨ E1 = D19 ∨ E1 = D25 ∨ E1 = D26 ∨ E1 = D27 ∨ E1 = D28 ∨ E1 = D29 ∨ E1 = D30 ∨ E1 = D31 ∨ E1 = D32 ∨ E1 = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid), E1 = E5 ∨ E1 = E6 ∨ E1 = E7 ∨ E1 = E8 ∨ E1 = E9 ∨ E1 = E13 ∨ E1 = E14 ∨ E1 = E15 ∨ E1 = E16 → gs.ps[ls.node] = gs.vs[ls.node], E1 = E3 ∨ E1 = E5 ∨ E1 = E6 ∨ E1 = E7 ∨ E1 = E8 ∨ E1 = E9 ∨ E1 = E13 ∨ E1 = E14 ∨ E1 = E15 ∨ E1 = E16 → gs.vs[ls.node] = mk(ls.value, None, null), E1 = E4 ∨ E1 = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node], E1 = E2 ∨ E1 = E3 ∨ E1 = E5 ∨ E1 = E6 ∨ E1 = E7 ∨ E1 = E8 ∨ E1 = E9 ∨ E1 = E13 ∨ E1 = E14 ∨ E1 = E15 ∨ E1 = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl, E1 = E16 → gs.owns(ls.node) = Some(ls.tid), E1 = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null, E1 = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null, E1 = E13 → gs.owns(ls.node) = Some(ls.tid), E1 = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null, E1 = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node), E1 = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node), E1 = E9 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.nxt = null ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst), E1 = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst), E1 = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst), E1 = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail), E1 = E5 → gs.owns(ls.node) = Some(ls.tid), E1 = E3 → gs.owns(ls.node) = Some(ls.tid), E1 = E2 → gs.owns(ls.node) = Some(ls.tid), E1 = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val)), E1 = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next, E1 = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val), E1 = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val), E1 = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val), E1 = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ (gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)), E1 = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val)), E1 = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val)), E1 = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref], E1 = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref], E1 = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next, E1 = D21 → 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), E1 = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ;gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ), E1 = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val), E1 = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next, E1 = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null, E1 = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null, E1 = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty, E1 = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null, E1 = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null, E1 = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next), E1 = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next), E1 = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next), E1 = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst, E1 = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first, E1 = D6 → (ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val)), E1 = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid), E1 = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null, E1 = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null, 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 ⊦

User 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 ⊦ E1 ≠ E4; (s) ⊦ E1 ≠ E11; (s) ⊦ E1 ≠ E10; (s) ⊦ E1 ≠ E16; (s) ⊦ E1 ≠ E15; (s) ⊦ E1 ≠ E14; (s) ⊦ E1 ≠ E13; (s) ⊦ E1 ≠ E9; (s) ⊦ E1 ≠ E8; (s) ⊦ E1 ≠ E7; (s) ⊦ E1 ≠ E6; (s) ⊦ E1 ≠ E5; (s) ⊦ E1 ≠ E3; (s) ⊦ E1 ≠ E2; (s) ⊦ D34 ≠ E1; (s) ⊦ D33 ≠ E1; (s) ⊦ D32 ≠ E1; (s) ⊦ D31 ≠ E1; (s) ⊦ D30 ≠ E1; (s) ⊦ D29 ≠ E1; (s) ⊦ D28 ≠ E1; (s) ⊦ D27 ≠ E1; (s) ⊦ D26 ≠ E1; (s) ⊦ D25 ≠ E1; (s) ⊦ D24 ≠ E1; (s) ⊦ D23 ≠ E1; (s) ⊦ D22 ≠ E1; (s) ⊦ D21 ≠ E1; (s) ⊦ D20 ≠ E1; (s) ⊦ D19 ≠ E1; (s) ⊦ D18 ≠ E1; (s) ⊦ D17 ≠ E1; (s) ⊦ D16 ≠ E1; (s) ⊦ D15 ≠ E1; (s) ⊦ D14 ≠ E1; (s) ⊦ D13 ≠ E1; (s) ⊦ D12 ≠ E1; (s) ⊦ D11 ≠ E1; (s) ⊦ D10 ≠ E1; (s) ⊦ D9 ≠ E1; (s) ⊦ D8 ≠ E1; (s) ⊦ D7 ≠ E1; (s) ⊦ D6 ≠ E1; (s) ⊦ D5 ≠ E1; (s) ⊦ D4 ≠ E1; (s) ⊦ D3 ≠ E1; (s) ⊦ D2 ≠ E1; (s) ⊦ D1 ≠ E1; (s) ⊦ E1 ≠ ready; (s) ⊦ E1 ≠ idle; (s) ⊦ E1 ≠ crashed; (s) ⊦ E1 ≠ E12; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ chooseE1(node, nd, success) ≠ τ; (s) ⊦ pre(gs, ls, E1, a) ↔ (∃ node0, nd0, success0. ( ¬ node0 ∈ gs.vs ∧ ¬ node0 ∈ gs.ps ∧ node0 ≠ null ∧ (success0 ↔ false)) ∧ a = chooseE1(node0, nd0, success0)) ∨ a = τ ∧ ¬ (∃ node0, nd0, success0. ¬ node0 ∈ gs.vs ∧ ¬ node0 ∈ gs.ps ∧ node0 ≠ null ∧ (success0 ↔ false)); (s) ⊦ (ls.node:= node).tid = ls.tid; (s) ⊦ (ls.nd:= nd).tid = ls.tid; (s) ⊦ (ls.success:= success).tid = ls.tid; (s) ⊦ (ls.node:= node).node = node; (s) ⊦ (ls.nd:= nd).node = ls.node; (s) ⊦ (ls.success:= success).node = ls.node; (s) ⊦ (ls.nd:= nd).nd = nd; (s) ⊦ (ls.success:= success).nd = ls.nd; (s) ⊦ gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)) = ( ( gs .ps:= gs.ps [(((ls.node:= node0).nd:= nd0).success:= success0 ).node, (((ls.node:= node0).nd:= nd0).success:= success0).nd ]) .vs:= gs.vs [(((ls.node:= node0).nd:= nd0).success:= success0).node, (((ls.node:= node0).nd:= nd0).success:= success0).nd ]) .owns:= gs.owns ((((ls.node:= node0).nd:= nd0).success:= success0).node ; Some((((ls.node:= node0).nd:= nd0).success:= success0).tid) ); (s)

Proof step 181 from proof copied-rely-DMSQLInv (previous step) (back to tree)

dom gs.vrvHp = dom gs.prvHp, gs.orl ≠ [], ls.tid ≠ tid0, node0 ≠ null, 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), noowns(ls.tid, gs.owns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, gs.phead ∈ gs.vs, gs.phead ∈ gs.ps, ¬ DMSQRely(gs, tid0, ((gs.ps:= gs.ps[node0, nd0]).vs:= gs.vs[node0, nd0]).owns:= gs.owns(node0; Some(ls.tid))), ¬ dups(gs.orl + gs.qrl), ¬ dups(gs.orl), ¬ dups(gs.qrl), ¬ node0 ∈ gs.ps, ¬ node0 ∈ gs.vs, 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.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, 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) ⊦ ∃ node, nd. ¬ node ∈ gs.vs ∧ ¬ node ∈ gs.ps ∧ node ≠ null ∧ chooseE1(node0, nd0, false) = chooseE1(node, nd, false)

User applied rule exists right

And closed the goal!

Rule argument

pos: right 1 terms: node0, nd0 abort: F discard: T computed: T

Additional information

Used terms: node0, nd0

Proof step 182 from proof copied-rely-DMSQLInv (previous step) (back to tree)

success0 ↔ false, a = chooseE1(node0, nd0, success0), dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, E1, a), ls0 = lstepf(gs, ls, E1, a), pc0 = pcstepf(gs, ls, E1, a), gs.orl ≠ [], ls.tid ≠ tid0, node0 ≠ null, pcstepf(gs, ls, E1, a) ≠ E2, 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), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ DMSQRely(gs, tid0, gs0), ¬ dups(gs.orl + gs.qrl), ¬ node0 ∈ gs.ps, ¬ node0 ∈ gs.vs, E1 = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)), E1 = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns)), E1 = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns)) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ), E1 = E2 ∨ E1 = E3 ∨ E1 = E5 ∨ E1 = E6 ∨ E1 = E7 ∨ E1 = E8 ∨ E1 = E9 ∨ E1 = E13 ∨ E1 = E14 ∨ E1 = E15 ∨ E1 = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps), E1 = crashed ∨ E1 = idle ∨ E1 = ready ∨ E1 = D1 ∨ E1 = D2 ∨ E1 = D3 ∨ E1 = D4 ∨ E1 = D5 ∨ E1 = D6 ∨ E1 = D7 ∨ E1 = D8 ∨ E1 = D9 ∨ E1 = D10 ∨ E1 = D11 ∨ E1 = D12 ∨ E1 = D13 ∨ E1 = D14 ∨ E1 = D15 ∨ E1 = D16 ∨ E1 = D17 ∨ E1 = D18 ∨ E1 = D19 ∨ E1 = D20 ∨ E1 = D21 ∨ E1 = D22 ∨ E1 = D23 ∨ E1 = D24 ∨ E1 = D25 ∨ E1 = D26 ∨ E1 = D27 ∨ E1 = D28 ∨ E1 = D29 ∨ E1 = D30 ∨ E1 = D31 ∨ E1 = D32 ∨ E1 = D33 ∨ E1 = D34 ∨ E1 = E1 ∨ E1 = E12 ∨ E1 = E17 → noowns(ls.tid, gs.owns), E1 = D22 ∨ E1 = D23 ∨ E1 = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs), E1 = D8 ∨ E1 = D9 ∨ E1 = D10 ∨ E1 = D11 ∨ E1 = D12 ∨ E1 = D13 ∨ E1 = D14 ∨ E1 = D15 ∨ E1 = D18 ∨ E1 = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs), E1 = crashed ∨ E1 = idle ∨ E1 = ready ∨ E1 = E1 ∨ E1 = E2 ∨ E1 = E3 ∨ E1 = E4 ∨ E1 = E5 ∨ E1 = E6 ∨ E1 = E7 ∨ E1 = E8 ∨ E1 = E9 ∨ E1 = E10 ∨ E1 = E11 ∨ E1 = E12 ∨ E1 = E13 ∨ E1 = E14 ∨ E1 = E15 ∨ E1 = E16 ∨ E1 = E17 ∨ E1 = D1 ∨ E1 = D2 ∨ E1 = D3 ∨ E1 = D4 ∨ E1 = D5 ∨ E1 = D6 ∨ E1 = D7 ∨ E1 = D16 ∨ E1 = D17 ∨ E1 = D25 ∨ E1 = D26 ∨ E1 = D27 ∨ E1 = D28 ∨ E1 = D29 ∨ E1 = D30 ∨ E1 = D31 ∨ E1 = D32 ∨ E1 = D33 ∨ E1 = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), E1 = D20 ∨ E1 = D21 ∨ E1 = D22 ∨ E1 = D23 ∨ E1 = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs), E1 = idle ∨ E1 = ready ∨ E1 = E1 ∨ E1 = E2 ∨ E1 = E3 ∨ E1 = E4 ∨ E1 = E5 ∨ E1 = E6 ∨ E1 = E7 ∨ E1 = E8 ∨ E1 = E9 ∨ E1 = E10 ∨ E1 = E11 ∨ E1 = E12 ∨ E1 = E13 ∨ E1 = E14 ∨ E1 = E15 ∨ E1 = E16 ∨ E1 = E17 ∨ E1 = D1 ∨ E1 = D2 ∨ E1 = D3 ∨ E1 = D4 ∨ E1 = D5 ∨ E1 = D6 ∨ E1 = D7 ∨ E1 = D8 ∨ E1 = D9 ∨ E1 = D10 ∨ E1 = D11 ∨ E1 = D12 ∨ E1 = D13 ∨ E1 = D14 ∨ E1 = D15 ∨ E1 = D16 ∨ E1 = D17 ∨ E1 = D18 ∨ E1 = D19 ∨ E1 = D25 ∨ E1 = D26 ∨ E1 = D27 ∨ E1 = D28 ∨ E1 = D29 ∨ E1 = D30 ∨ E1 = D31 ∨ E1 = D32 ∨ E1 = D33 ∨ E1 = D34 → nextnottid(ls.tid, gs.vhead, gs.vs), E1 = D27 ∨ E1 = D28 ∨ E1 = D29 ∨ E1 = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val), E1 = D21 ∨ E1 = D22 ∨ E1 = D23 ∨ E1 = D24 → 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), E1 = D5 ∨ E1 = D6 ∨ E1 = D7 ∨ E1 = D8 ∨ E1 = D9 ∨ E1 = D10 ∨ E1 = D11 ∨ E1 = D12 ∨ E1 = D13 ∨ E1 = D14 ∨ E1 = D15 ∨ E1 = D16 ∨ E1 = D17 ∨ E1 = D18 ∨ E1 = D19 ∨ E1 = D20 ∨ E1 = D21 ∨ E1 = D22 ∨ E1 = D23 ∨ E1 = D24 ∨ E1 = D25 ∨ E1 = D26 ∨ E1 = D27 ∨ E1 = D28 ∨ E1 = D29 ∨ E1 = D30 ∨ E1 = D31 ∨ E1 = D32 ∨ E1 = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null, E1 = D9 ∨ E1 = D10 ∨ E1 = D11 ∨ E1 = D18 ∨ E1 = D19 ∨ E1 = D20 ∨ E1 = D21 ∨ E1 = D22 ∨ E1 = D23 ∨ E1 = D24 ∨ E1 = D25 ∨ E1 = D26 ∨ E1 = D27 ∨ E1 = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first, E1 = D18 ∨ E1 = D19 ∨ E1 = D20 ∨ E1 = D21 ∨ E1 = D22 ∨ E1 = D23 ∨ E1 = D24 ∨ E1 = D25 ∨ E1 = D26 ∨ E1 = D27 ∨ E1 = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst, E1 = D8 ∨ E1 = D9 ∨ E1 = D10 ∨ E1 = D11 ∨ E1 = D12 ∨ E1 = D13 ∨ E1 = D14 ∨ E1 = D15 ∨ E1 = D18 ∨ E1 = D19 ∨ E1 = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first, E1 = E2 ∨ E1 = E3 ∨ E1 = E5 ∨ E1 = E6 ∨ E1 = E7 ∨ E1 = E8 ∨ E1 = E9 ∨ E1 = E13 ∨ E1 = E14 ∨ E1 = E15 ∨ E1 = E16 → ¬ ls.success, E1 = D13 ∨ E1 = D14 ∨ E1 = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid), E1 = D7 ∨ E1 = D8 ∨ E1 = D9 ∨ E1 = D10 ∨ E1 = D11 ∨ E1 = D12 ∨ E1 = D16 ∨ E1 = D17 ∨ E1 = D18 ∨ E1 = D19 ∨ E1 = D25 ∨ E1 = D26 ∨ E1 = D27 ∨ E1 = D28 ∨ E1 = D29 ∨ E1 = D30 ∨ E1 = D31 ∨ E1 = D32 ∨ E1 = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid), E1 = E5 ∨ E1 = E6 ∨ E1 = E7 ∨ E1 = E8 ∨ E1 = E9 ∨ E1 = E13 ∨ E1 = E14 ∨ E1 = E15 ∨ E1 = E16 → gs.ps[ls.node] = gs.vs[ls.node], E1 = E3 ∨ E1 = E5 ∨ E1 = E6 ∨ E1 = E7 ∨ E1 = E8 ∨ E1 = E9 ∨ E1 = E13 ∨ E1 = E14 ∨ E1 = E15 ∨ E1 = E16 → gs.vs[ls.node] = mk(ls.value, None, null), E1 = E4 ∨ E1 = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node], E1 = E2 ∨ E1 = E3 ∨ E1 = E5 ∨ E1 = E6 ∨ E1 = E7 ∨ E1 = E8 ∨ E1 = E9 ∨ E1 = E13 ∨ E1 = E14 ∨ E1 = E15 ∨ E1 = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl, E1 = E16 → gs.owns(ls.node) = Some(ls.tid), E1 = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null, E1 = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null, E1 = E13 → gs.owns(ls.node) = Some(ls.tid), E1 = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null, E1 = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node), E1 = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node), E1 = E9 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.nxt = null ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst), E1 = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst), E1 = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst), E1 = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail), E1 = E5 → gs.owns(ls.node) = Some(ls.tid), E1 = E3 → gs.owns(ls.node) = Some(ls.tid), E1 = E2 → gs.owns(ls.node) = Some(ls.tid), E1 = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val)), E1 = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next, E1 = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val), E1 = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val), E1 = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val), E1 = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ (gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)), E1 = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val)), E1 = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val)), E1 = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref], E1 = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref], E1 = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next, E1 = D21 → 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), E1 = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ;gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ), E1 = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val), E1 = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next, E1 = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null, E1 = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null, E1 = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty, E1 = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null, E1 = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null, E1 = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next), E1 = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next), E1 = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next), E1 = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst, E1 = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first, E1 = D6 → (ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val)), E1 = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid), E1 = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null, E1 = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null, 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 ⊦

User 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 ⊦ E1 ≠ E4; (s) ⊦ E1 ≠ E11; (s) ⊦ E1 ≠ E10; (s) ⊦ E1 ≠ E16; (s) ⊦ E1 ≠ E15; (s) ⊦ E1 ≠ E14; (s) ⊦ E1 ≠ E13; (s) ⊦ E1 ≠ E9; (s) ⊦ E1 ≠ E8; (s) ⊦ E1 ≠ E7; (s) ⊦ E1 ≠ E6; (s) ⊦ E1 ≠ E5; (s) ⊦ E1 ≠ E3; (s) ⊦ E1 ≠ E2; (s) ⊦ D34 ≠ E1; (s) ⊦ D33 ≠ E1; (s) ⊦ D32 ≠ E1; (s) ⊦ D31 ≠ E1; (s) ⊦ D30 ≠ E1; (s) ⊦ D29 ≠ E1; (s) ⊦ D28 ≠ E1; (s) ⊦ D27 ≠ E1; (s) ⊦ D26 ≠ E1; (s) ⊦ D25 ≠ E1; (s) ⊦ D24 ≠ E1; (s) ⊦ D23 ≠ E1; (s) ⊦ D22 ≠ E1; (s) ⊦ D21 ≠ E1; (s) ⊦ D20 ≠ E1; (s) ⊦ D19 ≠ E1; (s) ⊦ D18 ≠ E1; (s) ⊦ D17 ≠ E1; (s) ⊦ D16 ≠ E1; (s) ⊦ D15 ≠ E1; (s) ⊦ D14 ≠ E1; (s) ⊦ D13 ≠ E1; (s) ⊦ D12 ≠ E1; (s) ⊦ D11 ≠ E1; (s) ⊦ D10 ≠ E1; (s) ⊦ D9 ≠ E1; (s) ⊦ D8 ≠ E1; (s) ⊦ D7 ≠ E1; (s) ⊦ D6 ≠ E1; (s) ⊦ D5 ≠ E1; (s) ⊦ D4 ≠ E1; (s) ⊦ D3 ≠ E1; (s) ⊦ D2 ≠ E1; (s) ⊦ D1 ≠ E1; (s) ⊦ E1 ≠ ready; (s) ⊦ E1 ≠ idle; (s) ⊦ E1 ≠ crashed; (s) ⊦ E1 ≠ E12; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ (ls.node:= node).tid = ls.tid; (s) ⊦ (ls.nd:= nd).tid = ls.tid; (s) ⊦ (ls.success:= success).tid = ls.tid; (s) ⊦ (ls.node:= node).node = node; (s) ⊦ (ls.nd:= nd).node = ls.node; (s) ⊦ (ls.success:= success).node = ls.node; (s) ⊦ (ls.nd:= nd).nd = nd; (s) ⊦ (ls.success:= success).nd = ls.nd; (s) ⊦ gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)) = ( ( gs .ps:= gs.ps [(((ls.node:= node0).nd:= nd0).success:= success0 ).node, (((ls.node:= node0).nd:= nd0).success:= success0).nd ]) .vs:= gs.vs [(((ls.node:= node0).nd:= nd0).success:= success0).node, (((ls.node:= node0).nd:= nd0).success:= success0).nd ]) .owns:= gs.owns ((((ls.node:= node0).nd:= nd0).success:= success0).node ; Some((((ls.node:= node0).nd:= nd0).success:= success0).tid) ); (s) ⊦ pcstepf(gs, ls, E1, a) = (∃ node0, nd0, success0. a = chooseE1(node0, nd0, success0) ⊃ E2;E1); (s)

Proof step 183 from proof copied-rely-DMSQLInv (previous step) (back to tree)

dom gs.vrvHp = dom gs.prvHp, gs.orl ≠ [], ls.tid ≠ tid0, node0 ≠ null, 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), noowns(ls.tid, gs.owns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, gs.phead ∈ gs.vs, gs.phead ∈ gs.ps, ¬ DMSQRely(gs, tid0, ((gs.ps:= gs.ps[node0, nd0]).vs:= gs.vs[node0, nd0]).owns:= gs.owns(node0; Some(ls.tid))), ¬ dups(gs.orl + gs.qrl), ¬ dups(gs.orl), ¬ dups(gs.qrl), ¬ node0 ∈ gs.ps, ¬ node0 ∈ gs.vs, 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.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, 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) ⊦ ∃ node, nd, success0. chooseE1(node0, nd0, false) = chooseE1(node, nd, success0)

User applied rule exists right

And closed the goal!

Rule argument

pos: right 1 terms: node0, nd0, false abort: F discard: T computed: T

Additional information

Used terms: node0, nd0, false

Proof step 184 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs.vretRefs(tid0) = gstepf(gs, ls, E1, a).vretRefs(tid0), success0 ↔ false, a = chooseE1(node0, nd0, success0), gs0 = gstepf(gs, ls, E1, a), ls0 = lstepf(gs, ls, E1, a), pc0 = pcstepf(gs, ls, E1, a), ls.tid ≠ tid0, node0 ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, E1), equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, E1, a).vs, gstepf(gs, ls, E1, a).ps, gstepf(gs, ls, E1, a).owns), equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, E1, a).vs, gstepf(gs, ls, E1, a).ps), nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, E1, a).vhead, gstepf(gs, ls, E1, a).vs), noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl, gstepf(gs, ls, E1, a).vs), ownsRely(tid0, gs.owns, gstepf(gs, ls, E1, a).owns), prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, E1, a).prvHp), rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, E1, a).rvowns, gs.vrvHp), rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, E1, a).vretRefs, gstepf(gs, ls, E1, a).vrvHp), gstepf(gs, ls, E1, a).vtail ∈ gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl from gs.vtail, gstepf(gs, ls, E1, a).phead ∈ gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl from gs.phead, gstepf(gs, ls, E1, a).vhead ∈ gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl from gs.vhead, dom gs.vrvHp ⊆ dom gstepf(gs, ls, E1, a).vrvHp, ¬ DMSQRely(gs, tid0, gs0), ¬ node0 ∈ gs.ps, ¬ node0 ∈ gs.vs, ∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl, ∃ rl0. gs.orl + rl0 = gstepf(gs, ls, E1, a).orl, gs.pretRefs(tid0) = gstepf(gs, ls, E1, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, E1, a).pretRefs(tid0) ⊦

User applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ (gs.ps:= ps).pretRefs = gs.pretRefs; (s) ⊦ (gs.vs:= ps0).pretRefs = gs.pretRefs; (s) ⊦ (gs.owns:= owns).pretRefs = gs.pretRefs; (s) ⊦ (ls.node:= node).tid = ls.tid; (s) ⊦ (ls.nd:= nd).tid = ls.tid; (s) ⊦ (ls.success:= success).tid = ls.tid; (s) ⊦ (ls.node:= node).node = node; (s) ⊦ (ls.nd:= nd).node = ls.node; (s) ⊦ (ls.success:= success).node = ls.node; (s) ⊦ (ls.nd:= nd).nd = nd; (s) ⊦ (ls.success:= success).nd = ls.nd; (s) ⊦ gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)) = ( ( gs .ps:= gs.ps [(((ls.node:= node0).nd:= nd0).success:= success0 ).node, (((ls.node:= node0).nd:= nd0).success:= success0).nd ]) .vs:= gs.vs [(((ls.node:= node0).nd:= nd0).success:= success0).node, (((ls.node:= node0).nd:= nd0).success:= success0).nd ]) .owns:= gs.owns ((((ls.node:= node0).nd:= nd0).success:= success0).node ; Some((((ls.node:= node0).nd:= nd0).success:= success0).tid) ); (s) ⊦ (gs.owns:= owns).owns = owns; (s) ⊦ (gs.ps:= ps).ps = ps; (s) ⊦ (gs.vs:= ps0).ps = gs.ps; (s) ⊦ (gs.owns:= owns).ps = gs.ps; (s) ⊦ (gs.vs:= ps0).vs = ps0; (s) ⊦ (gs.owns:= owns).vs = gs.vs; (s) ⊦ (gs.ps:= ps).vhead = gs.vhead; (s) ⊦ (gs.vs:= ps0).vhead = gs.vhead; (s) ⊦ (gs.owns:= owns).vhead = gs.vhead; (s) ⊦ (gs.ps:= ps).qrl = gs.qrl; (s) ⊦ (gs.vs:= ps0).qrl = gs.qrl; (s) ⊦ (gs.owns:= owns).qrl = gs.qrl; (s) ⊦ (gs.ps:= ps).orl = gs.orl; (s) ⊦ (gs.vs:= ps0).orl = gs.orl; (s) ⊦ (gs.owns:= owns).orl = gs.orl; (s) ⊦ prvHpRely(vrvHp, prvHp, prvHp); (s) ⊦ (gs.ps:= ps).prvHp = gs.prvHp; (s) ⊦ (gs.vs:= ps0).prvHp = gs.prvHp; (s) ⊦ (gs.owns:= owns).prvHp = gs.prvHp; (s) ⊦ rvownsrely(tid, rvowns, rvowns, vrvHp); (s) ⊦ (gs.ps:= ps).rvowns = gs.rvowns; (s) ⊦ (gs.vs:= ps0).rvowns = gs.rvowns; (s) ⊦ (gs.owns:= owns).rvowns = gs.rvowns; (s) ⊦ rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs, vrvHp); (s) ⊦ (gs.ps:= ps).vrvHp = gs.vrvHp; (s) ⊦ (gs.vs:= ps0).vrvHp = gs.vrvHp; (s) ⊦ (gs.owns:= owns).vrvHp = gs.vrvHp; (s) ⊦ (gs.ps:= ps).vretRefs = gs.vretRefs; (s) ⊦ (gs.vs:= ps0).vretRefs = gs.vretRefs; (s) ⊦ (gs.owns:= owns).vretRefs = gs.vretRefs; (s) ⊦ (gs.ps:= ps).vtail = gs.vtail; (s) ⊦ (gs.vs:= ps0).vtail = gs.vtail; (s) ⊦ (gs.owns:= owns).vtail = gs.vtail; (s) ⊦ (gs.ps:= ps).phead = gs.phead; (s) ⊦ (gs.vs:= ps0).phead = gs.phead; (s) ⊦ (gs.owns:= owns).phead = gs.phead; (s) ⊦ # s = # s0 → (s ⊆ s0 ↔ s = s0); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x = x + y ↔ y = []; (s) ⊦ # x = # z → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws)

Proof step 185 from proof copied-rely-DMSQLInv (previous step) (back to tree)

ls.tid ≠ tid0, node0 ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, E1), equalowns(gs.vs, gs.ps, gs.owns, tid0, gs.vs[node0, nd0], gs.ps[node0, nd0], gs.owns(node0; Some(ls.tid))), equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs.vs[node0, nd0], gs.ps[node0, nd0]), nextnottidRely(tid0, gs.vhead, gs.vs, gs.vhead, gs.vs[node0, nd0]), noidRely(tid0, gs.orl + gs.qrl, gs.vs, gs.orl + gs.qrl, gs.vs[node0, nd0]), ownsRely(tid0, gs.owns, gs.owns(node0; Some(ls.tid))), gs.vtail ∈ gs.orl + gs.qrl from gs.vtail, gs.phead ∈ gs.orl + gs.qrl from gs.phead, gs.vhead ∈ gs.orl + gs.qrl from gs.vhead, ¬ DMSQRely(gs, tid0, ((gs.ps:= gs.ps[node0, nd0]).vs:= gs.vs[node0, nd0]).owns:= gs.owns(node0; Some(ls.tid))), ¬ node0 ∈ gs.vs, ¬ node0 ∈ gs.ps ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQRely, seq:⊦ DMSQRely(gs, tid, gs0) ↔ (∃ 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, tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid) = gs0.vretRefs(tid) ∧ ( gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid)) ∧ rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(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(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid, gs.owns, gs0.owns), subst:[gs, tid, gs0] → [gs, tid0, ((gs.ps:= gs.ps[node0, nd0]).vs:= gs.vs[node0, nd0]) .owns:= gs.owns(node0; Some(ls.tid))], <all paths>

Additional information

Used simplifier rules: ⊦ # x = # z → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) ⊦ x = x + y ↔ y = []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ (gs.owns:= owns).vtail = gs.vtail; (s) ⊦ (gs.vs:= ps0).vtail = gs.vtail; (s) ⊦ (gs.ps:= ps).vtail = gs.vtail; (s) ⊦ (gs.owns:= owns).phead = gs.phead; (s) ⊦ (gs.vs:= ps0).phead = gs.phead; (s) ⊦ (gs.ps:= ps).phead = gs.phead; (s) ⊦ (gs.owns:= owns).ps = gs.ps; (s) ⊦ (gs.vs:= ps0).ps = gs.ps; (s) ⊦ (gs.ps:= ps).ps = ps; (s) ⊦ (gs.owns:= owns).pretRefs = gs.pretRefs; (s) ⊦ (gs.vs:= ps0).pretRefs = gs.pretRefs; (s) ⊦ (gs.ps:= ps).pretRefs = gs.pretRefs; (s) ⊦ (gs.owns:= owns).rvowns = gs.rvowns; (s) ⊦ (gs.vs:= ps0).rvowns = gs.rvowns; (s) ⊦ (gs.ps:= ps).rvowns = gs.rvowns; (s) ⊦ rvownsrely(tid, rvowns, rvowns, vrvHp); (s) ⊦ (gs.owns:= owns).vretRefs = gs.vretRefs; (s) ⊦ (gs.vs:= ps0).vretRefs = gs.vretRefs; (s) ⊦ (gs.ps:= ps).vretRefs = gs.vretRefs; (s) ⊦ rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs, vrvHp); (s) ⊦ (gs.owns:= owns).vrvHp = gs.vrvHp; (s) ⊦ (gs.vs:= ps0).vrvHp = gs.vrvHp; (s) ⊦ (gs.ps:= ps).vrvHp = gs.vrvHp; (s) ⊦ # s = # s0 → (s ⊆ s0 ↔ s = s0); (s) ⊦ (gs.owns:= owns).prvHp = gs.prvHp; (s) ⊦ (gs.vs:= ps0).prvHp = gs.prvHp; (s) ⊦ (gs.ps:= ps).prvHp = gs.prvHp; (s) ⊦ prvHpRely(vrvHp, prvHp, prvHp); (s) ⊦ (gs.owns:= owns).orl = gs.orl; (s) ⊦ (gs.vs:= ps0).orl = gs.orl; (s) ⊦ (gs.ps:= ps).orl = gs.orl; (s) ⊦ (gs.owns:= owns).qrl = gs.qrl; (s) ⊦ (gs.vs:= ps0).qrl = gs.qrl; (s) ⊦ (gs.ps:= ps).qrl = gs.qrl; (s) ⊦ (gs.owns:= owns).vhead = gs.vhead; (s) ⊦ (gs.vs:= ps0).vhead = gs.vhead; (s) ⊦ (gs.ps:= ps).vhead = gs.vhead; (s) ⊦ (gs.owns:= owns).vs = gs.vs; (s) ⊦ (gs.vs:= ps0).vs = ps0; (s) ⊦ (gs.owns:= owns).owns = owns; (s) Used terms: gs, tid0, ((gs.ps:= gs.ps[node0, nd0]).vs:= gs.vs[node0, nd0]) .owns:= gs.owns(node0; Some(ls.tid))

Proof step 186 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ DMSQRely(gs, tid, gs0) ↔ (∃ 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, tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid) = gs0.vretRefs(tid) ∧ (gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid)) ∧ rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(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(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid, gs.owns, gs0.owns)

A spec-lemma

Proof step 187 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = E2, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a), ¬ DMSQRely(gs, tid0, gs0) ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:rely-E2-E3, seq:⊦ ls.tid ≠ tid0 ∧ ( 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) ∧ ¬ 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, E2, a) ∧ pcstepf(gs, ls, E2, a) = E3 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, E2, a).orl) ∧ gstepf(gs, ls, E2, a).vtail ∈ gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl from gs.vtail ∧ gstepf(gs, ls, E2, a).phead ∈ gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl from gs.phead ∧ gstepf(gs, ls, E2, a).vhead ∈ gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl from gs.vhead ∧ equalrl (gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, E2, a).vs, gstepf(gs, ls, E2, a).ps) ∧ equalowns (gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, E2, a).vs, gstepf(gs, ls, E2, a).ps, gstepf(gs, ls, E2, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, E2, a).vretRefs(tid0) ∧ ( gs.pretRefs(tid0) = gstepf(gs, ls, E2, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, E2, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, E2, a).rvowns, gs.vrvHp) ∧ rvrely (tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, E2, a).vretRefs, gstepf(gs, ls, E2, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, E2, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, E2, a).prvHp) ∧ noidRely (tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl, gstepf(gs, ls, E2, a).vs) ∧ nextnottidRely (tid0, gs.vhead, gs.vs, gstepf(gs, ls, E2, a).vhead, gstepf(gs, ls, E2, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, E2, a).owns), subst:[ls, tid0, gs, a] → [ls, tid0, gs, a]

Additional information

Used terms: ls, tid0, gs, a

Proof step 188 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ ls.tid ≠ tid0 ∧ ( 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) ∧ ¬ 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, E2, a) ∧ pcstepf(gs, ls, E2, a) = E3 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, E2, a).orl) ∧ gstepf(gs, ls, E2, a).vtail ∈ gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl from gs.vtail ∧ gstepf(gs, ls, E2, a).phead ∈ gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl from gs.phead ∧ gstepf(gs, ls, E2, a).vhead ∈ gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, E2, a).vs, gstepf(gs, ls, E2, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, E2, a).vs, gstepf(gs, ls, E2, a).ps, gstepf(gs, ls, E2, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, E2, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, E2, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, E2, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, E2, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, E2, a).vretRefs, gstepf(gs, ls, E2, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, E2, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, E2, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl, gstepf(gs, ls, E2, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, E2, a).vhead, gstepf(gs, ls, E2, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, E2, a).owns)

Lemma rely-E2-E3

Proof step 189 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = E2, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a), ¬ DMSQRely(gs, tid0, gs0), ls.tid ≠ tid0 ∧ ( 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) ∧ ¬ 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, E2, a) ∧ pcstepf(gs, ls, E2, a) = E3 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, E2, a).orl) ∧ gstepf(gs, ls, E2, a).vtail ∈ gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl from gs.vtail ∧ gstepf(gs, ls, E2, a).phead ∈ gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl from gs.phead ∧ gstepf(gs, ls, E2, a).vhead ∈ gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, E2, a).vs, gstepf(gs, ls, E2, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, E2, a).vs, gstepf(gs, ls, E2, a).ps, gstepf(gs, ls, E2, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, E2, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, E2, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, E2, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, E2, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, E2, a).vretRefs, gstepf(gs, ls, E2, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, E2, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, E2, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl, gstepf(gs, ls, E2, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, E2, a).vhead, gstepf(gs, ls, E2, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, E2, a).owns) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 10

Additional information

Proof step 190 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = E2, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a), ¬ DMSQRely(gs, tid0, gs0) ⊦ ls.tid ≠ tid0 ∧ ( 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) ∧ ¬ 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, E2, a) ∧ pcstepf(gs, ls, E2, a) = E3

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQGInv, seq:⊦ DMSQGInv(gs) ↔ 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), subst:[gs] → [gs], <all paths>

Additional information

Used terms: gs

Proof step 191 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ DMSQGInv(gs) ↔ 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)

A spec-lemma

Proof step 192 from proof copied-rely-DMSQLInv (previous step) (back to tree)

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = E2, pc0 = pcstepf(gs, ls, pc, a), gs.orl ≠ [], ls.tid ≠ tid0, DMSQLInv(gs, ls, pc), 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), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, pc, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ DMSQRely(gs, tid0, gs0), ¬ 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.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.tid ≠ tid0 ∧ ( 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) ∧ ¬ 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, E2, a) ∧ pcstepf(gs, ls, E2, a) = E3

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQLInv, seq:⊦ DMSQLInv(gs, ls, pc) ↔ ( pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → ( ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ ( pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ ( pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ ( pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ; gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → 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)) ∧ ( pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ( gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E9 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.nxt = null ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ ( pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → 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)) ∧ ( pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ ( pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) ) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ ( pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) )) ∧ ( pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )), subst:[gs, ls, pc] → [gs, ls, pc], <all paths>

Additional information

Used simplifier rules: ⊦ D1 ≠ E2; (s) ⊦ D2 ≠ E2; (s) ⊦ E2 ≠ E17; (s) ⊦ E2 ≠ crashed; (s) ⊦ E2 ≠ idle; (s) ⊦ E2 ≠ ready; (s) ⊦ E1 ≠ E2; (s) ⊦ D7 ≠ E2; (s) ⊦ D32 ≠ E2; (s) ⊦ D33 ≠ E2; (s) ⊦ E2 ≠ E4; (s) ⊦ E2 ≠ E16; (s) ⊦ E2 ≠ E15; (s) ⊦ E2 ≠ E14; (s) ⊦ E2 ≠ E13; (s) ⊦ E2 ≠ E12; (s) ⊦ E2 ≠ E11; (s) ⊦ E2 ≠ E10; (s) ⊦ E2 ≠ E9; (s) ⊦ E2 ≠ E8; (s) ⊦ E2 ≠ E7; (s) ⊦ E2 ≠ E6; (s) ⊦ E2 ≠ E5; (s) ⊦ E2 ≠ E3; (s) ⊦ D34 ≠ E2; (s) ⊦ D31 ≠ E2; (s) ⊦ D30 ≠ E2; (s) ⊦ D29 ≠ E2; (s) ⊦ D28 ≠ E2; (s) ⊦ D27 ≠ E2; (s) ⊦ D26 ≠ E2; (s) ⊦ D25 ≠ E2; (s) ⊦ D24 ≠ E2; (s) ⊦ D23 ≠ E2; (s) ⊦ D22 ≠ E2; (s) ⊦ D21 ≠ E2; (s) ⊦ D20 ≠ E2; (s) ⊦ D19 ≠ E2; (s) ⊦ D18 ≠ E2; (s) ⊦ D17 ≠ E2; (s) ⊦ D16 ≠ E2; (s) ⊦ D15 ≠ E2; (s) ⊦ D14 ≠ E2; (s) ⊦ D13 ≠ E2; (s) ⊦ D12 ≠ E2; (s) ⊦ D11 ≠ E2; (s) ⊦ D10 ≠ E2; (s) ⊦ D9 ≠ E2; (s) ⊦ D8 ≠ E2; (s) ⊦ D6 ≠ E2; (s) ⊦ D5 ≠ E2; (s) ⊦ D4 ≠ E2; (s) ⊦ D3 ≠ E2; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, E2, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, E2, a) = E3; (s) Used terms: gs, ls, pc

Proof step 193 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ DMSQLInv(gs, ls, pc) ↔ (pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → (ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ (pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ (pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ (pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ (pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ;gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → 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)) ∧ (pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ (gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ (pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ (pc = E9 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.nxt = null ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ (pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → 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)) ∧ (pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ (pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ (pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns)) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ (pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns))) ∧ (pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)))

A spec-lemma

Proof step 194 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs.vretRefs(tid0) = gstepf(gs, ls, E2, a).vretRefs(tid0), gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = E2, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, E2, a).vs, gstepf(gs, ls, E2, a).ps, gstepf(gs, ls, E2, a).owns), equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, E2, a).vs, gstepf(gs, ls, E2, a).ps), nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, E2, a).vhead, gstepf(gs, ls, E2, a).vs), noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl, gstepf(gs, ls, E2, a).vs), ownsRely(tid0, gs.owns, gstepf(gs, ls, E2, a).owns), pre(gs, ls, pc, a), prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, E2, a).prvHp), rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, E2, a).rvowns, gs.vrvHp), rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, E2, a).vretRefs, gstepf(gs, ls, E2, a).vrvHp), gstepf(gs, ls, E2, a).vtail ∈ gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl from gs.vtail, gstepf(gs, ls, E2, a).phead ∈ gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl from gs.phead, gstepf(gs, ls, E2, a).vhead ∈ gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl from gs.vhead, dom gs.vrvHp ⊆ dom gstepf(gs, ls, E2, a).vrvHp, ¬ DMSQRely(gs, tid0, gs0), ∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl, ∃ rl0. gs.orl + rl0 = gstepf(gs, ls, E2, a).orl, gs.pretRefs(tid0) = gstepf(gs, ls, E2, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, E2, a).pretRefs(tid0) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQRely, seq:⊦ DMSQRely(gs, tid, gs0) ↔ (∃ 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, tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid) = gs0.vretRefs(tid) ∧ ( gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid)) ∧ rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(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(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid, gs.owns, gs0.owns), subst:[gs, tid, gs0] → [gs, tid0, gs0], <all paths>

Additional information

Used simplifier rules: ⊦ pre(gs, ls, E2, a) ↔ a = τ; (s) ⊦ (gs.vs:= ps0).prvHp = gs.prvHp; (s) ⊦ prvHpRely(vrvHp, prvHp, prvHp); (s) ⊦ (gs.vs:= ps0).rvowns = gs.rvowns; (s) ⊦ rvownsrely(tid, rvowns, rvowns, vrvHp); (s) ⊦ (gs.vs:= ps0).vretRefs = gs.vretRefs; (s) ⊦ rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs, vrvHp); (s) ⊦ (gs.vs:= ps0).phead = gs.phead; (s) ⊦ (gs.vs:= ps0).vtail = gs.vtail; (s) ⊦ (gs.vs:= ps0).vrvHp = gs.vrvHp; (s) ⊦ # s = # s0 → (s ⊆ s0 ↔ s = s0); (s) ⊦ (gs.vs:= ps0).ps = gs.ps; (s) ⊦ (gs.vs:= ps0).vhead = gs.vhead; (s) ⊦ (gs.vs:= ps0).vs = ps0; (s) ⊦ (gs.vs:= ps0).owns = gs.owns; (s) ⊦ ownsRely(tid, owns, owns); (s) ⊦ (gs.vs:= ps0).qrl = gs.qrl; (s) ⊦ # x = # z → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) ⊦ (gs.vs:= ps0).orl = gs.orl; (s) ⊦ gstepf(gs, ls, E2, τ) = gs.vs:= gs.vs[ls.node, mk(ls.value, None, null)]; (s) ⊦ (gs.vs:= ps0).pretRefs = gs.pretRefs; (s) ⊦ [] + x = x; (s) ⊦ x = x + y ↔ y = []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: gs, tid0, gs0

Proof step 195 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ DMSQRely(gs, tid, gs0) ↔ (∃ 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, tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid) = gs0.vretRefs(tid) ∧ (gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid)) ∧ rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(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(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid, gs.owns, gs0.owns)

A spec-lemma

Proof step 196 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = E3, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a), ¬ DMSQRely(gs, tid0, gs0) ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:rely-E3-E4, seq:⊦ ls.tid ≠ tid0 ∧ ( 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) ∧ ¬ 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, E3, a) ∧ pcstepf(gs, ls, E3, a) = E4 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, E3, a).orl) ∧ gstepf(gs, ls, E3, a).vtail ∈ gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl from gs.vtail ∧ gstepf(gs, ls, E3, a).phead ∈ gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl from gs.phead ∧ gstepf(gs, ls, E3, a).vhead ∈ gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl from gs.vhead ∧ equalrl (gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, E3, a).vs, gstepf(gs, ls, E3, a).ps) ∧ equalowns (gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, E3, a).vs, gstepf(gs, ls, E3, a).ps, gstepf(gs, ls, E3, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, E3, a).vretRefs(tid0) ∧ ( gs.pretRefs(tid0) = gstepf(gs, ls, E3, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, E3, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, E3, a).rvowns, gs.vrvHp) ∧ rvrely (tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, E3, a).vretRefs, gstepf(gs, ls, E3, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, E3, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, E3, a).prvHp) ∧ noidRely (tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl, gstepf(gs, ls, E3, a).vs) ∧ nextnottidRely (tid0, gs.vhead, gs.vs, gstepf(gs, ls, E3, a).vhead, gstepf(gs, ls, E3, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, E3, a).owns), subst:[ls, tid0, gs, a] → [ls, tid0, gs, a]

Additional information

Used terms: ls, tid0, gs, a

Proof step 197 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ ls.tid ≠ tid0 ∧ ( 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) ∧ ¬ 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, E3, a) ∧ pcstepf(gs, ls, E3, a) = E4 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, E3, a).orl) ∧ gstepf(gs, ls, E3, a).vtail ∈ gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl from gs.vtail ∧ gstepf(gs, ls, E3, a).phead ∈ gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl from gs.phead ∧ gstepf(gs, ls, E3, a).vhead ∈ gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, E3, a).vs, gstepf(gs, ls, E3, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, E3, a).vs, gstepf(gs, ls, E3, a).ps, gstepf(gs, ls, E3, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, E3, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, E3, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, E3, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, E3, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, E3, a).vretRefs, gstepf(gs, ls, E3, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, E3, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, E3, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl, gstepf(gs, ls, E3, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, E3, a).vhead, gstepf(gs, ls, E3, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, E3, a).owns)

Lemma rely-E3-E4

Proof step 198 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = E3, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a), ¬ DMSQRely(gs, tid0, gs0), ls.tid ≠ tid0 ∧ ( 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) ∧ ¬ 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, E3, a) ∧ pcstepf(gs, ls, E3, a) = E4 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, E3, a).orl) ∧ gstepf(gs, ls, E3, a).vtail ∈ gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl from gs.vtail ∧ gstepf(gs, ls, E3, a).phead ∈ gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl from gs.phead ∧ gstepf(gs, ls, E3, a).vhead ∈ gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, E3, a).vs, gstepf(gs, ls, E3, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, E3, a).vs, gstepf(gs, ls, E3, a).ps, gstepf(gs, ls, E3, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, E3, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, E3, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, E3, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, E3, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, E3, a).vretRefs, gstepf(gs, ls, E3, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, E3, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, E3, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl, gstepf(gs, ls, E3, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, E3, a).vhead, gstepf(gs, ls, E3, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, E3, a).owns) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 10

Additional information

Proof step 199 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = E3, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a), ¬ DMSQRely(gs, tid0, gs0) ⊦ ls.tid ≠ tid0 ∧ ( 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) ∧ ¬ 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, E3, a) ∧ pcstepf(gs, ls, E3, a) = E4

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQGInv, seq:⊦ DMSQGInv(gs) ↔ 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), subst:[gs] → [gs], <all paths>

Additional information

Used terms: gs

Proof step 200 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ DMSQGInv(gs) ↔ 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)

A spec-lemma

Proof step 201 from proof copied-rely-DMSQLInv (previous step) (back to tree)

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = E3, pc0 = pcstepf(gs, ls, pc, a), gs.orl ≠ [], ls.tid ≠ tid0, DMSQLInv(gs, ls, pc), 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), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, pc, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ DMSQRely(gs, tid0, gs0), ¬ 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.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.tid ≠ tid0 ∧ ( 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) ∧ ¬ 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, E3, a) ∧ pcstepf(gs, ls, E3, a) = E4

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQLInv, seq:⊦ DMSQLInv(gs, ls, pc) ↔ ( pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → ( ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ ( pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ ( pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ ( pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ; gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → 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)) ∧ ( pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ( gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E9 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.nxt = null ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ ( pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → 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)) ∧ ( pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ ( pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) ) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ ( pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) )) ∧ ( pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )), subst:[gs, ls, pc] → [gs, ls, pc], <all paths>

Additional information

Used simplifier rules: ⊦ D1 ≠ E3; (s) ⊦ D2 ≠ E3; (s) ⊦ E3 ≠ E17; (s) ⊦ E3 ≠ crashed; (s) ⊦ E3 ≠ idle; (s) ⊦ E3 ≠ ready; (s) ⊦ E1 ≠ E3; (s) ⊦ D7 ≠ E3; (s) ⊦ D32 ≠ E3; (s) ⊦ D33 ≠ E3; (s) ⊦ E3 ≠ E4; (s) ⊦ E3 ≠ E16; (s) ⊦ E3 ≠ E15; (s) ⊦ E3 ≠ E14; (s) ⊦ E3 ≠ E13; (s) ⊦ E3 ≠ E12; (s) ⊦ E3 ≠ E11; (s) ⊦ E3 ≠ E10; (s) ⊦ E3 ≠ E9; (s) ⊦ E3 ≠ E8; (s) ⊦ E3 ≠ E7; (s) ⊦ E3 ≠ E6; (s) ⊦ E3 ≠ E5; (s) ⊦ E2 ≠ E3; (s) ⊦ D34 ≠ E3; (s) ⊦ D31 ≠ E3; (s) ⊦ D30 ≠ E3; (s) ⊦ D29 ≠ E3; (s) ⊦ D28 ≠ E3; (s) ⊦ D27 ≠ E3; (s) ⊦ D26 ≠ E3; (s) ⊦ D25 ≠ E3; (s) ⊦ D24 ≠ E3; (s) ⊦ D23 ≠ E3; (s) ⊦ D22 ≠ E3; (s) ⊦ D21 ≠ E3; (s) ⊦ D20 ≠ E3; (s) ⊦ D19 ≠ E3; (s) ⊦ D18 ≠ E3; (s) ⊦ D17 ≠ E3; (s) ⊦ D16 ≠ E3; (s) ⊦ D15 ≠ E3; (s) ⊦ D14 ≠ E3; (s) ⊦ D13 ≠ E3; (s) ⊦ D12 ≠ E3; (s) ⊦ D11 ≠ E3; (s) ⊦ D10 ≠ E3; (s) ⊦ D9 ≠ E3; (s) ⊦ D8 ≠ E3; (s) ⊦ D6 ≠ E3; (s) ⊦ D5 ≠ E3; (s) ⊦ D4 ≠ E3; (s) ⊦ D3 ≠ E3; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, E3, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, E3, a) = E4; (s) Used terms: gs, ls, pc

Proof step 202 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ DMSQLInv(gs, ls, pc) ↔ (pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → (ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ (pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ (pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ (pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ (pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ;gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → 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)) ∧ (pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ (gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ (pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ (pc = E9 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.nxt = null ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ (pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → 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)) ∧ (pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ (pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ (pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns)) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ (pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns))) ∧ (pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)))

A spec-lemma

Proof step 203 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs.vretRefs(tid0) = gstepf(gs, ls, E3, a).vretRefs(tid0), gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = E3, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, E3, a).vs, gstepf(gs, ls, E3, a).ps, gstepf(gs, ls, E3, a).owns), equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, E3, a).vs, gstepf(gs, ls, E3, a).ps), nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, E3, a).vhead, gstepf(gs, ls, E3, a).vs), noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl, gstepf(gs, ls, E3, a).vs), ownsRely(tid0, gs.owns, gstepf(gs, ls, E3, a).owns), pre(gs, ls, pc, a), prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, E3, a).prvHp), rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, E3, a).rvowns, gs.vrvHp), rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, E3, a).vretRefs, gstepf(gs, ls, E3, a).vrvHp), gstepf(gs, ls, E3, a).vtail ∈ gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl from gs.vtail, gstepf(gs, ls, E3, a).phead ∈ gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl from gs.phead, gstepf(gs, ls, E3, a).vhead ∈ gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl from gs.vhead, dom gs.vrvHp ⊆ dom gstepf(gs, ls, E3, a).vrvHp, ¬ DMSQRely(gs, tid0, gs0), ∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl, ∃ rl0. gs.orl + rl0 = gstepf(gs, ls, E3, a).orl, gs.pretRefs(tid0) = gstepf(gs, ls, E3, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, E3, a).pretRefs(tid0) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQRely, seq:⊦ DMSQRely(gs, tid, gs0) ↔ (∃ 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, tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid) = gs0.vretRefs(tid) ∧ ( gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid)) ∧ rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(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(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid, gs.owns, gs0.owns), subst:[gs, tid, gs0] → [gs, tid0, gs0], <all paths>

Additional information

Used simplifier rules: ⊦ pre(gs, ls, E3, a) ↔ a = τ; (s) ⊦ (gs.ps:= ps).prvHp = gs.prvHp; (s) ⊦ prvHpRely(vrvHp, prvHp, prvHp); (s) ⊦ (gs.ps:= ps).rvowns = gs.rvowns; (s) ⊦ rvownsrely(tid, rvowns, rvowns, vrvHp); (s) ⊦ (gs.ps:= ps).vretRefs = gs.vretRefs; (s) ⊦ rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs, vrvHp); (s) ⊦ (gs.ps:= ps).phead = gs.phead; (s) ⊦ (gs.ps:= ps).vtail = gs.vtail; (s) ⊦ (gs.ps:= ps).vrvHp = gs.vrvHp; (s) ⊦ # s = # s0 → (s ⊆ s0 ↔ s = s0); (s) ⊦ (gs.ps:= ps).ps = ps; (s) ⊦ (gs.ps:= ps).vhead = gs.vhead; (s) ⊦ nextnottidRely(tid, vhead, vs, vhead, vs); (s) ⊦ (gs.ps:= ps).vs = gs.vs; (s) ⊦ (gs.ps:= ps).owns = gs.owns; (s) ⊦ ownsRely(tid, owns, owns); (s) ⊦ (gs.ps:= ps).qrl = gs.qrl; (s) ⊦ # x = # z → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) ⊦ (gs.ps:= ps).orl = gs.orl; (s) ⊦ gstepf(gs, ls, E3, τ) = gs.ps:= gs.ps[ls.node, gs.vs[ls.node]]; (s) ⊦ (gs.ps:= ps).pretRefs = gs.pretRefs; (s) ⊦ noidRely(tid, rl, vs, rl, vs); (s) ⊦ [] + x = x; (s) ⊦ x = x + y ↔ y = []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: gs, tid0, gs0

Proof step 204 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ DMSQRely(gs, tid, gs0) ↔ (∃ 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, tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid) = gs0.vretRefs(tid) ∧ (gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid)) ∧ rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(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(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid, gs.owns, gs0.owns)

A spec-lemma

Proof step 205 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = E9, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a), ¬ DMSQRely(gs, tid0, gs0) ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:rely-E9-E10, seq:⊦ ls.tid ≠ tid0 ∧ ( ( gs.owns(ls.node) = Some(ls.tid) ∧ ls.nxt = null ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( 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, E9, a) ∧ pcstepf(gs, ls, E9, a) = E10 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, E9, a).orl) ∧ gstepf(gs, ls, E9, a).vtail ∈ gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl from gs.vtail ∧ gstepf(gs, ls, E9, a).phead ∈ gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl from gs.phead ∧ gstepf(gs, ls, E9, a).vhead ∈ gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl from gs.vhead ∧ equalrl (gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, E9, a).vs, gstepf(gs, ls, E9, a).ps) ∧ equalowns (gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, E9, a).vs, gstepf(gs, ls, E9, a).ps, gstepf(gs, ls, E9, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, E9, a).vretRefs(tid0) ∧ ( gs.pretRefs(tid0) = gstepf(gs, ls, E9, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, E9, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, E9, a).rvowns, gs.vrvHp) ∧ rvrely (tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, E9, a).vretRefs, gstepf(gs, ls, E9, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, E9, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, E9, a).prvHp) ∧ noidRely (tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl, gstepf(gs, ls, E9, a).vs) ∧ nextnottidRely (tid0, gs.vhead, gs.vs, gstepf(gs, ls, E9, a).vhead, gstepf(gs, ls, E9, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, E9, a).owns), subst:[ls, tid0, gs, a] → [ls, tid0, gs, a]

Additional information

Used terms: ls, tid0, gs, a

Proof step 206 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ ls.tid ≠ tid0 ∧ ( (gs.owns(ls.node) = Some(ls.tid) ∧ ls.nxt = null ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( 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, E9, a) ∧ pcstepf(gs, ls, E9, a) = E10 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, E9, a).orl) ∧ gstepf(gs, ls, E9, a).vtail ∈ gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl from gs.vtail ∧ gstepf(gs, ls, E9, a).phead ∈ gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl from gs.phead ∧ gstepf(gs, ls, E9, a).vhead ∈ gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, E9, a).vs, gstepf(gs, ls, E9, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, E9, a).vs, gstepf(gs, ls, E9, a).ps, gstepf(gs, ls, E9, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, E9, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, E9, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, E9, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, E9, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, E9, a).vretRefs, gstepf(gs, ls, E9, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, E9, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, E9, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl, gstepf(gs, ls, E9, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, E9, a).vhead, gstepf(gs, ls, E9, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, E9, a).owns)

Lemma rely-E9-E10

Proof step 207 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = E9, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a), ¬ DMSQRely(gs, tid0, gs0), ls.tid ≠ tid0 ∧ ( (gs.owns(ls.node) = Some(ls.tid) ∧ ls.nxt = null ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( 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, E9, a) ∧ pcstepf(gs, ls, E9, a) = E10 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, E9, a).orl) ∧ gstepf(gs, ls, E9, a).vtail ∈ gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl from gs.vtail ∧ gstepf(gs, ls, E9, a).phead ∈ gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl from gs.phead ∧ gstepf(gs, ls, E9, a).vhead ∈ gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, E9, a).vs, gstepf(gs, ls, E9, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, E9, a).vs, gstepf(gs, ls, E9, a).ps, gstepf(gs, ls, E9, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, E9, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, E9, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, E9, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, E9, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, E9, a).vretRefs, gstepf(gs, ls, E9, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, E9, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, E9, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl, gstepf(gs, ls, E9, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, E9, a).vhead, gstepf(gs, ls, E9, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, E9, a).owns) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 10

Additional information

Proof step 208 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = E9, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a), ¬ DMSQRely(gs, tid0, gs0) ⊦ ls.tid ≠ tid0 ∧ ( (gs.owns(ls.node) = Some(ls.tid) ∧ ls.nxt = null ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( 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, E9, a) ∧ pcstepf(gs, ls, E9, a) = E10

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQGInv, seq:⊦ DMSQGInv(gs) ↔ 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), subst:[gs] → [gs], <all paths>

Additional information

Used terms: gs

Proof step 209 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ DMSQGInv(gs) ↔ 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)

A spec-lemma

Proof step 210 from proof copied-rely-DMSQLInv (previous step) (back to tree)

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = E9, pc0 = pcstepf(gs, ls, pc, a), gs.orl ≠ [], ls.tid ≠ tid0, DMSQLInv(gs, ls, pc), 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), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, pc, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ DMSQRely(gs, tid0, gs0), ¬ 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.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.tid ≠ tid0 ∧ ( (gs.owns(ls.node) = Some(ls.tid) ∧ ls.nxt = null ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( 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, E9, a) ∧ pcstepf(gs, ls, E9, a) = E10

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQLInv, seq:⊦ DMSQLInv(gs, ls, pc) ↔ ( pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → ( ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ ( pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ ( pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ ( pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ; gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → 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)) ∧ ( pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ( gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E9 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.nxt = null ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ ( pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → 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)) ∧ ( pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ ( pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) ) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ ( pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) )) ∧ ( pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )), subst:[gs, ls, pc] → [gs, ls, pc], <all paths>

Additional information

Used simplifier rules: ⊦ gstepf(gs, ls, E9, a) = ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]) .owns:= gs.owns(ls.node; Weak(ls.tid)) ;gs ); (s) ⊦ D1 ≠ E9; (s) ⊦ D2 ≠ E9; (s) ⊦ E9 ≠ E17; (s) ⊦ E9 ≠ crashed; (s) ⊦ E9 ≠ idle; (s) ⊦ E9 ≠ ready; (s) ⊦ E1 ≠ E9; (s) ⊦ D7 ≠ E9; (s) ⊦ D32 ≠ E9; (s) ⊦ D33 ≠ E9; (s) ⊦ E4 ≠ E9; (s) ⊦ E9 ≠ E16; (s) ⊦ E9 ≠ E15; (s) ⊦ E9 ≠ E14; (s) ⊦ E9 ≠ E13; (s) ⊦ E9 ≠ E12; (s) ⊦ E9 ≠ E11; (s) ⊦ E9 ≠ E10; (s) ⊦ E8 ≠ E9; (s) ⊦ E7 ≠ E9; (s) ⊦ E6 ≠ E9; (s) ⊦ E5 ≠ E9; (s) ⊦ E3 ≠ E9; (s) ⊦ E2 ≠ E9; (s) ⊦ D34 ≠ E9; (s) ⊦ D31 ≠ E9; (s) ⊦ D30 ≠ E9; (s) ⊦ D29 ≠ E9; (s) ⊦ D28 ≠ E9; (s) ⊦ D27 ≠ E9; (s) ⊦ D26 ≠ E9; (s) ⊦ D25 ≠ E9; (s) ⊦ D24 ≠ E9; (s) ⊦ D23 ≠ E9; (s) ⊦ D22 ≠ E9; (s) ⊦ D21 ≠ E9; (s) ⊦ D20 ≠ E9; (s) ⊦ D19 ≠ E9; (s) ⊦ D18 ≠ E9; (s) ⊦ D17 ≠ E9; (s) ⊦ D16 ≠ E9; (s) ⊦ D15 ≠ E9; (s) ⊦ D14 ≠ E9; (s) ⊦ D13 ≠ E9; (s) ⊦ D12 ≠ E9; (s) ⊦ D11 ≠ E9; (s) ⊦ D10 ≠ E9; (s) ⊦ D9 ≠ E9; (s) ⊦ D8 ≠ E9; (s) ⊦ D6 ≠ E9; (s) ⊦ D5 ≠ E9; (s) ⊦ D4 ≠ E9; (s) ⊦ D3 ≠ E9; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, E9, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, E9, a) = E10; (s) Used terms: gs, ls, pc

Proof step 211 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ DMSQLInv(gs, ls, pc) ↔ (pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → (ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ (pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ (pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ (pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ (pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ;gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → 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)) ∧ (pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ (gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ (pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ (pc = E9 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.nxt = null ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ (pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → 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)) ∧ (pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ (pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ (pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns)) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ (pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns))) ∧ (pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)))

A spec-lemma

Proof step 212 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs.vretRefs(tid0) = gstepf(gs, ls, E9, a).vretRefs(tid0), gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = E9, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, E9, a).vs, gstepf(gs, ls, E9, a).ps, gstepf(gs, ls, E9, a).owns), equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, E9, a).vs, gstepf(gs, ls, E9, a).ps), nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, E9, a).vhead, gstepf(gs, ls, E9, a).vs), noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl, gstepf(gs, ls, E9, a).vs), ownsRely(tid0, gs.owns, gstepf(gs, ls, E9, a).owns), pre(gs, ls, pc, a), prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, E9, a).prvHp), rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, E9, a).rvowns, gs.vrvHp), rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, E9, a).vretRefs, gstepf(gs, ls, E9, a).vrvHp), gstepf(gs, ls, E9, a).vtail ∈ gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl from gs.vtail, gstepf(gs, ls, E9, a).phead ∈ gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl from gs.phead, gstepf(gs, ls, E9, a).vhead ∈ gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl from gs.vhead, dom gs.vrvHp ⊆ dom gstepf(gs, ls, E9, a).vrvHp, ¬ DMSQRely(gs, tid0, gs0), ∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl, ∃ rl0. gs.orl + rl0 = gstepf(gs, ls, E9, a).orl, gs.pretRefs(tid0) = gstepf(gs, ls, E9, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, E9, a).pretRefs(tid0) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQRely, seq:⊦ DMSQRely(gs, tid, gs0) ↔ (∃ 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, tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid) = gs0.vretRefs(tid) ∧ ( gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid)) ∧ rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(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(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid, gs.owns, gs0.owns), subst:[gs, tid, gs0] → [gs, tid0, gs0], <all paths>

Additional information

Used simplifier rules: ⊦ pre(gs, ls, E9, a) ↔ a = τ; (s) ⊦ gstepf(gs, ls, E9, a) = ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]) .owns:= gs.owns(ls.node; Weak(ls.tid)) ;gs ); (s) ⊦ # x = # z → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: gs, tid0, gs0

Proof step 213 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ DMSQRely(gs, tid, gs0) ↔ (∃ 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, tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid) = gs0.vretRefs(tid) ∧ (gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid)) ∧ rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(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(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid, gs.owns, gs0.owns)

A spec-lemma

Proof step 214 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = E11, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a), ¬ DMSQRely(gs, tid0, gs0) ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:rely-E11-E12, seq:⊦ ls.tid ≠ tid0 ∧ ( ( ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns (gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) )) ∧ pre(gs, ls, E11, a) ∧ pcstepf(gs, ls, E11, a) = E12 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, E11, a).orl) ∧ gstepf(gs, ls, E11, a).vtail ∈ gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl from gs.vtail ∧ gstepf(gs, ls, E11, a).phead ∈ gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl from gs.phead ∧ gstepf(gs, ls, E11, a).vhead ∈ gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl from gs.vhead ∧ equalrl (gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, E11, a).vs, gstepf(gs, ls, E11, a).ps) ∧ equalowns (gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, E11, a).vs, gstepf(gs, ls, E11, a).ps, gstepf(gs, ls, E11, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, E11, a).vretRefs(tid0) ∧ ( gs.pretRefs(tid0) = gstepf(gs, ls, E11, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, E11, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, E11, a).rvowns, gs.vrvHp) ∧ rvrely (tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, E11, a).vretRefs, gstepf(gs, ls, E11, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, E11, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, E11, a).prvHp) ∧ noidRely (tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl, gstepf(gs, ls, E11, a).vs) ∧ nextnottidRely (tid0, gs.vhead, gs.vs, gstepf(gs, ls, E11, a).vhead, gstepf(gs, ls, E11, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, E11, a).owns), subst:[ls, tid0, gs, a] → [ls, tid0, gs, a]

Additional information

Used terms: ls, tid0, gs, a

Proof step 215 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ ls.tid ≠ tid0 ∧ ( ( ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns))) ∧ pre(gs, ls, E11, a) ∧ pcstepf(gs, ls, E11, a) = E12 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, E11, a).orl) ∧ gstepf(gs, ls, E11, a).vtail ∈ gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl from gs.vtail ∧ gstepf(gs, ls, E11, a).phead ∈ gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl from gs.phead ∧ gstepf(gs, ls, E11, a).vhead ∈ gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, E11, a).vs, gstepf(gs, ls, E11, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, E11, a).vs, gstepf(gs, ls, E11, a).ps, gstepf(gs, ls, E11, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, E11, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, E11, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, E11, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, E11, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, E11, a).vretRefs, gstepf(gs, ls, E11, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, E11, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, E11, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl, gstepf(gs, ls, E11, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, E11, a).vhead, gstepf(gs, ls, E11, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, E11, a).owns)

Lemma rely-E11-E12

Proof step 216 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = E11, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a), ¬ DMSQRely(gs, tid0, gs0), ls.tid ≠ tid0 ∧ ( ( ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns))) ∧ pre(gs, ls, E11, a) ∧ pcstepf(gs, ls, E11, a) = E12 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, E11, a).orl) ∧ gstepf(gs, ls, E11, a).vtail ∈ gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl from gs.vtail ∧ gstepf(gs, ls, E11, a).phead ∈ gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl from gs.phead ∧ gstepf(gs, ls, E11, a).vhead ∈ gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, E11, a).vs, gstepf(gs, ls, E11, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, E11, a).vs, gstepf(gs, ls, E11, a).ps, gstepf(gs, ls, E11, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, E11, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, E11, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, E11, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, E11, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, E11, a).vretRefs, gstepf(gs, ls, E11, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, E11, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, E11, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl, gstepf(gs, ls, E11, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, E11, a).vhead, gstepf(gs, ls, E11, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, E11, a).owns) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 10

Additional information

Proof step 217 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = E11, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a), ¬ DMSQRely(gs, tid0, gs0) ⊦ ls.tid ≠ tid0 ∧ ( ( ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns))) ∧ pre(gs, ls, E11, a) ∧ pcstepf(gs, ls, E11, a) = E12

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQGInv, seq:⊦ DMSQGInv(gs) ↔ 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), subst:[gs] → [gs], <all paths>

Additional information

Used terms: gs

Proof step 218 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ DMSQGInv(gs) ↔ 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)

A spec-lemma

Proof step 219 from proof copied-rely-DMSQLInv (previous step) (back to tree)

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = E11, pc0 = pcstepf(gs, ls, pc, a), gs.orl ≠ [], ls.tid ≠ tid0, DMSQLInv(gs, ls, pc), 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), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, pc, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ DMSQRely(gs, tid0, gs0), ¬ 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.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.tid ≠ tid0 ∧ ( ( ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns))) ∧ pre(gs, ls, E11, a) ∧ pcstepf(gs, ls, E11, a) = E12

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQLInv, seq:⊦ DMSQLInv(gs, ls, pc) ↔ ( pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → ( ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ ( pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ ( pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ ( pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ; gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → 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)) ∧ ( pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ( gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E9 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.nxt = null ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ ( pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → 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)) ∧ ( pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ ( pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) ) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ ( pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) )) ∧ ( pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )), subst:[gs, ls, pc] → [gs, ls, pc], <all paths>

Additional information

Used simplifier rules: ⊦ gstepf(gs, ls, E11, a) = ( ( gs .ps:= gs.ps [ls.lst, gs.ps[ls.lst].next:= gs.vs[ls.lst].next ]) .qrl:= (gs.ps[ls.lst].next = gs.vs[ls.lst].next ⊃ gs.qrl ;gs.qrl + gs.vs[ls.lst].next )) .owns:= (gs.ps[ls.lst].next = gs.vs[ls.lst].next ⊃ gs.owns ;gs.owns(ls.node; None) ); (s) ⊦ x + a = x + a '; (s) ⊦ D1 ≠ E11; (s) ⊦ D2 ≠ E11; (s) ⊦ E11 ≠ E17; (s) ⊦ E11 ≠ crashed; (s) ⊦ E11 ≠ idle; (s) ⊦ E11 ≠ ready; (s) ⊦ E1 ≠ E11; (s) ⊦ D7 ≠ E11; (s) ⊦ D32 ≠ E11; (s) ⊦ D33 ≠ E11; (s) ⊦ E4 ≠ E11; (s) ⊦ E11 ≠ E16; (s) ⊦ E11 ≠ E15; (s) ⊦ E11 ≠ E14; (s) ⊦ E11 ≠ E13; (s) ⊦ E11 ≠ E12; (s) ⊦ E10 ≠ E11; (s) ⊦ E9 ≠ E11; (s) ⊦ E8 ≠ E11; (s) ⊦ E7 ≠ E11; (s) ⊦ E6 ≠ E11; (s) ⊦ E5 ≠ E11; (s) ⊦ E3 ≠ E11; (s) ⊦ E2 ≠ E11; (s) ⊦ D34 ≠ E11; (s) ⊦ D31 ≠ E11; (s) ⊦ D30 ≠ E11; (s) ⊦ D29 ≠ E11; (s) ⊦ D28 ≠ E11; (s) ⊦ D27 ≠ E11; (s) ⊦ D26 ≠ E11; (s) ⊦ D25 ≠ E11; (s) ⊦ D24 ≠ E11; (s) ⊦ D23 ≠ E11; (s) ⊦ D22 ≠ E11; (s) ⊦ D21 ≠ E11; (s) ⊦ D20 ≠ E11; (s) ⊦ D19 ≠ E11; (s) ⊦ D18 ≠ E11; (s) ⊦ D17 ≠ E11; (s) ⊦ D16 ≠ E11; (s) ⊦ D15 ≠ E11; (s) ⊦ D14 ≠ E11; (s) ⊦ D13 ≠ E11; (s) ⊦ D12 ≠ E11; (s) ⊦ D11 ≠ E11; (s) ⊦ D10 ≠ E11; (s) ⊦ D9 ≠ E11; (s) ⊦ D8 ≠ E11; (s) ⊦ D6 ≠ E11; (s) ⊦ D5 ≠ E11; (s) ⊦ D4 ≠ E11; (s) ⊦ D3 ≠ E11; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, E11, a) ↔ a = (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ doEnq(ls.tid);τ); (s) ⊦ pcstepf(gs, ls, E11, a) = E12; (s) Used terms: gs, ls, pc

Proof step 220 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ DMSQLInv(gs, ls, pc) ↔ (pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → (ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ (pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ (pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ (pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ (pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ;gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → 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)) ∧ (pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ (gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ (pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ (pc = E9 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.nxt = null ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ (pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → 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)) ∧ (pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ (pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ (pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns)) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ (pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns))) ∧ (pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)))

A spec-lemma

Proof step 221 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs.vretRefs(tid0) = gstepf(gs, ls, E11, a).vretRefs(tid0), gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = E11, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, E11, a).vs, gstepf(gs, ls, E11, a).ps, gstepf(gs, ls, E11, a).owns), equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, E11, a).vs, gstepf(gs, ls, E11, a).ps), nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, E11, a).vhead, gstepf(gs, ls, E11, a).vs), noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl, gstepf(gs, ls, E11, a).vs), ownsRely(tid0, gs.owns, gstepf(gs, ls, E11, a).owns), pre(gs, ls, pc, a), prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, E11, a).prvHp), rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, E11, a).rvowns, gs.vrvHp), rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, E11, a).vretRefs, gstepf(gs, ls, E11, a).vrvHp), gstepf(gs, ls, E11, a).vtail ∈ gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl from gs.vtail, gstepf(gs, ls, E11, a).phead ∈ gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl from gs.phead, gstepf(gs, ls, E11, a).vhead ∈ gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl from gs.vhead, dom gs.vrvHp ⊆ dom gstepf(gs, ls, E11, a).vrvHp, ¬ DMSQRely(gs, tid0, gs0), ∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl, ∃ rl0. gs.orl + rl0 = gstepf(gs, ls, E11, a).orl, gs.pretRefs(tid0) = gstepf(gs, ls, E11, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, E11, a).pretRefs(tid0) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQRely, seq:⊦ DMSQRely(gs, tid, gs0) ↔ (∃ 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, tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid) = gs0.vretRefs(tid) ∧ ( gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid)) ∧ rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(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(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid, gs.owns, gs0.owns), subst:[gs, tid, gs0] → [gs, tid0, gs0], <all paths>

Additional information

Used simplifier rules: ⊦ pre(gs, ls, E11, a) ↔ a = (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ doEnq(ls.tid);τ); (s) ⊦ x = x + y ↔ y = []; (s) ⊦ (gs.owns:= owns).vtail = gs.vtail; (s) ⊦ (gs.qrl:= qrl).vtail = gs.vtail; (s) ⊦ (gs.ps:= ps).vtail = gs.vtail; (s) ⊦ (gs.owns:= owns).phead = gs.phead; (s) ⊦ (gs.qrl:= qrl).phead = gs.phead; (s) ⊦ (gs.ps:= ps).phead = gs.phead; (s) ⊦ (gs.owns:= owns).ps = gs.ps; (s) ⊦ (gs.qrl:= qrl).ps = gs.ps; (s) ⊦ (gs.ps:= ps).ps = ps; (s) ⊦ (gs.owns:= owns).rvowns = gs.rvowns; (s) ⊦ (gs.qrl:= qrl).rvowns = gs.rvowns; (s) ⊦ (gs.ps:= ps).rvowns = gs.rvowns; (s) ⊦ rvownsrely(tid, rvowns, rvowns, vrvHp); (s) ⊦ (gs.owns:= owns).vretRefs = gs.vretRefs; (s) ⊦ (gs.qrl:= qrl).vretRefs = gs.vretRefs; (s) ⊦ (gs.ps:= ps).vretRefs = gs.vretRefs; (s) ⊦ rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs, vrvHp); (s) ⊦ (gs.owns:= owns).vrvHp = gs.vrvHp; (s) ⊦ (gs.qrl:= qrl).vrvHp = gs.vrvHp; (s) ⊦ (gs.ps:= ps).vrvHp = gs.vrvHp; (s) ⊦ # s = # s0 → (s ⊆ s0 ↔ s = s0); (s) ⊦ (gs.owns:= owns).prvHp = gs.prvHp; (s) ⊦ (gs.qrl:= qrl).prvHp = gs.prvHp; (s) ⊦ (gs.ps:= ps).prvHp = gs.prvHp; (s) ⊦ prvHpRely(vrvHp, prvHp, prvHp); (s) ⊦ (gs.owns:= owns).orl = gs.orl; (s) ⊦ (gs.qrl:= qrl).orl = gs.orl; (s) ⊦ (gs.ps:= ps).orl = gs.orl; (s) ⊦ (gs.owns:= owns).qrl = gs.qrl; (s) ⊦ (gs.qrl:= qrl).qrl = qrl; (s) ⊦ (gs.owns:= owns).vhead = gs.vhead; (s) ⊦ (gs.qrl:= qrl).vhead = gs.vhead; (s) ⊦ (gs.ps:= ps).vhead = gs.vhead; (s) ⊦ (gs.owns:= owns).vs = gs.vs; (s) ⊦ (gs.qrl:= qrl).vs = gs.vs; (s) ⊦ (gs.ps:= ps).vs = gs.vs; (s) ⊦ nextnottidRely(tid, vhead, vs, vhead, vs); (s) ⊦ (gs.owns:= owns).owns = owns; (s) ⊦ gstepf(gs, ls, E11, a) = ( ( gs .ps:= gs.ps [ls.lst, gs.ps[ls.lst].next:= gs.vs[ls.lst].next ]) .qrl:= (gs.ps[ls.lst].next = gs.vs[ls.lst].next ⊃ gs.qrl ;gs.qrl + gs.vs[ls.lst].next )) .owns:= (gs.ps[ls.lst].next = gs.vs[ls.lst].next ⊃ gs.owns ;gs.owns(ls.node; None) ); (s) ⊦ x + a = x + a '; (s) ⊦ (gs.owns:= owns).pretRefs = gs.pretRefs; (s) ⊦ (gs.qrl:= qrl).pretRefs = gs.pretRefs; (s) ⊦ (gs.ps:= ps).pretRefs = gs.pretRefs; (s) ⊦ # x = # z → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: gs, tid0, gs0

Proof step 222 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ DMSQRely(gs, tid, gs0) ↔ (∃ 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, tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid) = gs0.vretRefs(tid) ∧ (gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid)) ∧ rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(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(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid, gs.owns, gs0.owns)

A spec-lemma

Proof step 223 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = E12, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a), ¬ DMSQRely(gs, tid0, gs0) ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:rely-E12-E4, seq:⊦ ls.tid ≠ tid0 ∧ ( ( ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns (gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, E12, a) ∧ pcstepf(gs, ls, E12, a) = E4 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, E12, a).orl + gstepf(gs, ls, E12, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, E12, a).orl) ∧ gstepf(gs, ls, E12, a).vtail ∈ gstepf(gs, ls, E12, a).orl + gstepf(gs, ls, E12, a).qrl from gs.vtail ∧ gstepf(gs, ls, E12, a).phead ∈ gstepf(gs, ls, E12, a).orl + gstepf(gs, ls, E12, a).qrl from gs.phead ∧ gstepf(gs, ls, E12, a).vhead ∈ gstepf(gs, ls, E12, a).orl + gstepf(gs, ls, E12, a).qrl from gs.vhead ∧ equalrl (gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, E12, a).vs, gstepf(gs, ls, E12, a).ps) ∧ equalowns (gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, E12, a).vs, gstepf(gs, ls, E12, a).ps, gstepf(gs, ls, E12, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, E12, a).vretRefs(tid0) ∧ ( gs.pretRefs(tid0) = gstepf(gs, ls, E12, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, E12, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, E12, a).rvowns, gs.vrvHp) ∧ rvrely (tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, E12, a).vretRefs, gstepf(gs, ls, E12, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, E12, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, E12, a).prvHp) ∧ noidRely (tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, E12, a).orl + gstepf(gs, ls, E12, a).qrl, gstepf(gs, ls, E12, a).vs) ∧ nextnottidRely (tid0, gs.vhead, gs.vs, gstepf(gs, ls, E12, a).vhead, gstepf(gs, ls, E12, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, E12, a).owns), subst:[ls, tid0, gs, a] → [ls, tid0, gs, a]

Additional information

Used terms: ls, tid0, gs, a

Proof step 224 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ ls.tid ≠ tid0 ∧ ( ( ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, E12, a) ∧ pcstepf(gs, ls, E12, a) = E4 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, E12, a).orl + gstepf(gs, ls, E12, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, E12, a).orl) ∧ gstepf(gs, ls, E12, a).vtail ∈ gstepf(gs, ls, E12, a).orl + gstepf(gs, ls, E12, a).qrl from gs.vtail ∧ gstepf(gs, ls, E12, a).phead ∈ gstepf(gs, ls, E12, a).orl + gstepf(gs, ls, E12, a).qrl from gs.phead ∧ gstepf(gs, ls, E12, a).vhead ∈ gstepf(gs, ls, E12, a).orl + gstepf(gs, ls, E12, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, E12, a).vs, gstepf(gs, ls, E12, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, E12, a).vs, gstepf(gs, ls, E12, a).ps, gstepf(gs, ls, E12, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, E12, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, E12, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, E12, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, E12, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, E12, a).vretRefs, gstepf(gs, ls, E12, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, E12, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, E12, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, E12, a).orl + gstepf(gs, ls, E12, a).qrl, gstepf(gs, ls, E12, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, E12, a).vhead, gstepf(gs, ls, E12, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, E12, a).owns)

Lemma rely-E12-E4

Proof step 225 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = E12, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a), ¬ DMSQRely(gs, tid0, gs0), ls.tid ≠ tid0 ∧ ( ( ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, E12, a) ∧ pcstepf(gs, ls, E12, a) = E4 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, E12, a).orl + gstepf(gs, ls, E12, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, E12, a).orl) ∧ gstepf(gs, ls, E12, a).vtail ∈ gstepf(gs, ls, E12, a).orl + gstepf(gs, ls, E12, a).qrl from gs.vtail ∧ gstepf(gs, ls, E12, a).phead ∈ gstepf(gs, ls, E12, a).orl + gstepf(gs, ls, E12, a).qrl from gs.phead ∧ gstepf(gs, ls, E12, a).vhead ∈ gstepf(gs, ls, E12, a).orl + gstepf(gs, ls, E12, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, E12, a).vs, gstepf(gs, ls, E12, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, E12, a).vs, gstepf(gs, ls, E12, a).ps, gstepf(gs, ls, E12, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, E12, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, E12, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, E12, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, E12, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, E12, a).vretRefs, gstepf(gs, ls, E12, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, E12, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, E12, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, E12, a).orl + gstepf(gs, ls, E12, a).qrl, gstepf(gs, ls, E12, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, E12, a).vhead, gstepf(gs, ls, E12, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, E12, a).owns) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 10

Additional information

Proof step 226 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = E12, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a), ¬ DMSQRely(gs, tid0, gs0) ⊦ ls.tid ≠ tid0 ∧ ( ( ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, E12, a) ∧ pcstepf(gs, ls, E12, a) = E4

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQGInv, seq:⊦ DMSQGInv(gs) ↔ 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), subst:[gs] → [gs], <all paths>

Additional information

Used terms: gs

Proof step 227 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ DMSQGInv(gs) ↔ 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)

A spec-lemma

Proof step 228 from proof copied-rely-DMSQLInv (previous step) (back to tree)

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = E12, pc0 = pcstepf(gs, ls, pc, a), gs.orl ≠ [], ls.tid ≠ tid0, DMSQLInv(gs, ls, pc), 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), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, pc, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ DMSQRely(gs, tid0, gs0), ¬ 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.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.tid ≠ tid0 ∧ ( ( ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, E12, a) ∧ pcstepf(gs, ls, E12, a) = E4

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQLInv, seq:⊦ DMSQLInv(gs, ls, pc) ↔ ( pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → ( ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ ( pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ ( pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ ( pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ; gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → 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)) ∧ ( pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ( gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E9 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.nxt = null ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ ( pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → 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)) ∧ ( pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ ( pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) ) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ ( pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) )) ∧ ( pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )), subst:[gs, ls, pc] → [gs, ls, pc], <all paths>

Additional information

Used simplifier rules: ⊦ gstepf(gs, ls, E12, a) = (gs.vtail = ls.lst ⊃ gs.vtail:= ls.node;gs); (s) ⊦ D1 ≠ E12; (s) ⊦ D2 ≠ E12; (s) ⊦ E12 ≠ crashed; (s) ⊦ E12 ≠ idle; (s) ⊦ E12 ≠ ready; (s) ⊦ E1 ≠ E12; (s) ⊦ D7 ≠ E12; (s) ⊦ D32 ≠ E12; (s) ⊦ D33 ≠ E12; (s) ⊦ E4 ≠ E12; (s) ⊦ E12 ≠ E16; (s) ⊦ E12 ≠ E15; (s) ⊦ E12 ≠ E14; (s) ⊦ E12 ≠ E13; (s) ⊦ E11 ≠ E12; (s) ⊦ E10 ≠ E12; (s) ⊦ E9 ≠ E12; (s) ⊦ E8 ≠ E12; (s) ⊦ E7 ≠ E12; (s) ⊦ E6 ≠ E12; (s) ⊦ E5 ≠ E12; (s) ⊦ E3 ≠ E12; (s) ⊦ E2 ≠ E12; (s) ⊦ D34 ≠ E12; (s) ⊦ D31 ≠ E12; (s) ⊦ D30 ≠ E12; (s) ⊦ D29 ≠ E12; (s) ⊦ D28 ≠ E12; (s) ⊦ D27 ≠ E12; (s) ⊦ D26 ≠ E12; (s) ⊦ D25 ≠ E12; (s) ⊦ D24 ≠ E12; (s) ⊦ D23 ≠ E12; (s) ⊦ D22 ≠ E12; (s) ⊦ D21 ≠ E12; (s) ⊦ D20 ≠ E12; (s) ⊦ D19 ≠ E12; (s) ⊦ D18 ≠ E12; (s) ⊦ D17 ≠ E12; (s) ⊦ D16 ≠ E12; (s) ⊦ D15 ≠ E12; (s) ⊦ D14 ≠ E12; (s) ⊦ D13 ≠ E12; (s) ⊦ D12 ≠ E12; (s) ⊦ D11 ≠ E12; (s) ⊦ D10 ≠ E12; (s) ⊦ D9 ≠ E12; (s) ⊦ D8 ≠ E12; (s) ⊦ D6 ≠ E12; (s) ⊦ D5 ≠ E12; (s) ⊦ D4 ≠ E12; (s) ⊦ D3 ≠ E12; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, E12, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, E12, a) = E4; (s) Used terms: gs, ls, pc

Proof step 229 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ DMSQLInv(gs, ls, pc) ↔ (pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → (ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ (pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ (pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ (pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ (pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ;gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → 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)) ∧ (pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ (gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ (pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ (pc = E9 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.nxt = null ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ (pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → 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)) ∧ (pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ (pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ (pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns)) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ (pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns))) ∧ (pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)))

A spec-lemma

Proof step 230 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs.vretRefs(tid0) = gstepf(gs, ls, E12, a).vretRefs(tid0), gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = E12, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, E12, a).vs, gstepf(gs, ls, E12, a).ps, gstepf(gs, ls, E12, a).owns), equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, E12, a).vs, gstepf(gs, ls, E12, a).ps), nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, E12, a).vhead, gstepf(gs, ls, E12, a).vs), noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, E12, a).orl + gstepf(gs, ls, E12, a).qrl, gstepf(gs, ls, E12, a).vs), ownsRely(tid0, gs.owns, gstepf(gs, ls, E12, a).owns), pre(gs, ls, pc, a), prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, E12, a).prvHp), rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, E12, a).rvowns, gs.vrvHp), rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, E12, a).vretRefs, gstepf(gs, ls, E12, a).vrvHp), gstepf(gs, ls, E12, a).vtail ∈ gstepf(gs, ls, E12, a).orl + gstepf(gs, ls, E12, a).qrl from gs.vtail, gstepf(gs, ls, E12, a).phead ∈ gstepf(gs, ls, E12, a).orl + gstepf(gs, ls, E12, a).qrl from gs.phead, gstepf(gs, ls, E12, a).vhead ∈ gstepf(gs, ls, E12, a).orl + gstepf(gs, ls, E12, a).qrl from gs.vhead, dom gs.vrvHp ⊆ dom gstepf(gs, ls, E12, a).vrvHp, ¬ DMSQRely(gs, tid0, gs0), ∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, E12, a).orl + gstepf(gs, ls, E12, a).qrl, ∃ rl0. gs.orl + rl0 = gstepf(gs, ls, E12, a).orl, gs.pretRefs(tid0) = gstepf(gs, ls, E12, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, E12, a).pretRefs(tid0) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQRely, seq:⊦ DMSQRely(gs, tid, gs0) ↔ (∃ 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, tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid) = gs0.vretRefs(tid) ∧ ( gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid)) ∧ rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(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(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid, gs.owns, gs0.owns), subst:[gs, tid, gs0] → [gs, tid0, gs0], <all paths>

Additional information

Used simplifier rules: ⊦ pre(gs, ls, E12, a) ↔ a = τ; (s) ⊦ gstepf(gs, ls, E12, a) = (gs.vtail = ls.lst ⊃ gs.vtail:= ls.node;gs); (s) ⊦ # x = # z → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: gs, tid0, gs0

Proof step 231 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ DMSQRely(gs, tid, gs0) ↔ (∃ 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, tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid) = gs0.vretRefs(tid) ∧ (gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid)) ∧ rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(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(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid, gs.owns, gs0.owns)

A spec-lemma

Proof step 232 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = E14, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a), ¬ DMSQRely(gs, tid0, gs0) ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:rely-E14-E15, seq:⊦ ls.tid ≠ tid0 ∧ ( ( gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( 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, E14, a) ∧ pcstepf(gs, ls, E14, a) = E15 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, E14, a).orl) ∧ gstepf(gs, ls, E14, a).vtail ∈ gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl from gs.vtail ∧ gstepf(gs, ls, E14, a).phead ∈ gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl from gs.phead ∧ gstepf(gs, ls, E14, a).vhead ∈ gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl from gs.vhead ∧ equalrl (gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, E14, a).vs, gstepf(gs, ls, E14, a).ps) ∧ equalowns (gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, E14, a).vs, gstepf(gs, ls, E14, a).ps, gstepf(gs, ls, E14, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, E14, a).vretRefs(tid0) ∧ ( gs.pretRefs(tid0) = gstepf(gs, ls, E14, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, E14, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, E14, a).rvowns, gs.vrvHp) ∧ rvrely (tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, E14, a).vretRefs, gstepf(gs, ls, E14, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, E14, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, E14, a).prvHp) ∧ noidRely (tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl, gstepf(gs, ls, E14, a).vs) ∧ nextnottidRely (tid0, gs.vhead, gs.vs, gstepf(gs, ls, E14, a).vhead, gstepf(gs, ls, E14, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, E14, a).owns), subst:[ls, tid0, gs, a] → [ls, tid0, gs, a]

Additional information

Used terms: ls, tid0, gs, a

Proof step 233 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ ls.tid ≠ tid0 ∧ ( (gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( 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, E14, a) ∧ pcstepf(gs, ls, E14, a) = E15 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, E14, a).orl) ∧ gstepf(gs, ls, E14, a).vtail ∈ gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl from gs.vtail ∧ gstepf(gs, ls, E14, a).phead ∈ gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl from gs.phead ∧ gstepf(gs, ls, E14, a).vhead ∈ gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, E14, a).vs, gstepf(gs, ls, E14, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, E14, a).vs, gstepf(gs, ls, E14, a).ps, gstepf(gs, ls, E14, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, E14, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, E14, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, E14, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, E14, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, E14, a).vretRefs, gstepf(gs, ls, E14, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, E14, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, E14, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl, gstepf(gs, ls, E14, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, E14, a).vhead, gstepf(gs, ls, E14, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, E14, a).owns)

Lemma rely-E14-E15

Proof step 234 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = E14, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a), ¬ DMSQRely(gs, tid0, gs0), ls.tid ≠ tid0 ∧ ( (gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( 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, E14, a) ∧ pcstepf(gs, ls, E14, a) = E15 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, E14, a).orl) ∧ gstepf(gs, ls, E14, a).vtail ∈ gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl from gs.vtail ∧ gstepf(gs, ls, E14, a).phead ∈ gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl from gs.phead ∧ gstepf(gs, ls, E14, a).vhead ∈ gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, E14, a).vs, gstepf(gs, ls, E14, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, E14, a).vs, gstepf(gs, ls, E14, a).ps, gstepf(gs, ls, E14, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, E14, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, E14, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, E14, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, E14, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, E14, a).vretRefs, gstepf(gs, ls, E14, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, E14, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, E14, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl, gstepf(gs, ls, E14, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, E14, a).vhead, gstepf(gs, ls, E14, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, E14, a).owns) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 10

Additional information

Proof step 235 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = E14, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a), ¬ DMSQRely(gs, tid0, gs0) ⊦ ls.tid ≠ tid0 ∧ ( (gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( 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, E14, a) ∧ pcstepf(gs, ls, E14, a) = E15

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQGInv, seq:⊦ DMSQGInv(gs) ↔ 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), subst:[gs] → [gs], <all paths>

Additional information

Used terms: gs

Proof step 236 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ DMSQGInv(gs) ↔ 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)

A spec-lemma

Proof step 237 from proof copied-rely-DMSQLInv (previous step) (back to tree)

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = E14, pc0 = pcstepf(gs, ls, pc, a), gs.orl ≠ [], ls.tid ≠ tid0, DMSQLInv(gs, ls, pc), 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), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, pc, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ DMSQRely(gs, tid0, gs0), ¬ 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.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.tid ≠ tid0 ∧ ( (gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( 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, E14, a) ∧ pcstepf(gs, ls, E14, a) = E15

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQLInv, seq:⊦ DMSQLInv(gs, ls, pc) ↔ ( pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → ( ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ ( pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ ( pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ ( pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ; gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → 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)) ∧ ( pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ( gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E9 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.nxt = null ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ ( pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → 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)) ∧ ( pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ ( pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) ) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ ( pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) )) ∧ ( pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )), subst:[gs, ls, pc] → [gs, ls, pc], <all paths>

Additional information

Used simplifier rules: ⊦ gstepf(gs, ls, E14, a) = ( ( gs .ps:= gs.ps [ls.lst, gs.ps[ls.lst].next:= gs.vs[ls.lst].next ]) .qrl:= (ls.lst = (gs.orl + gs.qrl).last ⊃ gs.qrl + gs.vs[ls.lst].next ;gs.qrl )) .owns:= (ls.lst = (gs.orl + gs.qrl).last ⊃ gs.owns(gs.vs[ls.lst].next; None) ;gs.owns ); (s) ⊦ x + a = x + a '; (s) ⊦ D1 ≠ E14; (s) ⊦ D2 ≠ E14; (s) ⊦ E14 ≠ E17; (s) ⊦ E14 ≠ crashed; (s) ⊦ E14 ≠ idle; (s) ⊦ E14 ≠ ready; (s) ⊦ E1 ≠ E14; (s) ⊦ D7 ≠ E14; (s) ⊦ D32 ≠ E14; (s) ⊦ D33 ≠ E14; (s) ⊦ E4 ≠ E14; (s) ⊦ E14 ≠ E16; (s) ⊦ E14 ≠ E15; (s) ⊦ E13 ≠ E14; (s) ⊦ E12 ≠ E14; (s) ⊦ E11 ≠ E14; (s) ⊦ E10 ≠ E14; (s) ⊦ E9 ≠ E14; (s) ⊦ E8 ≠ E14; (s) ⊦ E7 ≠ E14; (s) ⊦ E6 ≠ E14; (s) ⊦ E5 ≠ E14; (s) ⊦ E3 ≠ E14; (s) ⊦ E2 ≠ E14; (s) ⊦ D34 ≠ E14; (s) ⊦ D31 ≠ E14; (s) ⊦ D30 ≠ E14; (s) ⊦ D29 ≠ E14; (s) ⊦ D28 ≠ E14; (s) ⊦ D27 ≠ E14; (s) ⊦ D26 ≠ E14; (s) ⊦ D25 ≠ E14; (s) ⊦ D24 ≠ E14; (s) ⊦ D23 ≠ E14; (s) ⊦ D22 ≠ E14; (s) ⊦ D21 ≠ E14; (s) ⊦ D20 ≠ E14; (s) ⊦ D19 ≠ E14; (s) ⊦ D18 ≠ E14; (s) ⊦ D17 ≠ E14; (s) ⊦ D16 ≠ E14; (s) ⊦ D15 ≠ E14; (s) ⊦ D14 ≠ E14; (s) ⊦ D13 ≠ E14; (s) ⊦ D12 ≠ E14; (s) ⊦ D11 ≠ E14; (s) ⊦ D10 ≠ E14; (s) ⊦ D9 ≠ E14; (s) ⊦ D8 ≠ E14; (s) ⊦ D6 ≠ E14; (s) ⊦ D5 ≠ E14; (s) ⊦ D4 ≠ E14; (s) ⊦ D3 ≠ E14; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, E14, a) ↔ a = (ls.lst = (gs.orl + gs.qrl).last ⊃ doEnq(gs.owns(ls.nxt).tid);τ); (s) ⊦ pcstepf(gs, ls, E14, a) = E15; (s) Used terms: gs, ls, pc

Proof step 238 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ DMSQLInv(gs, ls, pc) ↔ (pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → (ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ (pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ (pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ (pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ (pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ;gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → 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)) ∧ (pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ (gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ (pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ (pc = E9 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.nxt = null ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ (pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → 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)) ∧ (pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ (pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ (pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns)) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ (pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns))) ∧ (pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)))

A spec-lemma

Proof step 239 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs.vretRefs(tid0) = gstepf(gs, ls, E14, a).vretRefs(tid0), gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = E14, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, E14, a).vs, gstepf(gs, ls, E14, a).ps, gstepf(gs, ls, E14, a).owns), equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, E14, a).vs, gstepf(gs, ls, E14, a).ps), nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, E14, a).vhead, gstepf(gs, ls, E14, a).vs), noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl, gstepf(gs, ls, E14, a).vs), ownsRely(tid0, gs.owns, gstepf(gs, ls, E14, a).owns), pre(gs, ls, pc, a), prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, E14, a).prvHp), rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, E14, a).rvowns, gs.vrvHp), rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, E14, a).vretRefs, gstepf(gs, ls, E14, a).vrvHp), gstepf(gs, ls, E14, a).vtail ∈ gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl from gs.vtail, gstepf(gs, ls, E14, a).phead ∈ gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl from gs.phead, gstepf(gs, ls, E14, a).vhead ∈ gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl from gs.vhead, dom gs.vrvHp ⊆ dom gstepf(gs, ls, E14, a).vrvHp, ¬ DMSQRely(gs, tid0, gs0), ∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl, ∃ rl0. gs.orl + rl0 = gstepf(gs, ls, E14, a).orl, gs.pretRefs(tid0) = gstepf(gs, ls, E14, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, E14, a).pretRefs(tid0) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQRely, seq:⊦ DMSQRely(gs, tid, gs0) ↔ (∃ 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, tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid) = gs0.vretRefs(tid) ∧ ( gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid)) ∧ rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(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(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid, gs.owns, gs0.owns), subst:[gs, tid, gs0] → [gs, tid0, gs0], <all paths>

Additional information

Used simplifier rules: ⊦ pre(gs, ls, E14, a) ↔ a = (ls.lst = (gs.orl + gs.qrl).last ⊃ doEnq(gs.owns(ls.nxt).tid);τ); (s) ⊦ x = x + y ↔ y = []; (s) ⊦ (gs.owns:= owns).vtail = gs.vtail; (s) ⊦ (gs.qrl:= qrl).vtail = gs.vtail; (s) ⊦ (gs.ps:= ps).vtail = gs.vtail; (s) ⊦ (gs.owns:= owns).phead = gs.phead; (s) ⊦ (gs.qrl:= qrl).phead = gs.phead; (s) ⊦ (gs.ps:= ps).phead = gs.phead; (s) ⊦ (gs.owns:= owns).ps = gs.ps; (s) ⊦ (gs.qrl:= qrl).ps = gs.ps; (s) ⊦ (gs.ps:= ps).ps = ps; (s) ⊦ (gs.owns:= owns).rvowns = gs.rvowns; (s) ⊦ (gs.qrl:= qrl).rvowns = gs.rvowns; (s) ⊦ (gs.ps:= ps).rvowns = gs.rvowns; (s) ⊦ rvownsrely(tid, rvowns, rvowns, vrvHp); (s) ⊦ (gs.owns:= owns).vretRefs = gs.vretRefs; (s) ⊦ (gs.qrl:= qrl).vretRefs = gs.vretRefs; (s) ⊦ (gs.ps:= ps).vretRefs = gs.vretRefs; (s) ⊦ rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs, vrvHp); (s) ⊦ (gs.owns:= owns).vrvHp = gs.vrvHp; (s) ⊦ (gs.qrl:= qrl).vrvHp = gs.vrvHp; (s) ⊦ (gs.ps:= ps).vrvHp = gs.vrvHp; (s) ⊦ # s = # s0 → (s ⊆ s0 ↔ s = s0); (s) ⊦ (gs.owns:= owns).prvHp = gs.prvHp; (s) ⊦ (gs.qrl:= qrl).prvHp = gs.prvHp; (s) ⊦ (gs.ps:= ps).prvHp = gs.prvHp; (s) ⊦ prvHpRely(vrvHp, prvHp, prvHp); (s) ⊦ (gs.owns:= owns).orl = gs.orl; (s) ⊦ (gs.qrl:= qrl).orl = gs.orl; (s) ⊦ (gs.ps:= ps).orl = gs.orl; (s) ⊦ (gs.owns:= owns).qrl = gs.qrl; (s) ⊦ (gs.qrl:= qrl).qrl = qrl; (s) ⊦ (gs.owns:= owns).vhead = gs.vhead; (s) ⊦ (gs.qrl:= qrl).vhead = gs.vhead; (s) ⊦ (gs.ps:= ps).vhead = gs.vhead; (s) ⊦ (gs.owns:= owns).vs = gs.vs; (s) ⊦ (gs.qrl:= qrl).vs = gs.vs; (s) ⊦ (gs.ps:= ps).vs = gs.vs; (s) ⊦ nextnottidRely(tid, vhead, vs, vhead, vs); (s) ⊦ (gs.owns:= owns).owns = owns; (s) ⊦ gstepf(gs, ls, E14, a) = ( ( gs .ps:= gs.ps [ls.lst, gs.ps[ls.lst].next:= gs.vs[ls.lst].next ]) .qrl:= (ls.lst = (gs.orl + gs.qrl).last ⊃ gs.qrl + gs.vs[ls.lst].next ;gs.qrl )) .owns:= (ls.lst = (gs.orl + gs.qrl).last ⊃ gs.owns(gs.vs[ls.lst].next; None) ;gs.owns ); (s) ⊦ x + a = x + a '; (s) ⊦ (gs.owns:= owns).pretRefs = gs.pretRefs; (s) ⊦ (gs.qrl:= qrl).pretRefs = gs.pretRefs; (s) ⊦ (gs.ps:= ps).pretRefs = gs.pretRefs; (s) ⊦ # x = # z → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: gs, tid0, gs0

Proof step 240 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ DMSQRely(gs, tid, gs0) ↔ (∃ 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, tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid) = gs0.vretRefs(tid) ∧ (gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid)) ∧ rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(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(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid, gs.owns, gs0.owns)

A spec-lemma

Proof step 241 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = E15, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a), ¬ DMSQRely(gs, tid0, gs0) ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:rely-E15-E4, seq:⊦ ls.tid ≠ tid0 ∧ ( ( gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( 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, E15, a) ∧ pcstepf(gs, ls, E15, a) = E4 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, E15, a).orl + gstepf(gs, ls, E15, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, E15, a).orl) ∧ gstepf(gs, ls, E15, a).vtail ∈ gstepf(gs, ls, E15, a).orl + gstepf(gs, ls, E15, a).qrl from gs.vtail ∧ gstepf(gs, ls, E15, a).phead ∈ gstepf(gs, ls, E15, a).orl + gstepf(gs, ls, E15, a).qrl from gs.phead ∧ gstepf(gs, ls, E15, a).vhead ∈ gstepf(gs, ls, E15, a).orl + gstepf(gs, ls, E15, a).qrl from gs.vhead ∧ equalrl (gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, E15, a).vs, gstepf(gs, ls, E15, a).ps) ∧ equalowns (gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, E15, a).vs, gstepf(gs, ls, E15, a).ps, gstepf(gs, ls, E15, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, E15, a).vretRefs(tid0) ∧ ( gs.pretRefs(tid0) = gstepf(gs, ls, E15, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, E15, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, E15, a).rvowns, gs.vrvHp) ∧ rvrely (tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, E15, a).vretRefs, gstepf(gs, ls, E15, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, E15, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, E15, a).prvHp) ∧ noidRely (tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, E15, a).orl + gstepf(gs, ls, E15, a).qrl, gstepf(gs, ls, E15, a).vs) ∧ nextnottidRely (tid0, gs.vhead, gs.vs, gstepf(gs, ls, E15, a).vhead, gstepf(gs, ls, E15, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, E15, a).owns), subst:[ls, tid0, gs, a] → [ls, tid0, gs, a]

Additional information

Used terms: ls, tid0, gs, a

Proof step 242 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ ls.tid ≠ tid0 ∧ ( (gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( 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, E15, a) ∧ pcstepf(gs, ls, E15, a) = E4 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, E15, a).orl + gstepf(gs, ls, E15, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, E15, a).orl) ∧ gstepf(gs, ls, E15, a).vtail ∈ gstepf(gs, ls, E15, a).orl + gstepf(gs, ls, E15, a).qrl from gs.vtail ∧ gstepf(gs, ls, E15, a).phead ∈ gstepf(gs, ls, E15, a).orl + gstepf(gs, ls, E15, a).qrl from gs.phead ∧ gstepf(gs, ls, E15, a).vhead ∈ gstepf(gs, ls, E15, a).orl + gstepf(gs, ls, E15, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, E15, a).vs, gstepf(gs, ls, E15, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, E15, a).vs, gstepf(gs, ls, E15, a).ps, gstepf(gs, ls, E15, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, E15, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, E15, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, E15, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, E15, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, E15, a).vretRefs, gstepf(gs, ls, E15, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, E15, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, E15, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, E15, a).orl + gstepf(gs, ls, E15, a).qrl, gstepf(gs, ls, E15, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, E15, a).vhead, gstepf(gs, ls, E15, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, E15, a).owns)

Lemma rely-E15-E4

Proof step 243 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = E15, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a), ¬ DMSQRely(gs, tid0, gs0), ls.tid ≠ tid0 ∧ ( (gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( 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, E15, a) ∧ pcstepf(gs, ls, E15, a) = E4 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, E15, a).orl + gstepf(gs, ls, E15, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, E15, a).orl) ∧ gstepf(gs, ls, E15, a).vtail ∈ gstepf(gs, ls, E15, a).orl + gstepf(gs, ls, E15, a).qrl from gs.vtail ∧ gstepf(gs, ls, E15, a).phead ∈ gstepf(gs, ls, E15, a).orl + gstepf(gs, ls, E15, a).qrl from gs.phead ∧ gstepf(gs, ls, E15, a).vhead ∈ gstepf(gs, ls, E15, a).orl + gstepf(gs, ls, E15, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, E15, a).vs, gstepf(gs, ls, E15, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, E15, a).vs, gstepf(gs, ls, E15, a).ps, gstepf(gs, ls, E15, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, E15, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, E15, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, E15, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, E15, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, E15, a).vretRefs, gstepf(gs, ls, E15, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, E15, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, E15, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, E15, a).orl + gstepf(gs, ls, E15, a).qrl, gstepf(gs, ls, E15, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, E15, a).vhead, gstepf(gs, ls, E15, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, E15, a).owns) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 10

Additional information

Proof step 244 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = E15, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a), ¬ DMSQRely(gs, tid0, gs0) ⊦ ls.tid ≠ tid0 ∧ ( (gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( 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, E15, a) ∧ pcstepf(gs, ls, E15, a) = E4

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQGInv, seq:⊦ DMSQGInv(gs) ↔ 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), subst:[gs] → [gs], <all paths>

Additional information

Used terms: gs

Proof step 245 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ DMSQGInv(gs) ↔ 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)

A spec-lemma

Proof step 246 from proof copied-rely-DMSQLInv (previous step) (back to tree)

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = E15, pc0 = pcstepf(gs, ls, pc, a), gs.orl ≠ [], ls.tid ≠ tid0, DMSQLInv(gs, ls, pc), 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), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, pc, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ DMSQRely(gs, tid0, gs0), ¬ 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.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.tid ≠ tid0 ∧ ( (gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( 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, E15, a) ∧ pcstepf(gs, ls, E15, a) = E4

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQLInv, seq:⊦ DMSQLInv(gs, ls, pc) ↔ ( pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → ( ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ ( pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ ( pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ ( pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ; gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → 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)) ∧ ( pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ( gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E9 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.nxt = null ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ ( pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → 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)) ∧ ( pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ ( pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) ) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ ( pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) )) ∧ ( pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )), subst:[gs, ls, pc] → [gs, ls, pc], <all paths>

Additional information

Used simplifier rules: ⊦ gstepf(gs, ls, E15, a) = (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs); (s) ⊦ D1 ≠ E15; (s) ⊦ D2 ≠ E15; (s) ⊦ E15 ≠ E17; (s) ⊦ E15 ≠ crashed; (s) ⊦ E15 ≠ idle; (s) ⊦ E15 ≠ ready; (s) ⊦ E1 ≠ E15; (s) ⊦ D7 ≠ E15; (s) ⊦ D32 ≠ E15; (s) ⊦ D33 ≠ E15; (s) ⊦ E4 ≠ E15; (s) ⊦ E15 ≠ E16; (s) ⊦ E14 ≠ E15; (s) ⊦ E13 ≠ E15; (s) ⊦ E12 ≠ E15; (s) ⊦ E11 ≠ E15; (s) ⊦ E10 ≠ E15; (s) ⊦ E9 ≠ E15; (s) ⊦ E8 ≠ E15; (s) ⊦ E7 ≠ E15; (s) ⊦ E6 ≠ E15; (s) ⊦ E5 ≠ E15; (s) ⊦ E3 ≠ E15; (s) ⊦ E2 ≠ E15; (s) ⊦ D34 ≠ E15; (s) ⊦ D31 ≠ E15; (s) ⊦ D30 ≠ E15; (s) ⊦ D29 ≠ E15; (s) ⊦ D28 ≠ E15; (s) ⊦ D27 ≠ E15; (s) ⊦ D26 ≠ E15; (s) ⊦ D25 ≠ E15; (s) ⊦ D24 ≠ E15; (s) ⊦ D23 ≠ E15; (s) ⊦ D22 ≠ E15; (s) ⊦ D21 ≠ E15; (s) ⊦ D20 ≠ E15; (s) ⊦ D19 ≠ E15; (s) ⊦ D18 ≠ E15; (s) ⊦ D17 ≠ E15; (s) ⊦ D16 ≠ E15; (s) ⊦ D15 ≠ E15; (s) ⊦ D14 ≠ E15; (s) ⊦ D13 ≠ E15; (s) ⊦ D12 ≠ E15; (s) ⊦ D11 ≠ E15; (s) ⊦ D10 ≠ E15; (s) ⊦ D9 ≠ E15; (s) ⊦ D8 ≠ E15; (s) ⊦ D6 ≠ E15; (s) ⊦ D5 ≠ E15; (s) ⊦ D4 ≠ E15; (s) ⊦ D3 ≠ E15; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, E15, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, E15, a) = E4; (s) Used terms: gs, ls, pc

Proof step 247 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ DMSQLInv(gs, ls, pc) ↔ (pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → (ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ (pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ (pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ (pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ (pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ;gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → 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)) ∧ (pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ (gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ (pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ (pc = E9 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.nxt = null ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ (pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → 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)) ∧ (pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ (pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ (pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns)) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ (pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns))) ∧ (pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)))

A spec-lemma

Proof step 248 from proof copied-rely-DMSQLInv (previous step) (back to tree)

gs.vretRefs(tid0) = gstepf(gs, ls, E15, a).vretRefs(tid0), gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = E15, pc0 = pcstepf(gs, ls, pc, a), ls.tid ≠ tid0, DMSQGInv(gs), DMSQLInv(gs, ls, pc), equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, E15, a).vs, gstepf(gs, ls, E15, a).ps, gstepf(gs, ls, E15, a).owns), equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, E15, a).vs, gstepf(gs, ls, E15, a).ps), nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, E15, a).vhead, gstepf(gs, ls, E15, a).vs), noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, E15, a).orl + gstepf(gs, ls, E15, a).qrl, gstepf(gs, ls, E15, a).vs), ownsRely(tid0, gs.owns, gstepf(gs, ls, E15, a).owns), pre(gs, ls, pc, a), prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, E15, a).prvHp), rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, E15, a).rvowns, gs.vrvHp), rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, E15, a).vretRefs, gstepf(gs, ls, E15, a).vrvHp), gstepf(gs, ls, E15, a).vtail ∈ gstepf(gs, ls, E15, a).orl + gstepf(gs, ls, E15, a).qrl from gs.vtail, gstepf(gs, ls, E15, a).phead ∈ gstepf(gs, ls, E15, a).orl + gstepf(gs, ls, E15, a).qrl from gs.phead, gstepf(gs, ls, E15, a).vhead ∈ gstepf(gs, ls, E15, a).orl + gstepf(gs, ls, E15, a).qrl from gs.vhead, dom gs.vrvHp ⊆ dom gstepf(gs, ls, E15, a).vrvHp, ¬ DMSQRely(gs, tid0, gs0), ∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, E15, a).orl + gstepf(gs, ls, E15, a).qrl, ∃ rl0. gs.orl + rl0 = gstepf(gs, ls, E15, a).orl, gs.pretRefs(tid0) = gstepf(gs, ls, E15, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, E15, a).pretRefs(tid0) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQRely, seq:⊦ DMSQRely(gs, tid, gs0) ↔ (∃ 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, tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid) = gs0.vretRefs(tid) ∧ ( gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid)) ∧ rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(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(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid, gs.owns, gs0.owns), subst:[gs, tid, gs0] → [gs, tid0, gs0], <all paths>

Additional information

Used simplifier rules: ⊦ pre(gs, ls, E15, a) ↔ a = τ; (s) ⊦ gstepf(gs, ls, E15, a) = (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs); (s) ⊦ # x = # z → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: gs, tid0, gs0

Proof step 249 from proof copied-rely-DMSQLInv (previous step) (back to tree)

⊦ DMSQRely(gs, tid, gs0) ↔ (∃ 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, tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid) = gs0.vretRefs(tid) ∧ (gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid)) ∧ rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(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(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid, gs.owns, gs0.owns)

A spec-lemma

Proof Tree for copied-rely-DMSQLInv (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