[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 4 from proof inv-lookup (previous step)

boolvar0 ↔ boolvar2, boolvar ↔ boolvar1, fo.inodes?, ro.inodes?, log-cons(log, fs), ri-cons(ri, fs), ri-inj(fi), ri-inj(ri) ⊦ ⟪if ri-cons(ri, fs) then {fail_or_success#(; ; err); if err = ESUCCESS then {boolvar := key ∈ ri; if boolvar then nd := fs[ri[key]] else nd := ?} else boolvar := ?, nd := ?} else abort⟫ true

Heuristic symbolic execution applied rule if positive right

And obtained the following new goals

Proof step 5:
boolvar ↔ boolvar1, boolvar0 ↔ boolvar2, ro.inodes?, fo.inodes?, log-cons(log, fs), ri-cons(ri, fs), ri-inj(ri), ri-inj(fi) ⊦ ⟪fail_or_success#(; ; err); if err = ESUCCESS then {boolvar := key ∈ ri; if boolvar then nd := fs[ri[key]] else nd := ?} else boolvar := ?, nd := ?⟫ true

Rule argument

pos: right 1

Additional information

Used simplifier rules: ⊦ ri-cons(ri, fs) → ( ri-cons(ri0, fs0) ↔ (∀ key. (key ∈ ri → ri[key] ∈ fs ∧ key-cons(key, fs[ri[key]])) → key ∈ ri0 → ri0[key] ∈ fs0 ∧ key-cons(key, fs0[ri0[key]]))); (ss)