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

¬ fs[ri[inodekey(fs[ri[dentrykey(m4, str0)]].ino)]].directory ↔ ¬ fs[ri[inodekey(fs[ri[dentrykey(m4, str)]].ino)]].directory, mkinode(fs[ri[dentrykey(m4, str)]].ino, md1, boolvar5, m5, m6, m7) = mkinode(m, md2, boolvar, m0, m8, m9), new_child_inode = mkinode(fs[ri[dentrykey(m4, str0)]].ino, md0, boolvar4, m1, m2, m3), new_dent = mkdentry(str0, fs[ri[dentrykey(m4, str0)]].ino), old_dent = mkdentry(str, fs[ri[dentrykey(m4, str)]].ino), old_parent_inode = mkinode(m4, md, true, fs[ri[inodekey(m4)]].nlink, fs[ri[inodekey(m4)]].nsubdirs, fs[ri[inodekey(m4)]].size), fs[ri[inodekey(m4)]].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), dentrykey(m4, str) ∈ ri, inodekey(fs[ri[dentrykey(m4, str)]].ino) ∈ ri, inodekey(m4) ∈ ri, inodekey(fs[ri[dentrykey(m4, str0)]].ino) ∈ ri, dentrykey(m4, str0) ∈ ri, 1 ≤ fs[ri[inodekey(m4)]].size, boolvar5 → 1 ≤ fs[ri[inodekey(m4)]].nsubdirs, fs[ri[inodekey(fs[ri[dentrykey(m4, str0)]].ino)]].directory → dentrykeys(inodekey(fs[ri[dentrykey(m4, str0)]].ino), ri) = ∅, m1 = 1 → links(fs[ri[dentrykey(m4, str0)]].ino, fs, ri) = ∅ ++ dentrykey(m4, str0), fs[ri[inodekey(m4)]].nlink ≠ 0 ∨ m4 = ROOT_INO, ¬ fs[ri[inodekey(fs[ri[dentrykey(m4, str)]].ino)]].directory ∧ ¬ boolvar5 ∧ m5 = fs[ri[inodekey(fs[ri[dentrykey(m4, str)]].ino)]].nlink ∧ m6 = fs[ri[inodekey(fs[ri[dentrykey(m4, str)]].ino)]].nsubdirs ∨ fs[ri[inodekey(fs[ri[dentrykey(m4, str)]].ino)]].directory ∧ boolvar5 ∧ m5 = fs[ri[inodekey(fs[ri[dentrykey(m4, str)]].ino)]].nlink ∧ m6 = fs[ri[inodekey(fs[ri[dentrykey(m4, str)]].ino)]].nsubdirs ∧ m7 = fs[ri[inodekey(fs[ri[dentrykey(m4, str)]].ino)]].size, ¬ fs[ri[inodekey(fs[ri[dentrykey(m4, str)]].ino)]].directory ∧ ¬ boolvar4 ∧ m1 = fs[ri[inodekey(fs[ri[dentrykey(m4, str0)]].ino)]].nlink ∧ m2 = fs[ri[inodekey(fs[ri[dentrykey(m4, str0)]].ino)]].nsubdirs ∨ fs[ri[inodekey(fs[ri[dentrykey(m4, str0)]].ino)]].directory ∧ boolvar4 ∧ m1 = fs[ri[inodekey(fs[ri[dentrykey(m4, str0)]].ino)]].nlink ∧ m2 = fs[ri[inodekey(fs[ri[dentrykey(m4, str0)]].ino)]].nsubdirs ∧ m3 = fs[ri[inodekey(fs[ri[dentrykey(m4, str0)]].ino)]].size ⊦ ⟪aubifs_rename_overwrite_keep_parent# (boolvar, mkinode(fs[ri[dentrykey(m4, str)]].ino, md1, boolvar5, m5, m6, m7), fi, fo ; old_parent_inode, new_child_inode, old_dent, new_dent, err, ri, ro, fs, log, boolvar2); new_parent_inode := old_parent_inode⟫ (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[dentrykey(m4, str0)]].ino = ROOT_INO, fs[ri[inodekey(m4)]].size = 0, m1 = 0, inodekey(m4) ∈ ro

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 39:
¬ fs[ri[inodekey(fs[ri[dentrykey(m4, str0)]].ino)]].directory ↔ ¬ fs[ri[inodekey(fs[ri[dentrykey(m4, str)]].ino)]].directory, new_child_inode = mkinode(fs[ri[dentrykey(m4, str0)]].ino, md0, boolvar4, m1, m2, m3), new_dent = mkdentry(str0, fs[ri[dentrykey(m4, str0)]].ino), old_dent = mkdentry(str, fs[ri[dentrykey(m4, str)]].ino), old_parent_inode = mkinode(m4, md, true, fs[ri[inodekey(m4)]].nlink, fs[ri[inodekey(m4)]].nsubdirs, fs[ri[inodekey(m4)]].size), fs[ri[dentrykey(m4, str0)]].ino ≠ ROOT_INO, fs[ri[inodekey(m4)]].size ≠ 0, m1 ≠ 0, fs[ri[inodekey(m4)]].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), dentrykey(m4, str) ∈ ri, inodekey(fs[ri[dentrykey(m4, str)]].ino) ∈ ri, inodekey(m4) ∈ ri, inodekey(fs[ri[dentrykey(m4, str0)]].ino) ∈ ri, dentrykey(m4, str0) ∈ ri, 1 ≤ fs[ri[inodekey(m4)]].size, ¬ inodekey(m4) ∈ ro, boolvar → 1 ≤ fs[ri[inodekey(m4)]].nsubdirs, fs[ri[inodekey(fs[ri[dentrykey(m4, str0)]].ino)]].directory → dentrykeys(inodekey(fs[ri[dentrykey(m4, str0)]].ino), ri) = ∅, m1 = 1 → links(fs[ri[dentrykey(m4, str0)]].ino, fs, ri) = ∅ ++ dentrykey(m4, str0), fs[ri[inodekey(m4)]].nlink ≠ 0 ∨ m4 = ROOT_INO, ¬ fs[ri[inodekey(fs[ri[dentrykey(m4, str)]].ino)]].directory ∧ ¬ boolvar ∧ m0 = fs[ri[inodekey(fs[ri[dentrykey(m4, str)]].ino)]].nlink ∧ m8 = fs[ri[inodekey(fs[ri[dentrykey(m4, str)]].ino)]].nsubdirs ∨ fs[ri[inodekey(fs[ri[dentrykey(m4, str)]].ino)]].directory ∧ boolvar ∧ m0 = fs[ri[inodekey(fs[ri[dentrykey(m4, str)]].ino)]].nlink ∧ m8 = fs[ri[inodekey(fs[ri[dentrykey(m4, str)]].ino)]].nsubdirs ∧ m9 = fs[ri[inodekey(fs[ri[dentrykey(m4, str)]].ino)]].size, ¬ fs[ri[inodekey(fs[ri[dentrykey(m4, str)]].ino)]].directory ∧ ¬ boolvar4 ∧ m1 = fs[ri[inodekey(fs[ri[dentrykey(m4, str0)]].ino)]].nlink ∧ m2 = fs[ri[inodekey(fs[ri[dentrykey(m4, str0)]].ino)]].nsubdirs ∨ fs[ri[inodekey(fs[ri[dentrykey(m4, str0)]].ino)]].directory ∧ boolvar4 ∧ m1 = fs[ri[inodekey(fs[ri[dentrykey(m4, str0)]].ino)]].nlink ∧ m2 = fs[ri[inodekey(fs[ri[dentrykey(m4, str0)]].ino)]].nsubdirs ∧ m3 = fs[ri[inodekey(fs[ri[dentrykey(m4, str0)]].ino)]].size ⊦ ⟪aubifs_rename_overwrite_keep_parent# (boolvar, mkinode(fs[ri[dentrykey(m4, str)]].ino, md2, boolvar, m0, m8, m9), fi, fo ; old_parent_inode, new_child_inode, old_dent, new_dent, err, ri, ro, fs, log, boolvar2); new_parent_inode := old_parent_inode⟫ (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))

Rule argument

Additional information

Used simplifier rules: ⊦ mkinode(m, md, boolvar, m0, m1, m2) = mkinode(m3, md0, boolvar0, m4, m5, m6) ↔ m = m3 ∧ md = md0 ∧ (boolvar ↔ boolvar0) ∧ m0 = m4 ∧ m1 = m5 ∧ m2 = m6; (ws)