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

adr = adr1, ginval = ∅, ginval0 = ∅, gstore = ∅, gstore0 = ∅, istore = ∅, istore0 = (∅)[n0, indexblock(indexnode(mkbrarray(BRANCH_SIZE), true, 0) ', @(maxino2, indexnode(mkbrarray(BRANCH_SIZE), true, 0).flashsize) ', 0)] [index(n0).lnum, (∅ )[n0, indexblock(indexnode(mkbrarray(BRANCH_SIZE), true, 0) ', @(maxino2, indexnode(mkbrarray(BRANCH_SIZE), true, 0).flashsize) ', 0) ] [index(n0).lnum ] .ref-size:= indexnode(mkbrarray(BRANCH_SIZE), true, 0).flashsize ], maxino = maxino4, nx = [], pstate = index(n0), inv((∅)[n0, indexblock([], [], 0)]), inv((∅)[n0, indexblock(indexnode(mkbrarray(BRANCH_SIZE), true, 0) ', @(maxino2, indexnode(mkbrarray(BRANCH_SIZE), true, 0).flashsize) ', 0)]), inv ((∅ )[n0, indexblock (indexnode(mkbrarray(BRANCH_SIZE), true, 0) ', @(maxino2, indexnode(mkbrarray(BRANCH_SIZE), true, 0).flashsize) ', indexnode(mkbrarray(BRANCH_SIZE), true, 0).flashsize) ]), index(n0).lnum ∈ (∅)[n0, indexblock(indexnode(mkbrarray(BRANCH_SIZE), true, 0) ', @(maxino2, indexnode(mkbrarray(BRANCH_SIZE), true, 0).flashsize) ', 0)], indexnode(mkbrarray(BRANCH_SIZE), true, 0).flashsize ≤ LEB_SIZE, index(n0).index? ∨ index(n0).journal? ⊦ [if pstate = unbuffered then err := ESUCCESS else {fail_or_success#(; ; err); syn := err = ESUCCESS; skip or pstate := readonly}] ( ¬ pstate.journal? ∧ ( pstate.index? → pstate.lnum ∈ (∅ )[n0, indexblock (indexnode(mkbrarray(BRANCH_SIZE), true, 0) ', @(maxino2, indexnode(mkbrarray(BRANCH_SIZE), true, 0).flashsize) ', indexnode(mkbrarray(BRANCH_SIZE), true, 0).flashsize) ]) ∧ (pstate = unbuffered → syn) → ⟪nx := []; maxino1 := maxino4; istore0 := ∅; istore := (∅)[n0, indexblock(indexnode(mkbrarray(BRANCH_SIZE), true, 0) ', @(maxino2, indexnode(mkbrarray(BRANCH_SIZE), true, 0).flashsize) ', 0)] [index(n0).lnum, (∅ )[n0, indexblock (indexnode(mkbrarray(BRANCH_SIZE), true, 0) ', @(maxino2, indexnode(mkbrarray(BRANCH_SIZE), true, 0).flashsize) ', 0) ] [index(n0).lnum ] .ref-size:= indexnode(mkbrarray(BRANCH_SIZE), true, 0).flashsize ]; gstore0 := ∅; gstore := ∅; ginval0 := ∅; ginval := ∅; if err = ESUCCESS then let ns = ∅ in apersistence_commit# (@(index(n0).lnum, maxino2, indexnode(mkbrarray(BRANCH_SIZE), true, 0).flashsize), maxino4, syn ; ns, istore, ginval0, gstore0, adr1, istore0, gstore, nx, maxino1, ginval ; pstate, err)⟫ ( ( err = ESUCCESS → syn ∧ (∃ ri, fi. btree-inv(null, adr1, istore, istore0, 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(istore) ∧ inv(istore0) ∧ istore0 ⊑ istore ∧ remove-refsize0(istore0) = istore0 ∧ (pstate.journal? → nx ≠ [] ∧ pstate.lnum = nx.last ∧ pstate.lnum ∈ gstore0) ∧ (pstate.index? → pstate.lnum ∈ istore)) ∧ (err = ESUCCESS ∨ ⌊err⌋ ) ∧ ( err = ESUCCESS → btree-inv(null, adr1, istore, istore0, zh, ∅, ∅) ∧ gstore0 = ∅ ∧ ginval0 = ∅ ∧ maxino1 = maxino4 ∧ nx = [] ∧ ginval = ∅)))

Heuristic symbolic execution applied rule if negative right

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Used simplifier rules: ⊦ unbuffered ≠ index(m); (s)