Proof step 706 from proof refine-rename-overwrite-reparent-file (previous step)

Heuristic unfold applied rule call right

And obtained the following new goals

• Proof step 707:

  m14 + 1 = fs[ri[inodekey(m9)]].size, m12 + 1 = fs[ri[inodekey(fs[ri[dentrykey(m4, str0)]].ino)]].nlink, 0 = fs[ri[inodekey(fs[ri[dentrykey(m9, str)]].ino)]].nsubdirs, 0 = fs[ri[inodekey(fs[ri[dentrykey(m4, str0)]].ino)]].nsubdirs, dirs = abs-dirs(fs, ri), err = err0, files = abs-files(fs, ri), new_child_inode = new_dent_inode, new_dent = old_dent1, new_dent_inode = mkinode(fs[ri[dentrykey(m4, str0)]].ino, md0, false, m12 + 1, 0, m5), new_inode = mkinode(m4, md1, true, fs[ri[inodekey(m4)]].nlink, fs[ri[inodekey(m4)]].nsubdirs, fs[ri[inodekey(m4)]].size), new_parent_inode = new_inode, old_child_inode = old_dent_inode, old_dent = old_dent0, old_dent0 = mkdentry(str, fs[ri[dentrykey(m9, str)]].ino), old_dent1 = mkdentry(str0, fs[ri[dentrykey(m4, str0)]].ino), old_dent_inode = mkinode(fs[ri[dentrykey(m9, str)]].ino, md, false, fs[ri[inodekey(fs[ri[dentrykey(m9, str)]].ino)]].nlink, 0, m2), old_inode = mkinode(m9, md2, true, fs[ri[inodekey(m9)]].nlink, fs[ri[inodekey(m9)]].nsubdirs, m14 + 1), old_parent_inode = old_inode, fs[ri[inodekey(m4)]].directory, fs[ri[inodekey(m9)]].directory, orphans(fs, ri).inodes?, fo.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(ri), ri-inj(fi), ubifs-cons(fs, ri, orphans(fs, ri), fi, fo, log), inodekey(m9) ∈ ri, inodekey(m4) ∈ ri, dentrykey(m4, str0) ∈ ri, inodekey(fs[ri[dentrykey(m4, str0)]].ino) ∈ ri, dentrykey(m9, str) ∈ ri, inodekey(fs[ri[dentrykey(m9, str)]].ino) ∈ ri, boolvar2 → boolvar0, m12 = 0 → links(fs[ri[dentrykey(m4, str0)]].ino, fs, ri) = ∅ ++ dentrykey(m4, str0), ∀ adr, adr0, adr1, adr2, adr3. adr ∈ fs ∨ adr0 ∈ fs ∨ adr1 ∈ fs ∨ adr2 ∈ fs ∨ adr3 ∈ fs ∨ adr = adr0 ∨ adr = adr1 ∨ adr = adr2 ∨ adr = adr3 ∨ adr0 = adr1 ∨ adr0 = adr2 ∨ adr0 = adr3 ∨ adr1 = adr2 ∨ adr1 = adr3 ∨ adr2 = adr3, fs[ri[inodekey(m4)]].nlink ≠ 0 ∨ m4 = ROOT_INO, fs[ri[inodekey(m9)]].nlink ≠ 0 ∨ m9 = ROOT_INO, links(m4, abs-dirs(fs, ri)) ≠ ∅ ∨ m4 = ROOT_INO, links(m9, abs-dirs(fs, ri)) ≠ ∅ ∨ m9 = 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, fs[ri[inodekey(m9)]].nlink, fs[ri[inodekey(m9)]].nsubdirs, m14 + 1) = old_parent_inode ∧ mkinode(m4, md1, true, fs[ri[inodekey(m4)]].nlink, fs[ri[inodekey(m4)]].nsubdirs, fs[ri[inodekey(m4)]].size) = new_parent_inode ∧ mkinode(fs[ri[dentrykey(m9, str)]].ino, md, false, fs[ri[inodekey(fs[ri[dentrykey(m9, str)]].ino)]].nlink, 0, m2) = old_child_inode ∧ mkinode(fs[ri[dentrykey(m4, str0)]].ino, md0, false, m12 + 1, 0, m5) = new_child_inode ∧ mkdentry(str, fs[ri[dentrykey(m9, str)]].ino) = old_dent ∧ mkdentry(str0, fs[ri[dentrykey(m4, str0)]].ino) = new_dent ∧ ENOSPC = err), fs[ri[dentrykey(m4, str0)]].ino = ROOT_INO, fs[ri[dentrykey(m4, str0)]].ino = 0, m4 = 0, m9 = m4, m9 = 0, fs[ri[inodekey(fs[ri[dentrykey(m9, str)]].ino)]].directory, fs[ri[inodekey(fs[ri[dentrykey(m4, str0)]].ino)]].directory, fs[ri[inodekey(m9)]].nlink = 0 ∧ m9 ≠ ROOT_INO, fs[ri[inodekey(m4)]].nlink = 0 ∧ m4 ≠ ROOT_INO

Rule argument

Additional information

Used simplifier rules: afs_rename# (; OLD_PARENT_INODE, NEW_PARENT_INODE, OLD_CHILD_INODE, NEW_CHILD_INODE, OLD_DENT, NEW_DENT, ERR, DIRS, FILES ; ASYNCED ) {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, OVERWRITE = NEW_DENT.dentry? in let IDENTITY = OLD_INO = NEW_INO ∧ NEW_DENT = OLD_DENT in {DIRS[OLD_INO].entries := DIRS[OLD_INO].entries -- OLD_DENT.name; if ¬ IDENTITY 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 OVERWRITE ∧ ¬ IDENTITY then let INO = NEW_DENT.ino in afs_drop_nlink#(INO; DIRS, FILES); if ¬ OVERWRITE 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 OVERWRITE 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 };