[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 142 from proof refine-rename-file-negdentry (previous step)

# links (entries[str], cache_dirs [m8, (m8 = m14 ⊃ mkdir(m0 + 1, md6, m4, m6, entries1[str0, entries[str]]);mkdir(m1, md4, # links(m8, cache_dirs), m5, entries -- str)).meta:= md0 ] [m14, (m14 = m8 ⊃ mkdir(m0 + 1, md0, m4, m6, entries1[str0, entries[str]]);mkdir(m0 + 1, md6, m4, m6, entries1[str0, entries[str]])).meta:= md5 ]) = # links(entries[str], cache_dirs), (m14 = m8 ⊃ mkdir(m1, md4, # links(m8, cache_dirs), m5, entries -- str);mkdir(m7, md7, # links(m14, cache_dirs), m11, entries2)) = mkdir(m0, md6, m4, m6, entries1), (m8 = m14 ⊃ mkdir(m0 + 1, md5, m4, m6, entries1[str0, entries[str]]);mkdir(m1, md0, # links(m8, cache_dirs), m5, entries -- str)) = mkdir(m, md, m12, m13, entries0), cache_dirs[m8] = mkdir(m1 + 1, md4, # links(m8, cache_dirs), m5, entries), ((cache_files ⊕ cache_pcache) ⊕ cache_icache)[entries[str]] = mkfile(m9, md2, # links(entries[str], cache_dirs), content), cache_dirs[m14] = mkdir(m7, md7, # links(m14, cache_dirs), m11, entries2), cache_files[entries[str]] = mkfile(m2, md3, # links(entries[str], cache_dirs), content0), afs_files = (cache_files ⊕ cache_pcache) ⊕ cache_icache, cache_dirs0 = cache_dirs, new_child_inode1 = new_child_inode0, new_dent0 = negdentry(str0), new_parent_inode0 = mkinode(m14, md5, true, # links(m14, cache_dirs), m11, m7), old_child_inode0 = mkinode(entries[str], md1, false, # links(entries[str], cache_dirs), 0, m10), old_dent0 = mkdentry(str, entries[str]), old_parent_inode0 = mkinode(m8, md0, true, # links(m8, cache_dirs), m5, m1 + 1), afs-cons(cache_dirs, cache_files), afs-cons(cache_dirs, (cache_files ⊕ cache_pcache) ⊕ cache_icache), afs-cons (cache_dirs [m8, (m8 = m14 ⊃ mkdir(m0 + 1, md6, m4, m6, entries1[str0, entries[str]]);mkdir(m1, md4, # links(m8, cache_dirs), m5, entries -- str)).meta:= md0 ] [m14, (m14 = m8 ⊃ mkdir(m0 + 1, md0, m4, m6, entries1[str0, entries[str]]);mkdir(m0 + 1, md6, m4, m6, entries1[str0, entries[str]])).meta:= md5 ], cache_files), dcache-cons(cache_dcache, cache_dirs, cache_files), icache-cons(cache_icache, cache_dirs, cache_files), pcache-cons(cache_pcache, cache_dirs, cache_files), synced(cache_dirs, cache_icache, cache_pcache), str ∈ entries, entries[str] ∈ cache_files, m14 ∈ cache_dirs, m8 ∈ cache_dirs, ¬ entries[str] ∈ cache_dirs, ¬ str0 ∈ entries2, cache_sync → synced(cache_files, cache_icache, cache_pcache), m14 = m8 → md5 = md0, links(m8, cache_dirs) ≠ ∅ ∨ m8 = ROOT_INO, links(m14, cache_dirs) ≠ ∅ ∨ m14 = ROOT_INO ⊦ ⟨afs_rename# (; old_parent_inode0, new_parent_inode0, old_child_inode0, new_child_inode0, old_dent0, new_dent0, err0, cache_dirs, afs_files; afs_asynced)⟩ ( (m8 ∈ cache_dirs0 ⊃ mkinode (m8, (m8 = m14 ⊃ mkdir(m0 + 1, md5, m4, m6, entries1[str0, entries[str]]);mkdir(m1, md0, # links(m8, cache_dirs0), m5, entries -- str)) .meta, true, (m8 = m14 ⊃ mkdir(m0 + 1, md5, m4, m6, entries1[str0, entries[str]]);mkdir(m1, md0, # links(m8, cache_dirs0), m5, entries -- str)) .nlink, (m8 = m14 ⊃ mkdir(m0 + 1, md5, m4, m6, entries1[str0, entries[str]]);mkdir(m1, md0, # links(m8, cache_dirs0), m5, entries -- str)) .nsubdirs, (m8 = m14 ⊃ mkdir(m0 + 1, md5, m4, m6, entries1[str0, entries[str]]);mkdir(m1, md0, # links(m8, cache_dirs0), m5, entries -- str)) .size) ;mkinode(m8, cache_files[m8].meta, false, cache_files[m8].nlink, 0, cache_files[m8].size) ) = old_parent_inode0 ∧ (m14 ∈ cache_dirs0 ⊃ mkinode (m14, md5, true, (m14 = m8 ⊃ mkdir(m0 + 1, md0, m4, m6, entries1[str0, entries[str]]);mkdir(m0 + 1, md6, m4, m6, entries1[str0, entries[str]])).nlink, (m14 = m8 ⊃ mkdir(m0 + 1, md0, m4, m6, entries1[str0, entries[str]]);mkdir(m0 + 1, md6, m4, m6, entries1[str0, entries[str]])).nsubdirs, (m14 = m8 ⊃ mkdir(m0 + 1, md0, m4, m6, entries1[str0, entries[str]]);mkdir(m0 + 1, md6, m4, m6, entries1[str0, entries[str]])).size) ;mkinode(m14, cache_files[m14].meta, false, cache_files[m14].nlink, 0, cache_files[m14].size) ) = new_parent_inode0 ∧ mkinode(entries[str], md1, false, # links(entries[str], cache_dirs0), 0, m10) = old_child_inode0 ∧ new_child_inode1 = new_child_inode0 ∧ negdentry(str) = old_dent0 ∧ mkdentry(str0, entries[str]) = new_dent0 ∧ ESUCCESS = err0 ∧ cache_dirs = cache_dirs0 [m8, (m8 = m14 ⊃ mkdir(m0 + 1, md6, m4, m6, entries1[str0, entries[str]]) ;mkdir(m1, md4, # links(m8, cache_dirs0), m5, entries -- str) ) .meta:= md0 ] [m14, (m14 = m8 ∧ m8 ∈ cache_dirs0 ⊃ mkdir(m0 + 1, md0, m4, m6, entries1[str0, entries[str]]) ;(m14 ∈ cache_dirs0 ⊃ mkdir(m0 + 1, md6, m4, m6, entries1[str0, entries[str]]);cache_dirs0[m14]) ) .meta:= md5 ] ∧ afs_files = (cache_files ⊕ cache_pcache) ⊕ cache_icache[m8, mkientry(false, mkinode(m8, md, true, m12, m13, m))] [m14, mkientry (false, (m14 ∈ cache_dirs0 ⊃ mkinode (m14, md5, true, (m14 = m8 ⊃ mkdir(m0 + 1, md0, m4, m6, entries1[str0, entries[str]]);mkdir(m0 + 1, md6, m4, m6, entries1[str0, entries[str]])).nlink, (m14 = m8 ⊃ mkdir(m0 + 1, md0, m4, m6, entries1[str0, entries[str]]);mkdir(m0 + 1, md6, m4, m6, entries1[str0, entries[str]])) .nsubdirs, (m14 = m8 ⊃ mkdir(m0 + 1, md0, m4, m6, entries1[str0, entries[str]]);mkdir(m0 + 1, md6, m4, m6, entries1[str0, entries[str]])).size) ;mkinode(m14, cache_files[m14].meta, false, cache_files[m14].nlink, 0, cache_files[m14].size) )) ] ∧ (afs_asynced ↔ asynced0))

Heuristic unfold applied rule call right

And obtained the following new goals

Proof step 143:
# links (entries[str], cache_dirs [m8, (m8 = m14 ⊃ mkdir(m0 + 1, md6, m4, m6, entries1[str0, entries[str]]);mkdir(m1, md4, # links(m8, cache_dirs), m5, entries -- str)).meta:= md0 ] [m14, (m14 = m8 ⊃ mkdir(m0 + 1, md0, m4, m6, entries1[str0, entries[str]]);mkdir(m0 + 1, md6, m4, m6, entries1[str0, entries[str]])).meta:= md5 ]) = # links(entries[str], cache_dirs), (m8 = m14 ⊃ mkdir(m0 + 1, md5, m4, m6, entries1[str0, entries[str]]);mkdir(m1, md0, # links(m8, cache_dirs), m5, entries -- str)) = mkdir(m, md, m12, m13, entries0), (m14 = m8 ⊃ mkdir(m1, md4, # links(m8, cache_dirs), m5, entries -- str);mkdir(m7, md7, # links(m14, cache_dirs), m11, entries2)) = mkdir(m0, md6, m4, m6, entries1), cache_files[entries[str]] = mkfile(m2, md3, # links(entries[str], cache_dirs), content0), cache_dirs[m14] = mkdir(m7, md7, # links(m14, cache_dirs), m11, entries2), ((cache_files ⊕ cache_pcache) ⊕ cache_icache)[entries[str]] = mkfile(m9, md2, # links(entries[str], cache_dirs), content), cache_dirs[m8] = mkdir(m1 + 1, md4, # links(m8, cache_dirs), m5, entries), afs_files = (cache_files ⊕ cache_pcache) ⊕ cache_icache, cache_dirs0 = cache_dirs, dirs = cache_dirs, err = err0, files = afs_files, new_child_inode = new_child_inode0, new_child_inode1 = new_child_inode0, new_dent = new_dent0, new_dent0 = negdentry(str0), new_parent_inode = new_parent_inode0, new_parent_inode0 = mkinode(m14, md5, true, # links(m14, cache_dirs), m11, m7), old_child_inode = old_child_inode0, old_child_inode0 = mkinode(entries[str], md1, false, # links(entries[str], cache_dirs), 0, m10), old_dent = old_dent0, old_dent0 = mkdentry(str, entries[str]), old_parent_inode = old_parent_inode0, old_parent_inode0 = mkinode(m8, md0, true, # links(m8, cache_dirs), m5, m1 + 1), afs-cons (cache_dirs [m8, (m8 = m14 ⊃ mkdir(m0 + 1, md6, m4, m6, entries1[str0, entries[str]]);mkdir(m1, md4, # links(m8, cache_dirs), m5, entries -- str)).meta:= md0 ] [m14, (m14 = m8 ⊃ mkdir(m0 + 1, md0, m4, m6, entries1[str0, entries[str]]);mkdir(m0 + 1, md6, m4, m6, entries1[str0, entries[str]])).meta:= md5 ], cache_files), afs-cons(cache_dirs, (cache_files ⊕ cache_pcache) ⊕ cache_icache), afs-cons(cache_dirs, cache_files), dcache-cons(cache_dcache, cache_dirs, cache_files), icache-cons(cache_icache, cache_dirs, cache_files), pcache-cons(cache_pcache, cache_dirs, cache_files), synced(cache_dirs, cache_icache, cache_pcache), m8 ∈ cache_dirs, m14 ∈ cache_dirs, entries[str] ∈ cache_files, str ∈ entries, m14 = m8 → md5 = md0, cache_sync → synced(cache_files, cache_icache, cache_pcache), links(m14, cache_dirs) ≠ ∅ ∨ m14 = ROOT_INO, links(m8, cache_dirs) ≠ ∅ ∨ m8 = 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, asynced1 = new_dent.dentry? in let asynced0 = old_ino = new_ino ∧ new_dent = old_dent in {dirs[old_ino].entries := dirs[old_ino].entries -- old_dent.name; if ¬ asynced0 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 asynced1 ∧ ¬ asynced0 then let ino = new_dent.ino in afs_drop_nlink#(ino; dirs, files); if ¬ asynced1 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 asynced1 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⟩ ( (m8 ∈ cache_dirs0 ⊃ mkinode (m8, (m8 = m14 ⊃ mkdir(m0 + 1, md5, m4, m6, entries1[str0, entries[str]]);mkdir(m1, md0, # links(m8, cache_dirs0), m5, entries -- str)) .meta, true, (m8 = m14 ⊃ mkdir(m0 + 1, md5, m4, m6, entries1[str0, entries[str]]);mkdir(m1, md0, # links(m8, cache_dirs0), m5, entries -- str)) .nlink, (m8 = m14 ⊃ mkdir(m0 + 1, md5, m4, m6, entries1[str0, entries[str]]);mkdir(m1, md0, # links(m8, cache_dirs0), m5, entries -- str)) .nsubdirs, (m8 = m14 ⊃ mkdir(m0 + 1, md5, m4, m6, entries1[str0, entries[str]]);mkdir(m1, md0, # links(m8, cache_dirs0), m5, entries -- str)) .size) ;mkinode(m8, cache_files[m8].meta, false, cache_files[m8].nlink, 0, cache_files[m8].size) ) = old_parent_inode ∧ (m14 ∈ cache_dirs0 ⊃ mkinode (m14, md5, true, (m14 = m8 ⊃ mkdir(m0 + 1, md0, m4, m6, entries1[str0, entries[str]]);mkdir(m0 + 1, md6, m4, m6, entries1[str0, entries[str]])).nlink, (m14 = m8 ⊃ mkdir(m0 + 1, md0, m4, m6, entries1[str0, entries[str]]);mkdir(m0 + 1, md6, m4, m6, entries1[str0, entries[str]])).nsubdirs, (m14 = m8 ⊃ mkdir(m0 + 1, md0, m4, m6, entries1[str0, entries[str]]);mkdir(m0 + 1, md6, m4, m6, entries1[str0, entries[str]])).size) ;mkinode(m14, cache_files[m14].meta, false, cache_files[m14].nlink, 0, cache_files[m14].size) ) = new_parent_inode ∧ mkinode(entries[str], md1, false, # links(entries[str], cache_dirs0), 0, m10) = old_child_inode ∧ new_child_inode1 = new_child_inode ∧ negdentry(str) = old_dent ∧ mkdentry(str0, entries[str]) = new_dent ∧ ESUCCESS = err ∧ dirs = cache_dirs0 [m8, (m8 = m14 ⊃ mkdir(m0 + 1, md6, m4, m6, entries1[str0, entries[str]]) ;mkdir(m1, md4, # links(m8, cache_dirs0), m5, entries -- str) ) .meta:= md0 ] [m14, (m14 = m8 ∧ m8 ∈ cache_dirs0 ⊃ mkdir(m0 + 1, md0, m4, m6, entries1[str0, entries[str]]) ;(m14 ∈ cache_dirs0 ⊃ mkdir(m0 + 1, md6, m4, m6, entries1[str0, entries[str]]);cache_dirs0[m14]) ) .meta:= md5 ] ∧ files = (cache_files ⊕ cache_pcache) ⊕ cache_icache[m8, mkientry(false, mkinode(m8, md, true, m12, m13, m))] [m14, mkientry (false, (m14 ∈ cache_dirs0 ⊃ mkinode (m14, md5, true, (m14 = m8 ⊃ mkdir(m0 + 1, md0, m4, m6, entries1[str0, entries[str]]);mkdir(m0 + 1, md6, m4, m6, entries1[str0, entries[str]])).nlink, (m14 = m8 ⊃ mkdir(m0 + 1, md0, m4, m6, entries1[str0, entries[str]]);mkdir(m0 + 1, md6, m4, m6, entries1[str0, entries[str]])) .nsubdirs, (m14 = m8 ⊃ mkdir(m0 + 1, md0, m4, m6, entries1[str0, entries[str]]);mkdir(m0 + 1, md6, m4, m6, entries1[str0, entries[str]])).size) ;mkinode(m14, cache_files[m14].meta, false, cache_files[m14].nlink, 0, cache_files[m14].size) )) ] ∧ (asynced ↔ asynced0)), entries[str] ∈ cache_dirs, str0 ∈ entries2

Rule argument

pos: right 1

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 };