[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 87 from proof refine-add-gnds (previous step)

# gndx0 = # lax0, # buf0 = gndx0.flashsize, # lpt0 = # avol, # lpt1 = # avol, (elems nx ∪ dom gstore0) ++ n = dom gstore ∪ ginval, avol[n] = mapped(buf), lpt1[n] = mklp(m0, m1, LP_GROUP_NODES, m2), gstore[n] = groupblock(gndx, lax, m0), keyset(gch) = gc-heap(lpt1, nx + n '), remove-refsize0(gstore0) = gstore0, remove-refsize0(istore0) = istore0, ginval ∩ elems nx = ∅, gndx0 ≠ [], LEB_SIZE < m1 + gndx0.flashsize, n < # avol, ginval < # avol, abs-gstore(avol, lpt1, gstore, ginval), abs-istore(avol, lpt1, istore), abs-nodes(buf0, m1, gndx0, lax0, false), awbuf-inv(avol, buffered(n)), bin-heap-inv(gch, lpt1), buf-ro-rw-mode(false, buffered(n), lpt1, avol), bufs-log-only(buffered(n), nx + n ', lpt1), flash-lpt-cons(lpt0, istore0, gstore0), freelist-cons(lpt1, freelist), inv(gstore \ ginval), inv(gstore0), inv(istore), inv(istore0), inv(groupblock(gndx, lax, m0)), log-group-block(nx + n ', lpt1), lpt-free-unref(lpt0), lpt-free-unref(lpt1), lpt-leb-size(lpt0), lpt-leb-size(lpt1), lpt-ram-flash(lpt1, lpt0, nx + n '), n ∈ gstore, istore0 ⊑ istore, ¬ dups(nx), ¬ n ∈ ginval, ¬ n ∈ nx, isbuf1 → synced(avol) ⊦ [debug#("persistence: trying to write beyond LEB size"); awbuf_enter_readonly#(adr0, m, nx + n ', avol, lpt0, ns0, buffered((nx + n ').last); ; isbuf2); err := ENOSPC] ( buf-ro-rw-mode(isbuf2, buffered(n), lpt1, avol) → ⟨pstate := journal((nx + n ').last); apersistence_add_gnds#(gndx0, adr0, istore, istore0, ginval, gstore0, nx + n ', m, ns0; ax0, gstore, pstate, isbuf1; err0)⟩ ( abs-gstore(avol, lpt1, gstore, ginval) ∧ ginval < # lpt1 ∧ (isbuf1 → synced(avol)) ∧ pstate ≠ unbuffered ∧ (pstate = readonly ↔ isbuf2) ∧ (pstate ≠ readonly → n = pstate.lnum) ∧ lax0.to-adr(n) = ax0 ∧ err = err0))

User applied rule insert program lemma

And obtained the following new goals

Rule argument

spec: debug name: debug seq: ⊦ ⟪debug#(str)⟫ true subst: [str] → ["persistence: trying to write beyond LEB size"] flags: <all paths>

Additional information