[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 104 from proof refine-evict (previous step)

fs[ri[inodekey(m0)]].nlink = 0, fs[ri[inodekey(ROOT_INO)]].directory, orphans(fs, ri).inodes?, fo.inodes?, file-node-cons(fs, ri), log-cons(log, fs), orphans-cons(fs, ri, orphans(fs, ri)), replay-cons-strong(fs, ri, orphans(fs, ri), fi, fo, log), ri-inj(ri), ri-inj(fi), ubifs-cons(fs, ri, orphans(fs, ri), fi, fo, log), inodekey(m) ∈ ri, dentrykey(m0, str) ∈ ri, inodekey(m0) ∈ ri, inodekey(ROOT_INO) ∈ ri, asynced → boolvar, ∀ ino. (inodekey(ino) ∈ ri ∧ fs[ri[inodekey(ino)]].directory ∧ ino ≠ ROOT_INO ∧ links(ino, abs-dirs(fs, ri)) = ∅ → abs-children(ino, fs, ri) = ∅) ∧ ( inodekey(ino) ∈ ri ∧ fs[ri[inodekey(ino)]].directory → fs[ri[inodekey(ino)]].nlink = # links(ino, abs-dirs(fs, ri)) ∧ fs[ri[inodekey(ino)]].nlink ≤ 1 ∧ fs[ri[inodekey(ino)]].size = # abs-children(ino, fs, ri) ∧ fs[ri[inodekey(ino)]].nsubdirs = # subdirs(ino, abs-dirs(fs, ri))) ∧ (inodekey(ino) ∈ ri ∧ ¬ fs[ri[inodekey(ino)]].directory → fs[ri[inodekey(ino)]].nlink = # links(ino, abs-dirs(fs, ri))) ∧ (∀ name. inodekey(ino) ∈ ri ∧ dentrykey(ino, name) ∈ ri → inodekey(abs-dirs(fs, ri)[ino].entries[name]) ∈ ri ∧ fs[ri[inodekey(abs-dirs(fs, ri)[ino].entries[name])]].directory ∨ inodekey(abs-dirs(fs, ri)[ino].entries[name]) ∈ ri ∧ ¬ fs[ri[inodekey(abs-dirs(fs, ri)[ino].entries[name])]].directory), fs[ri[inodekey(m)]].directory ∧ m2 = fs[ri[inodekey(m)]].size ∧ m1 = fs[ri[inodekey(m)]].nsubdirs ∧ boolvar0 ∨ ¬ fs[ri[inodekey(m)]].directory ∧ m1 = 0 ∧ ¬ boolvar0 ⊦ # dentrykeys(inodekey(m0), ri) = 0, dentrykeys(inodekey(m0), ri) = ∅, m = ROOT_INO, m0 = ROOT_INO

User applied rule all left

And obtained the following new goals

Proof step 105:
fs[ri[inodekey(m0)]].nlink = 0, fs[ri[inodekey(ROOT_INO)]].directory, fo.inodes?, orphans(fs, ri).inodes?, file-node-cons(fs, ri), log-cons(log, fs), orphans-cons(fs, ri, orphans(fs, ri)), replay-cons-strong(fs, ri, orphans(fs, ri), fi, fo, log), ri-inj(fi), ri-inj(ri), ubifs-cons(fs, ri, orphans(fs, ri), fi, fo, log), inodekey(ROOT_INO) ∈ ri, inodekey(m0) ∈ ri, dentrykey(m0, str) ∈ ri, inodekey(m) ∈ ri, asynced → boolvar, inodekey(m0) ∈ ri ∧ fs[ri[inodekey(m0)]].directory ∧ m0 ≠ ROOT_INO ∧ links(m0, abs-dirs(fs, ri)) = ∅ → abs-children(m0, fs, ri) = ∅, inodekey(m0) ∈ ri ∧ fs[ri[inodekey(m0)]].directory → fs[ri[inodekey(m0)]].nlink = # links(m0, abs-dirs(fs, ri)) ∧ fs[ri[inodekey(m0)]].nlink ≤ 1 ∧ fs[ri[inodekey(m0)]].size = # abs-children(m0, fs, ri) ∧ fs[ri[inodekey(m0)]].nsubdirs = # subdirs(m0, abs-dirs(fs, ri)), inodekey(m0) ∈ ri ∧ ¬ fs[ri[inodekey(m0)]].directory → fs[ri[inodekey(m0)]].nlink = # links(m0, abs-dirs(fs, ri)), ∀ name. inodekey(m0) ∈ ri ∧ dentrykey(m0, name) ∈ ri → inodekey(abs-dirs(fs, ri)[m0].entries[name]) ∈ ri ∧ fs[ri[inodekey(abs-dirs(fs, ri)[m0].entries[name])]].directory ∨ inodekey(abs-dirs(fs, ri)[m0].entries[name]) ∈ ri ∧ ¬ fs[ri[inodekey(abs-dirs(fs, ri)[m0].entries[name])]].directory, fs[ri[inodekey(m)]].directory ∧ m2 = fs[ri[inodekey(m)]].size ∧ m1 = fs[ri[inodekey(m)]].nsubdirs ∧ boolvar0 ∨ ¬ fs[ri[inodekey(m)]].directory ∧ m1 = 0 ∧ ¬ boolvar0 ⊦ # dentrykeys(inodekey(m0), ri) = 0, dentrykeys(inodekey(m0), ri) = ∅, m = ROOT_INO, m0 = ROOT_INO

Rule argument

pos: left 17 terms: m0 abort: F discard: T computed: F

Additional information

Used terms: m0