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

jvalid ↔ jvalid0, ax = log, gndx = [], gstore0 = gstore2, jro = ginval, lnum = n, inv(gstore2), n ∈ gstore2 ⊦ ⟪if lnum ∈ gstore0 ∧ ¬ lnum ∈ jro then {fail_or_success#(; ; err); if err = ESUCCESS then ax := ax + gstore0[lnum].ladrlist.to-adr(lnum), gndx := gndx + gstore0[lnum].gndlist else ax := ?, gndx := ?} else abort; 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

Heuristic symbolic execution applied rule if positive right

And obtained the following new goals

Proof step 7:
jvalid ↔ jvalid0, ax = log, gndx = [], gstore0 = gstore2, jro = ginval, lnum = n, inv(gstore2), n ∈ gstore2 ⊦ ⟪fail_or_success#(; ; err); if err = ESUCCESS then ax := ax + gstore0[lnum].ladrlist.to-adr(lnum), gndx := gndx + gstore0[lnum].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

Proof step 6 from proof term-remove-nonend-blocks (previous step)

Heuristic symbolic execution applied rule if positive right

And obtained the following new goals

Rule argument

Additional information