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

fo.inodes?, ro.inodes?, file-node-cons(fs, ri), log-cons(log, fs), orphans-cons(fs, ri, ro), replay-cons-strong(fs, ri, ro, fi, fo, log), ri-inj(fi), ri-inj(ri), ubifs-cons(fs, ri, ro, fi, fo, log), inodekey(ino) ∈ ri ⊦ ⟪fail_or_success#(; ; err); if err = ESUCCESS then {boolvar := inodekey(ino) ∈ ri; if boolvar then nd := fs[ri[inodekey(ino)]] else nd := ?} else boolvar := ?, nd := ?; if err = ESUCCESS ∧ boolvar then inode := mkinode(ino, nd.meta, nd.directory, nd.nlink, (nd.directory ⊃ nd.nsubdirs;0), nd.size)⟫ true

Heuristic unfold applied rule call right

And obtained the following new goals

Proof step 15:
ro.inodes?, fo.inodes?, file-node-cons(fs, ri), log-cons(log, fs), orphans-cons(fs, ri, ro), replay-cons-strong(fs, ri, ro, fi, fo, log), ri-inj(ri), ri-inj(fi), ubifs-cons(fs, ri, ro, fi, fo, log), inodekey(ino) ∈ ri ⊦ ⟪choose err0 with ⌊err0⌋ ∨ err0 = ESUCCESS in err := err0; if err = ESUCCESS then {boolvar := inodekey(ino) ∈ ri; if boolvar then nd := fs[ri[inodekey(ino)]] else nd := ?} else boolvar := ?, nd := ?; if err = ESUCCESS ∧ boolvar then inode := mkinode(ino, nd.meta, nd.directory, nd.nlink, (nd.directory ⊃ nd.nsubdirs;0), nd.size)⟫ true

Rule argument

pos: right 1

Additional information

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