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

# lpt1 = # avol, # lpt0 = # avol, (elems nx ∪ dom gstore0) ++ n = dom gstore ∪ ginval, gstore[n] = groupblock(gndx, lax, m0), lpt1[n] = mklp(m0, m1, LP_GROUP_NODES, m2), avol[n] = mapped(buf), keyset(gch) = gc-heap(lpt1, nx + n '), remove-refsize0(istore0) = istore0, remove-refsize0(gstore0) = gstore0, ginval ∩ elems nx = ∅, gndx0 ≠ [], ginval < # avol, n < # avol, abs-gstore(avol, lpt1, gstore, ginval), abs-istore(avol, lpt1, istore), 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(groupblock(gndx, lax, m0)), inv(istore0), inv(istore), inv(gstore0), inv(gstore \ ginval), log-group-block(nx + n ', lpt1), lpt-free-unref(lpt1), lpt-free-unref(lpt0), lpt-leb-size(lpt1), lpt-leb-size(lpt0), lpt-ram-flash(lpt1, lpt0, nx + n '), n ∈ gstore, istore0 ⊑ istore, ¬ dups(nx), ¬ n ∈ ginval, ¬ n ∈ nx, isbuf1 → synced(avol), m1 + gndx0.flashsize ≤ LEB_SIZE → m1 = # buf ⊦ [persistence_encode_group_nodes#(gndx0, buffered((nx + n ').last).leb, m1; ; buf, ax, err); isbuf2 := false; bleb1 := buffered((nx + n ').last); log1 := nx + n '; if err = ESUCCESS then if ¬ m1 + # buf ≤ LEB_SIZE then {debug#("persistence: trying to write beyond LEB size"); awbuf_enter_readonly#(adr0, m, log1, avol, lpt0, ns0, bleb1; ; isbuf2); err := ENOSPC} else {awbuf_write_buf#(# buf, buf, adr0, m, log1, lpt0, ns0, bleb1; avol, isbuf2; err); if err = ESUCCESS then lpt1[buffered(log1.last).leb] := mklp (lpt1[buffered(log1.last).leb].ref-size, lpt1[buffered(log1.last).leb].size + # buf, lpt1[buffered(log1.last).leb].flags, lpt1[buffered(log1.last).leb].gcheapidx) else {debug#("persistence: adding group node to LEB " + buffered(log1.last).leb.toString + " failed"); lpt1[buffered(log1.last).leb] := mklp (lpt1[buffered(log1.last).leb].ref-size, LEB_SIZE, lpt1[buffered(log1.last).leb].flags, lpt1[buffered(log1.last).leb].gcheapidx)}} else {debug#("persistence: could not encode group node"); awbuf_enter_readonly#(adr0, m, log1, avol, lpt0, ns0, bleb1; ; isbuf2)}] ( lpt-free-unref(lpt1) ∧ freelist-cons(lpt1, freelist) ∧ bin-heap-inv(gch, lpt1) ∧ keyset(gch) = gc-heap(lpt1, log1) ∧ bufs-log-only(bleb1, log1, lpt1) ∧ # lpt1 = # avol ∧ log-group-block(log1, lpt1) ∧ buf-ro-rw-mode(isbuf2, bleb1, lpt1, avol) ∧ lpt-leb-size(lpt1) ∧ lpt-ram-flash(lpt1, lpt0, log1) ∧ awbuf-inv(avol, bleb1) ∧ # lpt0 = # avol → ⟨pstate := journal(log1.last); apersistence_add_gnds#(gndx0, adr0, istore, istore0, ginval, gstore0, log1, m, ns0; ax0, gstore, pstate, isbuf1; err0)⟩ ( abs-istore(avol, lpt1, istore) ∧ abs-gstore(avol, lpt1, gstore, ginval) ∧ ginval < # lpt1 ∧ (isbuf1 → synced(avol)) ∧ (pstate = unbuffered → bleb1 = nobuffer) ∧ (pstate = readonly ↔ isbuf2) ∧ (pstate ≠ unbuffered ∧ pstate ≠ readonly → bleb1 = buffered(pstate.lnum)) ∧ ax = ax0 ∧ err = err0))

User applied rule insert program lemma

And obtained the following new goals

Rule argument

spec: persistence-asm name: prepost-encode-group-nodes seq: ⊦ ⟪persistence_encode_group_nodes# (gndx, n, n0; ; buf, ax, err)⟫ ( (err = ESUCCESS ∨ ⌊err⌋ ) ∧ ( err = ESUCCESS → (∃ lax. lax.to-adr(n) = ax ∧ # buf = gndx.flashsize ∧ abs-nodes(buf, n0, gndx, lax, false)))) subst: [n0, n, gndx, err, ax, buf] → [m1, buffered((nx + n ').last).leb, gndx0, err, ax, buf] flags: <all paths>

Additional information