[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 772 from proof refine-rename-overwrite-reparent-file (previous step)

m12 + 1 = fs[ri[inodekey(m0)]].nlink, 0 = fs[ri[inodekey(m0)]].nsubdirs, fs[ri[inodekey(m)]] = inodenode(key3, md5, false, m10, 0, m13), fs[ri[inodekey(m4)]] = inodenode(key1, md3, true, m1, m3, m6), fs[ri[dentrykey(m9, str)]] = dentrynode(key, m), fs[ri[dentrykey(m4, str0)]] = dentrynode(key0, m0), fs[ri[inodekey(m9)]] = inodenode(key2, md4, true, m7, m8, m14 + 1), dirs = abs-dirs(fs, ri), err = err1, files = abs-files(fs, ri), new_child_inode = new_dent_inode, new_dent = old_dent1, new_dent_inode = mkinode(m0, md0, false, m12 + 1, 0, m5), new_inode = mkinode(m4, md1, true, m1, m3, m6), new_parent_inode = new_inode, old_child_inode = old_dent_inode, old_dent = old_dent0, old_dent0 = mkdentry(str, m), old_dent1 = mkdentry(str0, m0), old_dent_inode = mkinode(m, md, false, m10, 0, m2), old_inode = mkinode(m9, md2, true, m7, m8, m14 + 1), old_parent_inode = old_inode, fo.inodes?, orphans(fs, ri).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)), replay-cons-strong(fs, ri, orphans(fs, ri), fi, fo, log), ri-cons(ri, fs), ri-inj(fi), ri-inj(ri), ubifs-cons(fs, ri, orphans(fs, ri), fi, fo, log), inodekey(m) ∈ ri, ri[inodekey(m)] ∈ fs, inodekey(m9) ∈ ri, ri[inodekey(m9)] ∈ fs, inodekey(m0) ∈ ri, ri[inodekey(m4)] ∈ fs, inodekey(m4) ∈ ri, ri[dentrykey(m4, str0)] ∈ fs, dentrykey(m4, str0) ∈ ri, ri[dentrykey(m9, str)] ∈ fs, dentrykey(m9, str) ∈ ri, ⌊err0⌋ , m12 = 0 → links(m0, fs, ri) = ∅ ++ dentrykey(m4, str0), boolvar2 → boolvar0, links(m9, abs-dirs(fs, ri)) ≠ ∅ ∨ m9 = ROOT_INO, links(m4, abs-dirs(fs, ri)) ≠ ∅ ∨ m4 = ROOT_INO, m7 ≠ 0 ∨ m9 = ROOT_INO, m1 ≠ 0 ∨ m4 = ROOT_INO ⊦ ⟨if pre-rename(old_parent_inode, old_dent, old_child_inode, new_parent_inode, new_dent, new_child_inode, dirs, files) then { let old_ino = old_parent_inode.ino, new_ino = new_parent_inode.ino, boolvar0 = new_dent.dentry? in let boolvar = old_ino = new_ino ∧ new_dent = old_dent in {dirs[old_ino].entries := dirs[old_ino].entries -- old_dent.name; if ¬ boolvar then {dirs[old_ino].size := dirs[old_ino].size - 1; if old_dent.ino ∈ dirs then dirs[old_ino].nsubdirs := dirs[old_ino].nsubdirs - 1}; dirs[new_ino].entries[new_dent.name] := old_dent.ino; if boolvar0 ∧ ¬ boolvar then let ino = new_dent.ino in afs_drop_nlink#(ino; dirs, files); if ¬ boolvar0 then {dirs[new_ino].size := dirs[new_ino].size + 1; if old_dent.ino ∈ dirs then dirs[new_ino].nsubdirs := dirs[new_ino].nsubdirs + 1}; new_dent := mkdentry(new_dent.name, old_dent.ino); old_dent := negdentry(old_dent.name); afs_inode_sync#(old_parent_inode; dirs, files); afs_inode_sync#(new_parent_inode; dirs, files); if boolvar0 then {afs_inode_sync#(new_child_inode; dirs, files); new_child_inode := getinode(new_child_inode.ino, dirs, files)}; old_parent_inode := getinode(old_parent_inode.ino, dirs, files); new_parent_inode := getinode(new_parent_inode.ino, dirs, files); err := ESUCCESS} or fail#(; ; err); asynced := ?} else abort⟩ ( dirs = abs-dirs(fs, ri) ∧ files = abs-files(fs, ri) ∧ (asynced → boolvar1) ∧ mkinode(m9, md2, true, m7, m8, m14 + 1) = old_parent_inode ∧ mkinode(m4, md1, true, m1, m3, m6) = new_parent_inode ∧ mkinode(m, md, false, m10, 0, m2) = old_child_inode ∧ mkinode(m0, md0, false, m12 + 1, 0, m5) = new_child_inode ∧ mkdentry(str, m) = old_dent ∧ mkdentry(str0, m0) = new_dent ∧ err0 = err), m0 = ROOT_INO, m0 = 0, m4 = 0, m9 = m4, m9 = 0, fs[ri[inodekey(m0)]].directory, m1 = 0 ∧ m4 ≠ ROOT_INO, m7 = 0 ∧ m9 ≠ ROOT_INO

Heuristic conditional right split applied rule if right

And obtained the following new goals

Rule argument

pos: right 1

Additional information