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

avols[default-volid][m2].mapped?, m2 < # avols[default-volid], ebm-cons(avols), default-volid ∈ avols, m1 + n ≤ LEB_SIZE, n0 + n ≤ # buf ⊦ ⟪ebm_read#(default-volid, m2, m1, n0, n, avols; buf; err)⟫ true

Heuristic nonrecursive calls applied rule call right

And obtained the following new goals

Proof step 7:
buf0 = buf, m = m1, m0 = m2, v = default-volid, avols[default-volid][m2].mapped?, m2 < # avols[default-volid], ebm-cons(avols), default-volid ∈ avols, n0 + n ≤ # buf, m1 + n ≤ LEB_SIZE ⊦ ⟪if v ∈ avols ∧ m0 < # avols[v] ∧ m + n ≤ LEB_SIZE ∧ n0 + n ≤ # buf0 then {fail_or_success#(; ; err); if err = ESUCCESS then if ¬ avols[v][m0].mapped? then buf0 := fill(buf0, empty, n0, n) else buf0 := copy(avols[v][m0].data, m, buf0, n0, n) else choose buf with # buf = # buf0 ∧ range=(buf, 0, buf0, 0, n0) ∧ range=(buf, n0 + n, buf0, n0 + n, # buf0 - n0 + n) in buf0 := buf} else abort⟫ true

Rule argument

pos: right 1

Additional information

Used simplifier rules: ebm_read#(VOLID, LNUM, OFFSET, N0, N, AVOLS; BUF; ERR) {if VOLID ∈ AVOLS ∧ LNUM < # AVOLS[VOLID] ∧ OFFSET + N ≤ LEB_SIZE ∧ N0 + N ≤ # BUF then {fail_or_success#(; ; ERR); if ERR = ESUCCESS then if ¬ AVOLS[VOLID][LNUM].mapped? then BUF := fill(BUF, empty, N0, N) else BUF := copy(AVOLS[VOLID][LNUM].data, OFFSET, BUF, N0, N) else choose BUF0 with # BUF0 = # BUF ∧ range=(BUF0, 0, BUF, 0, N0) ∧ range=(BUF0, N0 + N, BUF, N0 + N, # BUF - N0 + N) in BUF := BUF0} else abort };