[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 34 from proof refine-deallocate-gnd (previous step)

# lpt1 = # avol, # lpt0 = # avol, isbuf ↔ false, lpt1[n] = mklp(m3, m1, LP_GROUP_NODES, m2), gstore[n] = groupblock(gndx, lax, m3), adr = adr0, keyset(gch) = gc-heap(lpt1, log1), log = log1, lpt = lpt0, m0 = n, ns = ns0, remove-refsize0(gstore0) = gstore0, remove-refsize0(istore0) = istore0, elems log1 ∩ ginval = ∅, dom gstore0 ∪ elems log1 = dom gstore ∪ ginval, n < # lpt1[n, lpt1[n].flags:= LP_FREE], n < # avol, ginval < # avol, m0 < # avol, n < # lpt1, abs-gstore(avol, lpt1, gstore, ginval), abs-istore(avol, lpt1, istore), awbuf-inv(avol, bleb), bin-heap-inv(gch, lpt1), buf-ro-rw-mode(false, bleb, lpt1, avol), bufs-log-only(bleb, log1, lpt1), flash-lpt-cons(lpt0, istore0, gstore0), freelist-cons(lpt1, freelist), inv(gstore \ ginval), inv(gstore0), inv(istore), inv(istore0), log-group-block(log1, lpt1), lpt-free-unref(lpt1), lpt-free-unref(lpt0), lpt-leb-size(lpt1), lpt-leb-size(lpt0), lpt-ram-flash(lpt1, lpt0, log1), synced(avol), n ∈ gstore, n ∈ gstore0, istore0 ⊑ istore, pstate ≠ unbuffered → bleb = buffered(pstate.lnum), pstate = unbuffered → bleb = nobuffer, pstate.journal? → log1 ≠ [] ∧ pstate.lnum = log1.last ∧ pstate.lnum ∈ gstore, pstate.index? → pstate.lnum ∈ istore ⊦ ⟪lpt1 := lpt1[n, lpt1[n].flags:= LP_FREE][n, lpt1[n, lpt1[n].flags:= LP_FREE][n].ref-size:= 0] [n, mklp (lpt1[n, lpt1[n].flags:= LP_FREE][n, lpt1[n, lpt1[n].flags:= LP_FREE][n].ref-size:= 0][n].ref-size, 0, lpt1[n, lpt1[n].flags:= LP_FREE][n, lpt1[n, lpt1[n].flags:= LP_FREE][n].ref-size:= 0][n].flags, lpt1[n, lpt1[n].flags:= LP_FREE][n, lpt1[n, lpt1[n].flags:= LP_FREE][n].ref-size:= 0][n].gcheapidx) ]; freelist := freelist + n '; gc_heap_remove#(lpt1[n].gcheapidx; gch, lpt1); err := ESUCCESS⟫ ⟨apersistence_deallocate_gnd#(n, adr0, istore, istore0, gstore0, log1, m, ns0, pstate, true; ginval, gstore; err0)⟩ ( abs-istore(avol[m0, unmapped], lpt1, istore) ∧ abs-gstore(avol[m0, unmapped], lpt1, gstore, ginval) ∧ ginval < # lpt1 ∧ synced(avol[m0, unmapped]) ∧ (pstate = unbuffered → bleb = nobuffer) ∧ (pstate ≠ unbuffered → bleb = buffered(pstate.lnum)) ∧ err = err0), buffered(m0) = bleb, pstate = readonly, dups(log1), n ∈ log1

Heuristic symbolic execution applied rule assign right

And obtained the following new goals

Proof step 35:
# lpt0 = # avol, # lpt2 = # avol, isbuf ↔ false, gstore[n] = groupblock(gndx, lax, m3), lpt2[n] = mklp(m3, m1, LP_GROUP_NODES, m2), adr = adr0, keyset(gch) = gc-heap(lpt2, log1), log = log1, lpt = lpt0, lpt1 = lpt2[n, lpt2[n].flags:= LP_FREE][n, lpt2[n, lpt2[n].flags:= LP_FREE][n].ref-size:= 0] [n, mklp (lpt2[n, lpt2[n].flags:= LP_FREE][n, lpt2[n, lpt2[n].flags:= LP_FREE][n].ref-size:= 0][n].ref-size, 0, lpt2[n, lpt2[n].flags:= LP_FREE][n, lpt2[n, lpt2[n].flags:= LP_FREE][n].ref-size:= 0][n].flags, lpt2[n, lpt2[n].flags:= LP_FREE][n, lpt2[n, lpt2[n].flags:= LP_FREE][n].ref-size:= 0][n].gcheapidx) ], m0 = n, ns = ns0, remove-refsize0(istore0) = istore0, remove-refsize0(gstore0) = gstore0, elems log1 ∩ ginval = ∅, dom gstore0 ∪ elems log1 = dom gstore ∪ ginval, m0 < # avol, ginval < # avol, n < # avol, n < # lpt2[n, lpt2[n].flags:= LP_FREE][n, lpt2[n, lpt2[n].flags:= LP_FREE][n].ref-size:= 0], n < # lpt2[n, lpt2[n].flags:= LP_FREE], n < # lpt2, abs-gstore(avol, lpt2, gstore, ginval), abs-istore(avol, lpt2, istore), awbuf-inv(avol, bleb), bin-heap-inv(gch, lpt2), buf-ro-rw-mode(false, bleb, lpt2, avol), bufs-log-only(bleb, log1, lpt2), flash-lpt-cons(lpt0, istore0, gstore0), freelist-cons(lpt2, freelist), inv(istore0), inv(istore), inv(gstore0), inv(gstore \ ginval), log-group-block(log1, lpt2), lpt-free-unref(lpt0), lpt-free-unref(lpt2), lpt-leb-size(lpt0), lpt-leb-size(lpt2), lpt-ram-flash(lpt2, lpt0, log1), synced(avol), n ∈ gstore0, n ∈ gstore, istore0 ⊑ istore, pstate.index? → pstate.lnum ∈ istore, pstate.journal? → log1 ≠ [] ∧ pstate.lnum = log1.last ∧ pstate.lnum ∈ gstore, pstate = unbuffered → bleb = nobuffer, pstate ≠ unbuffered → bleb = buffered(pstate.lnum) ⊦ ⟪freelist := freelist + n '; gc_heap_remove#(lpt1[n].gcheapidx; gch, lpt1); err := ESUCCESS⟫ ⟨apersistence_deallocate_gnd#(n, adr0, istore, istore0, gstore0, log1, m, ns0, pstate, true; ginval, gstore; err0)⟩ ( abs-istore(avol[m0, unmapped], lpt1, istore) ∧ abs-gstore(avol[m0, unmapped], lpt1, gstore, ginval) ∧ ginval < # lpt1 ∧ synced(avol[m0, unmapped]) ∧ (pstate = unbuffered → bleb = nobuffer) ∧ (pstate ≠ unbuffered → bleb = buffered(pstate.lnum)) ∧ err = err0), buffered(m0) = bleb, pstate = readonly, dups(log1), n ∈ log1

Rule argument

Additional information

Used simplifier rules: ⊦ # lpt[n, lp] = # lpt; (s)% ⊦ m < # lpt → lpt[m, lp][m] = lp; (s)% ⊦ m < n ↔ ¬ n ≤ m; (ss)% ⊦ m < n → (n ≤ m ↔ false); (s)%m < # lpt ⊦ lpt[m, lp][m, lp0] = lpt[m, lp0]; (s)