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

LEB_SIZE < indexnode(mkbrarray(BRANCH_SIZE), true, 0).flashsize ⊦ ⟪debug#("btree: initial index node to large"); err0 := ENOSPC; pstate := unbuffered; nx := []; maxino := maxino4; istore0 := ∅; istore := ∅; gstore0 := ∅; gstore := ∅; ginval0 := ∅; ginval := ∅; syn := true; if err0 = ESUCCESS then apersistence_allocate_ind#(adr, istore, ginval0, gstore0, gstore, nx, maxino, ginval, syn; istore0, pstate; err0); ind := indexnode(mkbrarray(BRANCH_SIZE), true, 0); if err0 = ESUCCESS then apersistence_add_ind#(ind, adr, istore, ginval0, gstore0, gstore, nx, maxino, ginval; adr0, istore0, pstate, syn; err0); if err0 = ESUCCESS then apersistence_set_iblock_refsize# (adr0.lnum, ind.flashsize, adr, istore, ginval0, gstore0, gstore, nx, maxino, ginval, pstate, syn; istore0); if err0 = ESUCCESS then apersistence_sync#(adr, istore0, istore, ginval0, gstore0, gstore, nx, maxino, ginval; pstate, syn; err0); if err0 = ESUCCESS then let ns = ∅ in apersistence_commit#(adr0, maxino4, syn; ns, istore0, ginval0, gstore0, adr, istore, gstore, nx, maxino, ginval; pstate, err0)⟫ ( ( err0 = ESUCCESS → syn ∧ (∃ ri, fi. btree-inv(null, adr, istore0, istore, zh, ri, fi)) ∧ inv(gstore0 \ ginval0) ∧ inv(gstore) ∧ elems nx ∩ ginval0 = ∅ ∧ ¬ dups(nx) ∧ dom gstore ∪ elems nx = dom gstore0 ∪ ginval0 ∧ remove-refsize0(gstore) = gstore ∧ inv(istore0) ∧ inv(istore) ∧ istore ⊑ istore0 ∧ remove-refsize0(istore) = istore ∧ (pstate.journal? → nx ≠ [] ∧ pstate.lnum = nx.last ∧ pstate.lnum ∈ gstore0) ∧ (pstate.index? → pstate.lnum ∈ istore0)) ∧ (err0 = ESUCCESS ∨ ⌊err0⌋ ) ∧ (err0 = ESUCCESS → btree-inv(null, adr, istore0, istore, zh, ∅, ∅) ∧ gstore0 = ∅ ∧ ginval0 = ∅ ∧ maxino = maxino4 ∧ nx = [] ∧ ginval = ∅))

User applied rule insert program lemma

And obtained the following new goals

Rule argument

spec: debug name: debug seq: ⊦ ⟪debug#(str)⟫ true subst: [str] → ["btree: initial index node to large"] flags: <all paths>

Additional information