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

# lpt1 = # avol, # lpt0 = # avol, isbuf ↔ isbuf1, lpt1[bleb1.leb] = mklp(m3, m5, lpf, m4), bleb = bleb1, buf = mkbuf(m), ¬ isbuf1, keyset(gch) = gc-heap(lpt1, log0), log = log0, lpt = lpt0, m = EB_PAGE_SIZE - m0 % EB_PAGE_SIZE, m0 = lpt1[bleb1.leb].size, m1 = m2, bleb1.isbuf?, bleb1.leb < # lpt1, awbuf-inv(avol, bleb1), bin-heap-inv(gch, lpt1), buf-ro-rw-mode(isbuf1, bleb1, lpt1, avol), bufs-log-only(bleb1, log0, lpt1), freelist-cons(lpt1, freelist), log-group-block(log0, lpt1), lpt-free-unref(lpt1), lpt-free-unref(lpt0), lpt-leb-size(lpt1), lpt-leb-size(lpt0), lpt-ram-flash(lpt1, lpt0, log0), EB_PAGE_SIZE ≥ m0 % EB_PAGE_SIZE, bleb1.isbuf? ∧ ¬ isbuf1 → bleb1.leb < # avol ∧ # avol[bleb1.leb].data ≤ LEB_SIZE ∧ avol[bleb1.leb].mapped? ∧ m5 = # avol[bleb1.leb].data ∧ lpf ≠ LP_FREE ∧ is-aligned(# avol[bleb1.leb].data, 2 * NODE_HEADER_SIZE) ⊦ ⟪persistence_encode_padding_node#(; buf; err); if err = ESUCCESS then {awbuf_write_buf#(# buf, buf, adr, m2, log0, lpt0, ns, bleb1; avol, isbuf1; err); if err = ESUCCESS then lpt1[bleb1.leb] := mklp(lpt1[bleb1.leb].ref-size, lpt1[bleb1.leb].size + m, lpt1[bleb1.leb].flags, lpt1[bleb1.leb].gcheapidx) else {debug#("persistence: flushing of LEB " + bleb1.leb.toString + " failed"); lpt1[bleb1.leb] := mklp(lpt1[bleb1.leb].ref-size, LEB_SIZE, lpt1[bleb1.leb].flags, lpt1[bleb1.leb].gcheapidx); awbuf_enter_readonly#(adr, m2, log0, avol, lpt0, ns, bleb1; ; isbuf1)}} else {debug#("persistence: could not encode padding node"); awbuf_enter_readonly#(adr, m2, log0, avol, lpt0, ns, bleb1; ; isbuf1)}⟫ ( lpt-free-unref(lpt1) ∧ freelist-cons(lpt1, freelist) ∧ bin-heap-inv(gch, lpt1) ∧ keyset(gch) = gc-heap(lpt1, log0) ∧ bufs-log-only(bleb1, log0, lpt1) ∧ # lpt1 = # avol ∧ log-group-block(log0, lpt1) ∧ buf-ro-rw-mode(isbuf1, bleb1, lpt1, avol) ∧ lpt-leb-size(lpt1) ∧ lpt-ram-flash(lpt1, lpt0, log0) ∧ awbuf-inv(avol, bleb1) ∧ # lpt0 = # avol), EB_PAGE_SIZE = 0, is-aligned(m0, EB_PAGE_SIZE)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 24:
# lpt0 = # avol, # lpt1 = # avol, avol[n] = mapped(buf0), lpt1[n] = mklp(m3, # buf0, lpf, m4), buf = mkbuf(EB_PAGE_SIZE - # buf0 % EB_PAGE_SIZE), keyset(gch) = gc-heap(lpt1, log0), lpf ≠ LP_FREE, n < # avol, awbuf-inv(avol, buffered(n)), bin-heap-inv(gch, lpt1), buf-ro-rw-mode(false, buffered(n), lpt1, avol), bufs-log-only(buffered(n), log0, lpt1), freelist-cons(lpt1, freelist), is-aligned(# buf0, 2 * NODE_HEADER_SIZE), log-group-block(log0, lpt1), lpt-free-unref(lpt0), lpt-free-unref(lpt1), lpt-leb-size(lpt0), lpt-leb-size(lpt1), lpt-ram-flash(lpt1, lpt0, log0), # buf0 ≤ LEB_SIZE, ¬ is-aligned(# buf0, EB_PAGE_SIZE) ⊦ ⟪persistence_encode_padding_node#(; buf; err); isbuf1 := false; bleb1 := buffered(n); if err = ESUCCESS then {awbuf_write_buf#(# buf, buf, adr, m2, log0, lpt0, ns, bleb1; avol, isbuf1; err); m := EB_PAGE_SIZE - lpt1[bleb1.leb].size % EB_PAGE_SIZE; if err = ESUCCESS then lpt1[bleb1.leb] := mklp(lpt1[bleb1.leb].ref-size, lpt1[bleb1.leb].size + m, lpt1[bleb1.leb].flags, lpt1[bleb1.leb].gcheapidx) else {debug#("persistence: flushing of LEB " + bleb1.leb.toString + " failed"); lpt1[bleb1.leb] := mklp(lpt1[bleb1.leb].ref-size, LEB_SIZE, lpt1[bleb1.leb].flags, lpt1[bleb1.leb].gcheapidx); awbuf_enter_readonly#(adr, m2, log0, avol, lpt0, ns, bleb1; ; isbuf1)}} else {debug#("persistence: could not encode padding node"); awbuf_enter_readonly#(adr, m2, log0, avol, lpt0, ns, bleb1; ; isbuf1)}⟫ ( lpt-free-unref(lpt1) ∧ freelist-cons(lpt1, freelist) ∧ bin-heap-inv(gch, lpt1) ∧ keyset(gch) = gc-heap(lpt1, log0) ∧ bufs-log-only(bleb1, log0, lpt1) ∧ # lpt1 = # avol ∧ log-group-block(log0, lpt1) ∧ buf-ro-rw-mode(isbuf1, bleb1, lpt1, avol) ∧ lpt-leb-size(lpt1) ∧ lpt-ram-flash(lpt1, lpt0, log0) ∧ awbuf-inv(avol, bleb1) ∧ # lpt0 = # avol)

Rule argument

Additional information

Used simplifier rules: elim-mapped: ⊦ avol[n].mapped? ↔ (∃ buf. avol[n] = mapped(buf));% ⊦ mapped(buf).data = buf; (s)%inv-buf-in-vol: ⊦ awbuf-inv(avol, buffered(n)) → n < # avol; (forward) from specification awbuf-inv% ⊦ buffered(m).isbuf?; (s)% ⊦ m < n → n ≠ 0; (s)% ⊦ mklp(n2, n3, lpf, m).size = n3; (s)% ⊦ buffered(m).leb = m; (s)%lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic%f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic% ⊦ bleb.isbuf? ↔ (∃ n. bleb = buffered(n)); (as)%n ≠ 0 ⊦ m % n ≤ n; (s)% ⊦ n ≥ m ↔ m ≤ n; (s)% ⊦ EB_PAGE_SIZE ≠ 0; (s)