[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 122 from proof inv-read-gblock-nodes (previous step)

# lpt0 = # avol, # lpt = # avol, # gndx = # lax, LEB_SIZE = n0 + # buf1, avol[m5] = mapped(buf1), m1 < LEB_SIZE, m5 < # avol, abs-nodes(buf1, gndx, lax, true), awbuf-inv(avol, bleb), buf-ro-rw-mode(isbuf, bleb, lpt0, avol), bufs-log-only(bleb, log0, lpt0), is-encoded(ndhd, subarray(buf1 + mkempbuf(n0), m1, NODE_HEADER_SIZE)), lpt-free-unref(lpt), lpt-leb-size(lpt), lpt-ram-flash(lpt0, lpt, log0), range=(buf1 + mkempbuf(n0), m1 + NODE_HEADER_SIZE + align↑(ndhd.size, 2 * NODE_HEADER_SIZE), validtrailer, 0, NODE_HEADER_SIZE), read-gblock-inv(m5, m1, ax, gndx0, ax1, gndx2, buf1, false), m1 + 2 * NODE_HEADER_SIZE + align↑(ndhd.size, 2 * NODE_HEADER_SIZE) ≤ LEB_SIZE, # buf1 ≤ LEB_SIZE, m1 + NODE_HEADER_SIZE ≤ LEB_SIZE, ¬ ndhd.ispadding, ¬ isempty(buf1 + mkempbuf(n0), m1, NODE_HEADER_SIZE) ⊦ ⟪decode_group_node# (m1, 2 * NODE_HEADER_SIZE + align↑(ndhd.size, 2 * NODE_HEADER_SIZE), copy(avol[m5].data + mkempbuf(n0), 0, mkbuf(LEB_SIZE), 0, LEB_SIZE); gnd; err); m0 := m1; m := 2 * NODE_HEADER_SIZE + align↑(ndhd.size, 2 * NODE_HEADER_SIZE); if err ≠ ESUCCESS then debug#("persistence: read_gblock_nodes could not decode node at offset " + m0.toString + " in LEB " + m5.toString) else {gndx0 := gndx0 + gnd '; ax := ax + @(m5, m0, m) '}; if err = ESUCCESS then m0 := m0 + m⟫ ( (err = ESUCCESS ∨ err = ENOENT ∨ ⌊err⌋ ) ∧ (err = ESUCCESS ∨ err = ENOENT → read-gblock-inv(m5, m0, ax, gndx0, ax1, gndx2, avol[m5].data, err = ENOENT)) ∧ (err ≠ ESUCCESS ⊃ 0;LEB_SIZE - m0) + m1 < LEB_SIZE)

Heuristic elimination applied rule insert elim lemma

And obtained the following new goals

Proof step 123:
# gndx = # lax, # lpt = # avol, # lpt0 = # avol, LEB_SIZE = n0 + # buf1, avol[m5] = mapped(buf1), ¬ boolvar, ndhd = nodeheader(m2, boolvar), m5 < # avol, m1 < LEB_SIZE, abs-nodes(buf1, gndx, lax, true), awbuf-inv(avol, bleb), buf-ro-rw-mode(isbuf, bleb, lpt0, avol), bufs-log-only(bleb, log0, lpt0), is-encoded(ndhd, subarray(buf1 + mkempbuf(n0), m1, NODE_HEADER_SIZE)), lpt-free-unref(lpt), lpt-leb-size(lpt), lpt-ram-flash(lpt0, lpt, log0), range=(buf1 + mkempbuf(n0), m1 + NODE_HEADER_SIZE + align↑(m2, 2 * NODE_HEADER_SIZE), validtrailer, 0, NODE_HEADER_SIZE), read-gblock-inv(m5, m1, ax, gndx0, ax1, gndx2, buf1, false), m1 + NODE_HEADER_SIZE ≤ LEB_SIZE, # buf1 ≤ LEB_SIZE, m1 + 2 * NODE_HEADER_SIZE + align↑(m2, 2 * NODE_HEADER_SIZE) ≤ LEB_SIZE ⊦ ⟪decode_group_node# (m1, 2 * NODE_HEADER_SIZE + align↑(m2, 2 * NODE_HEADER_SIZE), copy(avol[m5].data + mkempbuf(n0), 0, mkbuf(LEB_SIZE), 0, LEB_SIZE); gnd; err); m0 := m1; m := 2 * NODE_HEADER_SIZE + align↑(m2, 2 * NODE_HEADER_SIZE); if err ≠ ESUCCESS then debug#("persistence: read_gblock_nodes could not decode node at offset " + m0.toString + " in LEB " + m5.toString) else {gndx0 := gndx0 + gnd '; ax := ax + @(m5, m0, m) '}; if err = ESUCCESS then m0 := m0 + m⟫ ( (err = ESUCCESS ∨ err = ENOENT ∨ ⌊err⌋ ) ∧ (err = ESUCCESS ∨ err = ENOENT → read-gblock-inv(m5, m0, ax, gndx0, ax1, gndx2, avol[m5].data, err = ENOENT)) ∧ (err ≠ ESUCCESS ⊃ 0;LEB_SIZE - m0) + m1 < LEB_SIZE), isempty(buf1 + mkempbuf(n0), m1, NODE_HEADER_SIZE)

Rule argument

spec: node-header name: elim seq: ⊦ m = ndhd.size ∧ (boolvar ↔ ndhd.ispadding) ↔ ndhd = nodeheader(m, boolvar) subst: [ndhd, m, boolvar] → [ndhd, m3, boolvar]

Additional information

Used simplifier rules: ⊦ m = ndhd.size ∧ (boolvar ↔ ndhd.ispadding) ↔ ndhd = nodeheader(m, boolvar); (elim) Used terms: ndhd, m3, boolvar