[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 10 from proof inv-add-ind (previous step)

# lpt0 = # avol, # lpt1 = # avol, isbuf0 ↔ isbuf1, lpt1[bleb.leb] = mklp(m1, m3, lpf, m2), adr = adr0, keyset(gch) = gc-heap(lpt1, log0), log = log0, lpt = lpt0, m = m0, awbuf-inv(avol, bleb), bin-heap-inv(gch, lpt1), buf-ro-rw-mode(isbuf1, bleb, lpt1, avol), bufs-log-only(bleb, log0, lpt1), freelist-cons(lpt1, freelist), 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), ¬ isbuf1 → bleb.isbuf? ∧ bleb.leb < # avol ∧ lpf = LP_INDEX_NODES ∧ avol[bleb.leb].mapped? ∧ (m3 + 2 * NODE_HEADER_SIZE + ind.alignedsize ≤ LEB_SIZE → m3 = # avol[bleb.leb].data) ⊦ ⟪if isbuf0 then err := EROFS else let buf = mkbuf(2 * NODE_HEADER_SIZE + ind.alignedsize), m = ?, bleb1 = ? in {awbuf_get_buf#(adr0, m0, log0, avol, lpt0, ns, bleb, isbuf1; ; bleb1); encode_index_node#(ind, 0; m, buf; err); if err = ESUCCESS then if ¬ lpt1[bleb1.leb].size + m ≤ LEB_SIZE then {debug#("persistence: trying to write beyond LEB size"); awbuf_enter_readonly#(adr0, m0, log0, avol, lpt0, ns, bleb; ; isbuf1); err := ENOSPC} else {awbuf_write_buf#(m, buf, adr0, m0, log0, lpt0, ns, bleb; avol, isbuf1; err); if err = ESUCCESS then {adr := @(bleb1.leb, lpt1[bleb1.leb].size, m); lpt1[bleb1.leb] := mklp(lpt1[bleb1.leb].ref-size, lpt1[bleb1.leb].size + m, lpt1[bleb1.leb].flags, lpt1[bleb1.leb].gcheapidx)} else lpt1[bleb1.leb] := mklp(lpt1[bleb1.leb].ref-size, LEB_SIZE, lpt1[bleb1.leb].flags, lpt1[bleb1.leb].gcheapidx)} else {debug#("persistence: could not encode index node"); awbuf_enter_readonly#(adr0, m0, log0, avol, lpt0, ns, bleb; ; isbuf1)}}⟫ ( lpt-free-unref(lpt1) ∧ freelist-cons(lpt1, freelist) ∧ bin-heap-inv(gch, lpt1) ∧ keyset(gch) = gc-heap(lpt1, log0) ∧ bufs-log-only(bleb, log0, lpt1) ∧ # lpt1 = # avol ∧ log-group-block(log0, lpt1) ∧ buf-ro-rw-mode(isbuf1, bleb, lpt1, avol) ∧ lpt-leb-size(lpt1) ∧ lpt-ram-flash(lpt1, lpt0, log0) ∧ awbuf-inv(avol, bleb) ∧ # lpt0 = # avol)

Heuristic conditional right split applied rule if right

And obtained the following new goals

Rule argument

pos: right 1

Additional information