[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 95 from proof abs-gstore-crash (previous step)

# gndx = # lax, # avol1 = # lpt, # lpt0 = # lpt, # avol0 = # lpt, avol0[n] = mapped(buf), lpt[bleb.leb] = mklp(m3, m4, lpf0, m5), gstore[n] = groupblock(gndx, lax, m6), lpt[n] = mklp(m6, m8, LP_GROUP_NODES, m9), gstore0[n] = groupblock(gndx1, lax2, m0), (∅)[n] = indexblock(indx, lax1, m10), lpt0[n] = mklp(m0, m1, LP_GROUP_NODES, m15), avol1[n] = mapped(buf), dom istore ∩ elems nx = ∅, n < # lpt, ginval < # lpt, abs-nodes(buf, gndx, lax, m8 = LEB_SIZE), awbuf-inv(avol0, bleb), is-aligned(# buf, EB_PAGE_SIZE), n ∈ gstore0, n ∈ gstore, istore0 ⊑ istore, m8 ≠ LEB_SIZE → m8 = # buf, ∀ n. n < # lpt ∧ lpt0[n].flags = LP_GROUP_NODES ∧ lpt[n].flags = LP_GROUP_NODES ∧ ¬ n ∈ nx → lpt[n].size = lpt0[n].size, ∀ n. n < # lpt ∧ lpt0[n].flags = LP_FREE → lpt0[n].ref-size = 0, bleb = nobuffer ∨ bleb.leb < # lpt ∧ (nx ≠ [] ∧ bleb.leb = nx.last ∧ lpf0 = LP_GROUP_NODES ∨ lpf0 = LP_INDEX_NODES) ⊦ m0 = 0, n ∈ istore0, n ∈ istore, n ∈ ginval, n ∈ nx, abs-nodes(buf, gndx, lax, m1 = LEB_SIZE) ∧ (m1 ≠ LEB_SIZE → m1 = # buf)

Heuristic nonsplitting cut applied rule cut formula

And obtained the following new goals

Proof step 96:
# avol0 = # lpt, # lpt0 = # lpt, # avol1 = # lpt, # gndx = # lax, avol1[n] = mapped(buf), lpt0[n] = mklp(m0, m1, LP_GROUP_NODES, m15), (∅)[n] = indexblock(indx, lax1, m10), gstore0[n] = groupblock(gndx1, lax2, m0), lpt[n] = mklp(m6, m8, LP_GROUP_NODES, m9), gstore[n] = groupblock(gndx, lax, m6), lpt[bleb.leb] = mklp(m3, m4, lpf0, m5), avol0[n] = mapped(buf), dom istore ∩ elems nx = ∅, ginval < # lpt, n < # lpt, abs-nodes(buf, gndx, lax, m8 = LEB_SIZE), awbuf-inv(avol0, bleb), is-aligned(# buf, EB_PAGE_SIZE), n ∈ gstore, n ∈ gstore0, istore0 ⊑ istore, m8 ≠ LEB_SIZE → m8 = # buf, ∀ n. n < # lpt ∧ lpt0[n].flags = LP_FREE → lpt0[n].ref-size = 0, ∀ n. n < # lpt ∧ lpt0[n].flags = LP_GROUP_NODES ∧ lpt[n].flags = LP_GROUP_NODES ∧ ¬ n ∈ nx → lpt[n].size = lpt0[n].size, bleb = nobuffer ∨ bleb.leb < # lpt ∧ (nx ≠ [] ∧ bleb.leb = nx.last ∧ lpf0 = LP_GROUP_NODES ∨ lpf0 = LP_INDEX_NODES) ⊦ m0 = 0, m1 = LEB_SIZE, n ∈ nx, n ∈ ginval, n ∈ istore, n ∈ istore0, abs-nodes(buf, gndx, lax, m1 = LEB_SIZE) ∧ (m1 ≠ LEB_SIZE → m1 = # buf)

Rule argument

fma: m1 = LEB_SIZE

Additional information

Used simplifier rules: ⊦ abs-nodes(buf, gndx, lax0, true) → (abs-nodes(buf, gndx0, lax1, true) ↔ gndx = gndx0 ∧ lax0 = lax1); (s)% ⊦ abs-nodes(buf, gndx, lax, false) → abs-nodes(buf, gndx, lax, true); (ss) Used formulas: m1 = LEB_SIZE