[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 1140 from proof refine-rename-overwrite-keep-parent-different (previous step)

m11 + 1 = fs[ri[inodekey(m7)]].size, n0 + (boolvar1 ⊃ 1;0) = fs[ri[inodekey(m7)]].nsubdirs, boolvar0 ↔ boolvar, ¬ fs[ri[inodekey(fs[ri[dentrykey(m7, str0)]].ino)]].directory ↔ ¬ fs[ri[inodekey(fs[ri[dentrykey(m7, str)]].ino)]].directory, adr1 = adr5, dirs = abs-dirs(fs, ri), err = err0, files = abs-files(fs, ri), m = fs[ri[dentrykey(m7, str)]].ino, m3 = fs[ri[dentrykey(m7, str0)]].ino, m8 = fs[ri[inodekey(m7)]].nlink, nd0 = inodenode(inodekey(m7), md1, true, fs[ri[inodekey(m7)]].nlink, n0, m11), new_child_inode = mkinode(fs[ri[dentrykey(m7, str0)]].ino, md0, boolvar2, m10 + 1, m5, m6), new_dent = mkdentry(str0, fs[ri[dentrykey(m7, str0)]].ino), old_dent = mkdentry(str, fs[ri[dentrykey(m7, str)]].ino), old_dent0 = mkdentry(str, m), old_dent1 = mkdentry(str0, m3), old_inode = mkinode(m7, md1, true, m8, n0 + (boolvar1 ⊃ 1;0), m11 + 1), old_parent_inode = mkinode(m7, md1, true, fs[ri[inodekey(m7)]].nlink, n0 + (boolvar1 ⊃ 1;0), m11 + 1), ro0 = orphans(fs, ri), fs[ri[dentrykey(m7, str)]].dentry?, fs[ri[dentrykey(m7, str0)]].dentry?, fs[ri[inodekey(m7)]].directory, fs[ri[inodekey(m7)]].inode?, fo.inodes?, orphans(fs, ri).inodes?, ro0.inodes?, afs-cons(abs-dirs(fs, ri), abs-files(fs, ri)), file-node-cons(fs, ri), log-cons(log, fs), orphans-cons(fs, ri, orphans(fs, ri)), orphans-cons(fs, ri, ro0), replay-cons-strong(fs, ri, orphans(fs, ri), fi, fo, log), replay-cons-strong(fs, ri, ro0, fi, fo, log), ri-cons(ri, fs), ri-inj(fi), ri-inj(ri), ubifs-cons(fs, ri, orphans(fs, ri), fi, fo, log), ubifs-cons(fs, ri, ro0, fi, fo, log), dentrykey(m7, str) ∈ ri, ri[dentrykey(m7, str)] ∈ fs, inodekey(m7) ∈ ri, ri[inodekey(m7)] ∈ fs, inodekey(fs[ri[dentrykey(m7, str)]].ino) ∈ ri, inodekey(fs[ri[dentrykey(m7, str0)]].ino) ∈ ri, ri[dentrykey(m7, str0)] ∈ fs, dentrykey(m7, str0) ∈ ri, ⌊err0⌋ , m10 = 0 → links(fs[ri[dentrykey(m7, str0)]].ino, fs, ri) = ∅ ++ dentrykey(m7, str0), boolvar3 → boolvar4, fs[ri[inodekey(fs[ri[dentrykey(m7, str0)]].ino)]].directory → abs-children(fs[ri[dentrykey(m7, str0)]].ino, fs, ri) = ∅, fs[ri[inodekey(fs[ri[dentrykey(m7, str0)]].ino)]].directory → dentrykeys(inodekey(fs[ri[dentrykey(m7, str0)]].ino), ri) = ∅, fs[ri[inodekey(m7)]].nlink ≠ 0 ∨ m7 = ROOT_INO, links(m7, abs-dirs(fs, ri)) ≠ ∅ ∨ m7 = ROOT_INO, ¬ fs[ri[inodekey(fs[ri[dentrykey(m7, str)]].ino)]].directory ∧ ¬ boolvar1 ∧ m0 = fs[ri[inodekey(fs[ri[dentrykey(m7, str)]].ino)]].nlink ∧ m1 = fs[ri[inodekey(fs[ri[dentrykey(m7, str)]].ino)]].nsubdirs ∨ fs[ri[inodekey(fs[ri[dentrykey(m7, str)]].ino)]].directory ∧ boolvar1 ∧ m0 = fs[ri[inodekey(fs[ri[dentrykey(m7, str)]].ino)]].nlink ∧ m1 = fs[ri[inodekey(fs[ri[dentrykey(m7, str)]].ino)]].nsubdirs ∧ m2 = fs[ri[inodekey(fs[ri[dentrykey(m7, str)]].ino)]].size, ¬ fs[ri[inodekey(fs[ri[dentrykey(m7, str)]].ino)]].directory ∧ ¬ boolvar2 ∧ m10 + 1 = fs[ri[inodekey(fs[ri[dentrykey(m7, str0)]].ino)]].nlink ∧ m5 = fs[ri[inodekey(fs[ri[dentrykey(m7, str0)]].ino)]].nsubdirs ∨ fs[ri[inodekey(fs[ri[dentrykey(m7, str0)]].ino)]].directory ∧ boolvar2 ∧ m10 + 1 = fs[ri[inodekey(fs[ri[dentrykey(m7, str0)]].ino)]].nlink ∧ m5 = fs[ri[inodekey(fs[ri[dentrykey(m7, str0)]].ino)]].nsubdirs ∧ m6 = fs[ri[inodekey(fs[ri[dentrykey(m7, str0)]].ino)]].size, fs[ri[inodekey(fs[ri[dentrykey(m7, str)]].ino)]].directory ∧ m0 = fs[ri[inodekey(fs[ri[dentrykey(m7, str)]].ino)]].nlink ∧ m2 = fs[ri[inodekey(fs[ri[dentrykey(m7, str)]].ino)]].size ∧ m1 = fs[ri[inodekey(fs[ri[dentrykey(m7, str)]].ino)]].nsubdirs ∧ boolvar1 ∨ ¬ fs[ri[inodekey(fs[ri[dentrykey(m7, str)]].ino)]].directory ∧ m0 = fs[ri[inodekey(fs[ri[dentrykey(m7, str)]].ino)]].nlink ∧ m1 = 0 ∧ ¬ boolvar1, fs[ri[inodekey(fs[ri[dentrykey(m7, str0)]].ino)]].directory ∧ m10 + 1 = fs[ri[inodekey(fs[ri[dentrykey(m7, str0)]].ino)]].nlink ∧ m6 = fs[ri[inodekey(fs[ri[dentrykey(m7, str0)]].ino)]].size ∧ m5 = fs[ri[inodekey(fs[ri[dentrykey(m7, str0)]].ino)]].nsubdirs ∧ boolvar2 ∨ ¬ fs[ri[inodekey(fs[ri[dentrykey(m7, str)]].ino)]].directory ∧ m10 + 1 = fs[ri[inodekey(fs[ri[dentrykey(m7, str0)]].ino)]].nlink ∧ m5 = 0 ∧ ¬ boolvar2 ⊦ ⟨old_dent_inode := mkinode(m, md, boolvar1, m0, m1, m2); new_dent_inode := mkinode(m3, md0, boolvar2, m10 + 1, m5, m6); new_inode := mkinode(m7, md1, true, m8, n0 + (boolvar1 ⊃ 1;0), m11 + 1); afs_rename#(; old_inode, new_inode, old_dent_inode, new_dent_inode, old_dent0, old_dent1, err1, dirs, files; boolvar3)⟩ ( dirs = abs-dirs(fs, ri) ∧ files = abs-files(fs, ri) ∧ orphans(abs-dirs(fs, ri), abs-files(fs, ri)) = abs-keys(ro0) ∧ (boolvar3 → boolvar0) ∧ old_parent_inode = old_inode ∧ old_parent_inode = new_inode ∧ mkinode(m, md, boolvar1, m0, m1, m2) = old_dent_inode ∧ new_child_inode = new_dent_inode ∧ old_dent = old_dent0 ∧ new_dent = old_dent1 ∧ err = err1), fs[ri[dentrykey(m7, str0)]].ino = 0, fs[ri[dentrykey(m7, str0)]].ino = ROOT_INO, m7 = 0, mkdentry(str, fs[ri[dentrykey(m7, str)]].ino) = mkdentry(str0, fs[ri[dentrykey(m7, str0)]].ino), fs[ri[inodekey(m7)]].nlink = 0 ∧ m7 ≠ ROOT_INO

Heuristic symbolic execution applied rule assign right

And obtained the following new goals

Rule argument

Additional information