[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 8 from proof term-remove-nonend-blocks (previous step)

inv(gstore2), n ∈ gstore2, ¬ n ∈ ginval ⊦ ⟪fail_or_success#(; ; err); gndx := []; if err = ESUCCESS then ax := ax + gstore2[n].ladrlist.to-adr(n), gndx := gndx + gstore2[n].gndlist else ax := ?, gndx := ?; if err = ESUCCESS then {jvalid := false; log := ax; while ¬ jvalid ∧ gndx ≠ [] do {/* (term-remove-nonend-blocks: invariant # gndx ≤ # log ∧ inv(gstore2) wfbound (jvalid ⊃ 0;# gndx)) */; if gndx.last.end then jvalid := true else {log := log.butlast; gndx := gndx.butlast}}}⟫ true

Heuristic unfold applied rule call right

And obtained the following new goals

Proof step 9:
inv(gstore2), n ∈ gstore2 ⊦ ⟪choose err0 with ⌊err0⌋ ∨ err0 = ESUCCESS in err := err0; gndx := []; if err = ESUCCESS then ax := ax + gstore2[n].ladrlist.to-adr(n), gndx := gndx + gstore2[n].gndlist else ax := ?, gndx := ?; if err = ESUCCESS then {jvalid := false; log := ax; while ¬ jvalid ∧ gndx ≠ [] do {/* (term-remove-nonend-blocks: invariant # gndx ≤ # log ∧ inv(gstore2) wfbound (jvalid ⊃ 0;# gndx)) */; if gndx.last.end then jvalid := true else {log := log.butlast; gndx := gndx.butlast}}}⟫ true, n ∈ ginval

Rule argument

pos: right 1

Additional information

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