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

boolvar2 ↔ boolvar3, boolvar1 ↔ new_dent.dentry?, boolvar0 ↔ old_parent_inode.ino ≠ new_parent_inode.ino, boolvar ↔ old_child_inode.directory, boolvar0, new_child_inode = mkinode(m0, md0, boolvar4, m1, m2, m3), new_parent_inode = mkinode(m4, md2, true, fs[ri[inodekey(m4)]].nlink, fs[ri[inodekey(m4)]].nsubdirs, fs[ri[inodekey(m4)]].size), old_child_inode = mkinode(fs[ri[dentrykey(m, str)]].ino, md1, boolvar5, m5, m6, m7), old_dent = mkdentry(str, fs[ri[dentrykey(m, str)]].ino), old_parent_inode = mkinode(m, md, true, fs[ri[inodekey(m)]].nlink, fs[ri[inodekey(m)]].nsubdirs, fs[ri[inodekey(m)]].size), fs[ri[inodekey(m4)]].directory, fs[ri[inodekey(m)]].directory, 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(m4) ∈ ri, dentrykey(m, str) ∈ ri, inodekey(fs[ri[dentrykey(m, str)]].ino) ∈ ri, inodekey(m) ∈ ri, 1 ≤ fs[ri[inodekey(m)]].size, boolvar5 → 1 ≤ fs[ri[inodekey(m)]].nsubdirs, m4 = m → md2 = md, fs[ri[inodekey(m)]].nlink ≠ 0 ∨ m = ROOT_INO, ¬ fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].directory ∧ ¬ boolvar5 ∧ m5 = fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].nlink ∧ m6 = fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].nsubdirs ∨ fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].directory ∧ boolvar5 ∧ m5 = fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].nlink ∧ m6 = fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].nsubdirs ∧ m7 = fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].size, new_dent.negdentry? ∧ (fs[ri[inodekey(m4)]].nlink ≠ 0 ∨ m4 = ROOT_INO) ∧ ¬ inodekey(m4) ∈ ro ∧ ¬ dentrykey(m4, new_dent.name) ∈ ri ∨ new_dent.dentry? ∧ (fs[ri[inodekey(m4)]].nlink ≠ 0 ∨ m4 = ROOT_INO) ∧ ¬ inodekey(m4) ∈ ro ∧ inodekey(new_dent.ino) ∈ ri ∧ dentrykey(m4, new_dent.name) ∈ ri ∧ fs[ri[dentrykey(m4, new_dent.name)]].ino = new_dent.ino ∧ ( ¬ fs[ri[inodekey(new_dent.ino)]].directory ∧ ¬ boolvar4 ∧ m1 = fs[ri[inodekey(new_dent.ino)]].nlink ∧ m2 = fs[ri[inodekey(new_dent.ino)]].nsubdirs ∨ fs[ri[inodekey(new_dent.ino)]].directory ∧ boolvar4 ∧ m1 = fs[ri[inodekey(new_dent.ino)]].nlink ∧ m2 = fs[ri[inodekey(new_dent.ino)]].nsubdirs ∧ m3 = fs[ri[inodekey(new_dent.ino)]].size) ∧ m0 = new_dent.ino ∧ (¬ fs[ri[inodekey(new_dent.ino)]].directory ↔ ¬ fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].directory) ∧ (fs[ri[inodekey(new_dent.ino)]].directory → dentrykeys(inodekey(new_dent.ino), ri) = ∅) ∧ new_dent.ino ≠ ROOT_INO ∧ m1 ≠ 0 ∧ (m1 = 1 → links(new_dent.ino, fs, ri) = ∅ ++ dentrykey(m4, new_dent.name)) ⊦ ⟪if boolvar1 then aubifs_rename_overwrite_reparent# (boolvar, old_child_inode, fi, fo; old_parent_inode, new_parent_inode, new_child_inode, old_dent, new_dent, err, ri, ro, fs, log, boolvar2) else aubifs_rename_new_reparent# (boolvar, old_child_inode, fi, ro, fo; old_parent_inode, new_parent_inode, old_dent, new_dent, err, ri, fs, log, boolvar2)⟫ (ubifs-cons(fs, ri, ro, fi, fo, log) ∧ replay-cons-strong(fs, ri, ro, fi, fo, log) ∧ file-node-cons(fs, ri) ∧ orphans-cons(fs, ri, ro)), fs[ri[inodekey(m)]].size = 0, inodekey(m) ∈ ro

Heuristic conditional right split applied rule if right

And obtained the following new goals

Rule argument

pos: right 1

Additional information