[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-deallocate-gnd (previous step)

# lpt = # avol, # lpt0 = # avol, lpt[n] = mklp(m0, m1, LP_GROUP_NODES, m2), keyset(gch) = gc-heap(lpt, log0), n < # avol, awbuf-inv(avol, bleb), bin-heap-inv(gch, lpt), buf-ro-rw-mode(isbuf, bleb, lpt, avol), bufs-log-only(bleb, log0, lpt), freelist-cons(lpt, freelist), log-group-block(log0, lpt), lpt-free-unref(lpt), lpt-free-unref(lpt0), lpt-leb-size(lpt), lpt-leb-size(lpt0), lpt-ram-flash(lpt, lpt0, log0), synced(avol), ¬ dups(log0), ¬ n ∈ log0 ⊦ ⟪awbuf_is_readonly#(adr, m, log0, avol, lpt0, ns, bleb, isbuf; ; isbuf1); if isbuf1 then err := EROFS else {awbuf_unmap#(n, adr, m, log0, lpt0, ns, bleb, isbuf; avol); lpt[n].flags := LP_FREE; lpt[n].ref-size := 0; lpt[n] := mklp(lpt[n].ref-size, 0, lpt[n].flags, lpt[n].gcheapidx); freelist := freelist + n '; gc_heap_remove#(lpt[n].gcheapidx; gch, lpt); err := ESUCCESS}⟫ ( lpt-free-unref(lpt) ∧ freelist-cons(lpt, freelist) ∧ bin-heap-inv(gch, lpt) ∧ keyset(gch) = gc-heap(lpt, log0) ∧ bufs-log-only(bleb, log0, lpt) ∧ # lpt = # avol ∧ log-group-block(log0, lpt) ∧ buf-ro-rw-mode(isbuf, bleb, lpt, avol) ∧ lpt-leb-size(lpt) ∧ lpt-ram-flash(lpt, lpt0, log0) ∧ awbuf-inv(avol, bleb) ∧ # lpt0 = # avol)

Heuristic unfold applied rule call right

And obtained the following new goals

Proof step 11:
# lpt0 = # avol, # lpt1 = # avol, isbuf0 ↔ isbuf2, lpt1[n] = mklp(m0, m1, LP_GROUP_NODES, m2), keyset(gch) = gc-heap(lpt1, log0), log = log0, lpt = lpt0, n < # avol, awbuf-inv(avol, bleb), bin-heap-inv(gch, lpt1), buf-ro-rw-mode(isbuf2, 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), synced(avol) ⊦ ⟪isbuf := isbuf0; if isbuf then err := EROFS else {awbuf_unmap#(n, adr, m, log0, lpt0, ns, bleb, isbuf2; avol); lpt1[n].flags := LP_FREE; lpt1[n].ref-size := 0; lpt1[n] := mklp(lpt1[n].ref-size, 0, lpt1[n].flags, lpt1[n].gcheapidx); freelist := freelist + n '; gc_heap_remove#(lpt1[n].gcheapidx; gch, lpt1); err := ESUCCESS}⟫ ( 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(isbuf2, bleb, lpt1, avol) ∧ lpt-leb-size(lpt1) ∧ lpt-ram-flash(lpt1, lpt0, log0) ∧ awbuf-inv(avol, bleb) ∧ # lpt0 = # avol), dups(log0), n ∈ log0

Rule argument

pos: right 1

Additional information

Used simplifier rules: awbuf_is_readonly# (WROOTADR, WMAXINO, WLOG, WVOL, WLPT, WORPHANS, WBUFLEB, AROFS ; ; AROFS0 ) {AROFS0 := AROFS};