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

# lpt1 = # avol, # lpt0 = # avol, # buf0 = gndx0.flashsize, # gndx0 = # lax0, (elems nx ∪ dom gstore0) ++ n = dom gstore ∪ ginval, avol[n] = mapped(buf1), gstore[n] = groupblock(gndx, lax, m1), lpt1[n] = mklp(m1, # buf1, LP_GROUP_NODES, m2), 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), abs-nodes(buf0, # buf1, 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(groupblock(gndx, lax, m1)), 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, # buf1 + gndx0.flashsize ≤ LEB_SIZE, istore0 ⊑ istore, ¬ dups(nx), ¬ n ∈ ginval, ¬ n ∈ nx, isbuf1 → synced(avol) ⊦ [fail_or_success#(; ; err); let m = buffered((nx + n ').last).leb in {isbuf := false; if err = ESUCCESS then avol[m] := mapped(avol[m].data + subarray(buf0, 0, gndx0.flashsize)) else { {n0 := gndx0.flashsize; choose n with n ≠ 0 ∧ n < n0 ∧ is-aligned(# avol[m].data + n, EB_PAGE_SIZE) in avol[m] := mapped(avol[m].data + subarray(buf0, 0, n)) ifnone skip} or skip; isbuf := true}}; log1 := nx + n '; if err = ESUCCESS then lpt1[buffered(log1.last).leb] := mklp (lpt1[buffered(log1.last).leb].ref-size, lpt1[buffered(log1.last).leb].size + gndx0.flashsize, 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)}] ( lpt-free-unref(lpt1) ∧ freelist-cons(lpt1, freelist) ∧ bin-heap-inv(gch, lpt1) ∧ keyset(gch) = gc-heap(lpt1, log1) ∧ bufs-log-only(buffered(n), log1, lpt1) ∧ # lpt1 = # avol ∧ log-group-block(log1, lpt1) ∧ buf-ro-rw-mode(isbuf, buffered(n), lpt1, avol) ∧ lpt-leb-size(lpt1) ∧ lpt-ram-flash(lpt1, lpt0, log1) ∧ awbuf-inv(avol, buffered(n)) ∧ # 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 ∧ (pstate = readonly ↔ isbuf) ∧ (pstate ≠ readonly → n = pstate.lnum) ∧ lax0.to-adr(n) = ax0 ∧ err = err0))

Heuristic unfold applied rule call right

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Used simplifier rules: fail_or_success#(; ; ERR) {choose ERR0 with ⌊ERR0⌋ ∨ ERR0 = ESUCCESS in ERR := ERR0};