[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 2 from proof decode-node (previous step)

⊦ ⟪decode_node#(n, m, buf; nd; err)⟫ ( (err = ESUCCESS ∨ ⌊err⌋ ) ∧ ( err = ESUCCESS → (∃ buf0, buf1. subarray(buf, n, 2 * NODE_HEADER_SIZE + nd.alignedsize) = buf0 + buf1 + validtrailer ∧ is-encoded(nodeheader(node-size-headerless(nd), false), buf0) ∧ is-encoded(nd, subarray(buf1, 0, node-size-headerless(nd))) ∧ # buf1 = nd.alignedsize) ∧ m = 2 * NODE_HEADER_SIZE + nd.alignedsize ∧ n + 2 * NODE_HEADER_SIZE + nd.alignedsize ≤ # buf))

Heuristic nonrecursive calls applied rule call right

And obtained the following new goals

Proof step 3:
m = m1, m0 = n ⊦ ⟪if m < 2 * NODE_HEADER_SIZE then {debug#("persistence: decode_node expected size wrong"); err := EINVAL} else if ¬ m0 + m ≤ # buf then {debug#("persistence: decode_node buffer insufficient"); err := EINVAL} else let ndhd = ? in {decode_header#(m0, buf; ndhd; err); if err = ESUCCESS ∧ ndhd.ispadding then {debug#("persistence: decode_node got padding node"); err := EIO}; if err = ESUCCESS ∧ align↑(ndhd.size, 2 * NODE_HEADER_SIZE) + 2 * NODE_HEADER_SIZE ≠ m then {debug#("persistence: decode_node node of wrong size"); err := EIO}; if err = ESUCCESS then {decode_node_headerless#(m0 + NODE_HEADER_SIZE, buf; nd, m; err); if err ≠ ESUCCESS then debug#("persistence: decode_node decoding failed") else if m ≠ ndhd.size then {debug#("persistence: decode_node size of node unexpected"); err := EINVAL}}; if err = ESUCCESS ∧ ¬ range=(buf, m0 + NODE_HEADER_SIZE + align↑(ndhd.size, 2 * NODE_HEADER_SIZE), validtrailer, 0, NODE_HEADER_SIZE) then {debug#("persistence: decode_node no validtrailer"); err := EIO}}⟫ ( (err = ESUCCESS ∨ ⌊err⌋ ) ∧ ( err = ESUCCESS → (∃ buf0, buf1. subarray(buf, n, 2 * NODE_HEADER_SIZE + nd.alignedsize) = buf0 + buf1 + validtrailer ∧ is-encoded(nodeheader(node-size-headerless(nd), false), buf0) ∧ is-encoded(nd, subarray(buf1, 0, node-size-headerless(nd))) ∧ # buf1 = nd.alignedsize) ∧ m1 = 2 * NODE_HEADER_SIZE + nd.alignedsize ∧ n + 2 * NODE_HEADER_SIZE + nd.alignedsize ≤ # buf))

Rule argument

pos: right 1

Additional information

Used simplifier rules: decode_node#(OFFSET, SIZE, BUF; ND; ERR) {if SIZE < 2 * NODE_HEADER_SIZE then {debug#("persistence: decode_node expected size wrong"); ERR := EINVAL} else if ¬ OFFSET + SIZE ≤ # BUF then {debug#("persistence: decode_node buffer insufficient"); ERR := EINVAL} else let NDHD = ? in {decode_header#(OFFSET, BUF; NDHD; ERR); if ERR = ESUCCESS ∧ NDHD.ispadding then {debug# ("persistence: decode_node got padding node"); ERR := EIO}; if ERR = ESUCCESS ∧ align↑(NDHD.size, 2 * NODE_HEADER_SIZE) + 2 * NODE_HEADER_SIZE ≠ SIZE then {debug# ("persistence: decode_node node of wrong size"); ERR := EIO}; if ERR = ESUCCESS then {decode_node_headerless# (OFFSET + NODE_HEADER_SIZE, BUF; ND, SIZE; ERR); if ERR ≠ ESUCCESS then debug# ("persistence: decode_node decoding failed") else if SIZE ≠ NDHD.size then {debug# ("persistence: decode_node size of node unexpected"); ERR := EINVAL}}; if ERR = ESUCCESS ∧ ¬ range= (BUF, OFFSET + NODE_HEADER_SIZE + align↑(NDHD.size, 2 * NODE_HEADER_SIZE), validtrailer, 0, NODE_HEADER_SIZE) then {debug# ("persistence: decode_node no validtrailer"); ERR := EIO}} };