[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 32 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_keep_parent# (boolvar, old_child_inode, fi, fo; old_parent_inode, new_child_inode, old_dent, new_dent, err, ri, ro, fs, log, boolvar2) else aubifs_rename_new_keep_parent#(boolvar, old_child_inode, fi, ro, fo; old_parent_inode, old_dent, new_dent, err, ri, 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[inodekey(m)]].size = 0, inodekey(m) ∈ ro

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 33:
new_child_inode = mkinode(m0, md0, boolvar4, m1, m2, m3), 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)]].size ≠ 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, 1 ≤ fs[ri[inodekey(m4)]].size, ¬ inodekey(m4) ∈ ro, boolvar5 → 1 ≤ fs[ri[inodekey(m4)]].nsubdirs, 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, new_dent.negdentry? ∧ ¬ dentrykey(m4, new_dent.name) ∈ ri ∨ new_dent.dentry? ∧ 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(m4, 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 new_dent.dentry? then aubifs_rename_overwrite_keep_parent# (mkinode(fs[ri[dentrykey(m4, str)]].ino, md1, boolvar5, m5, m6, m7).directory, 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) else aubifs_rename_new_keep_parent# (mkinode(fs[ri[dentrykey(m4, str)]].ino, md1, boolvar5, m5, m6, m7).directory, mkinode(fs[ri[dentrykey(m4, str)]].ino, md1, boolvar5, m5, m6, m7), fi, ro, fo ; old_parent_inode, old_dent, new_dent, err, ri, 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: ubifs-parent-in: ⊦ dentrykey(ino, str) ∈ ri ∧ ubifs-cons(fs, ri, ro, fi, fo, log) → inodekey(ino) ∈ ri; (forward) from specification aubifs-inv%not-zero: 0 < n ⊦ (* n) ≤ m → m ≠ 0; (forward) from specification nat% ⊦ mkinode(m, md, boolvar, m0, m1, m2).ino = m; (s)