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

# links(entries1[str], cache_dirs) = m14 + 1, (m = m3 ⊃ mkdir(m1, md6, # links(m3, cache_dirs), m6, entries -- str0);mkdir(m0, md9, # links(m, cache_dirs), m7, entries1)) = mkdir(m5, md8, m9, m11, entries2), cache_files[entries[str0]] = mkfile(m4, md5, # links(entries[str0], cache_dirs), content2), cache_dirs[m] = mkdir(m0, md9, # links(m, cache_dirs), m7, entries1), ((cache_files ⊕ cache_pcache) ⊕ cache_icache)[entries[str0]] = mkfile(m8, md4, # links(entries[str0], cache_dirs), content0), ((cache_files ⊕ cache_pcache) ⊕ cache_icache)[entries1[str]] = mkfile(m12, md3, m14 + 1, content), cache_dirs[m3] = mkdir(m1 + 1, md6, # links(m3, cache_dirs), m6, entries), cache_files[entries1[str]] = mkfile(m2, md7, m14 + 1, content1), dirs = cache_dirs[m3, mkdir(m1, md6, # links(m3, cache_dirs), m6, entries -- str0)][m, mkdir(m5, md8, m9, m11, entries2[str, entries[str0]])], files = cache_files[entries1[str], mkfile(m2, md7, m14, content1)], ino = inode.ino, inode = mkinode(m3, md0, true, # links(m3, cache_dirs), m6, m1 + 1), afs-cons(cache_dirs, cache_files), afs-cons(cache_dirs, (cache_files ⊕ cache_pcache) ⊕ cache_icache), 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), str0 ∈ entries, m ∈ cache_dirs, m3 ∈ cache_dirs, entries1[str] ∈ cache_files, entries[str0] ∈ cache_files, str ∈ entries1, ino ∈ files, cache_sync → synced(cache_files, cache_icache, cache_pcache), m = m3 → md = md0, links(m, cache_dirs) ≠ ∅ ∨ m = ROOT_INO, links(m3, cache_dirs) ≠ ∅ ∨ m3 = ROOT_INO ⊦ [files := files[ino, files[ino].size:= inode.size][ino, files[ino, files[ino].size:= inode.size][ino].meta:= inode.meta]; afs_inode_sync#(mkinode(m, md, true, # links(m, cache_dirs), m7, m0); dirs, files); new_child_inode := mkinode(entries1[str], md1, false, # links(entries1[str], cache_dirs), 0, m10); cache_files0 := files; if true then {afs_inode_sync#(new_child_inode; dirs, cache_files0); new_child_inode := (new_child_inode.ino ∈ dirs ⊃ mkinode (new_child_inode.ino, dirs[new_child_inode.ino].meta, true, dirs[new_child_inode.ino].nlink, dirs[new_child_inode.ino].nsubdirs, dirs[new_child_inode.ino].size) ;mkinode (new_child_inode.ino, cache_files0[new_child_inode.ino].meta, false, cache_files0[new_child_inode.ino].nlink, 0, cache_files0[new_child_inode.ino].size) )}; old_parent_inode := (m3 ∈ dirs ⊃ mkinode(m3, dirs[m3].meta, true, dirs[m3].nlink, dirs[m3].nsubdirs, dirs[m3].size) ;mkinode(m3, cache_files0[m3].meta, false, cache_files0[m3].nlink, 0, cache_files0[m3].size) ); new_parent_inode := (m ∈ dirs ⊃ mkinode(m, dirs[m].meta, true, dirs[m].nlink, dirs[m].nsubdirs, dirs[m].size) ;mkinode(m, cache_files0[m].meta, false, cache_files0[m].nlink, 0, cache_files0[m].size) ); err := ESUCCESS; asynced := ?; entries0 := entries1; new_dent := mkdentry(mkdentry(str, entries1[str]).name, mkdentry(str0, entries[str0]).ino); old_dent1 := negdentry(mkdentry(str0, entries[str0]).name); afs_files := (cache_files ⊕ cache_pcache) ⊕ cache_icache; if err = ESUCCESS then let asynced = false in {icache_set#(old_parent_inode, asynced; err, cache_icache); icache_set#(new_parent_inode, asynced; err, cache_icache); if mkdentry(str, entries0[str]).dentry? then icache_set#(new_child_inode, asynced; err, cache_icache); dcache_delete#(old_parent_inode.ino, old_dent1.name; err, cache_dcache); dcache_set#(new_parent_inode.ino, new_dent.name, new_dent; err, cache_dcache)}] ( icache-cons(cache_icache, dirs, cache_files0) ∧ dcache-cons(cache_dcache, dirs, cache_files0) ∧ pcache-cons(cache_pcache, dirs, cache_files0) ∧ afs-cons(dirs, cache_files0) ∧ synced(dirs, cache_icache, cache_pcache) ∧ (cache_sync → synced(cache_files0, cache_icache, cache_pcache)) → ⟨new_dent0 := mkdentry(str, entries0[str]); old_dent0 := mkdentry(str0, entries[str0]); new_parent_inode0 := mkinode(m, md, true, # links(m, cache_dirs), m7, m0); old_parent_inode0 := mkinode(m3, md0, true, # links(m3, cache_dirs), m6, m1 + 1); new_child_inode0 := mkinode(entries0[str], md1, false, # links(entries0[str], cache_dirs), 0, m10); old_child_inode0 := mkinode(entries[str0], md2, false, # links(entries[str0], cache_dirs), 0, m13); cache_dirs0 := cache_dirs; 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)⟩ ( old_parent_inode = old_parent_inode0 ∧ new_parent_inode = new_parent_inode0 ∧ mkinode(entries[str0], md2, false, # links(entries[str0], cache_dirs0), 0, m13) = old_child_inode0 ∧ new_child_inode = new_child_inode0 ∧ old_dent1 = old_dent0 ∧ new_dent = new_dent0 ∧ err = err0 ∧ cache_dirs = dirs ∧ afs_files = (cache_files0 ⊕ cache_pcache) ⊕ cache_icache ∧ (afs_asynced ↔ asynced))), entries[str0] ∈ cache_dirs, entries1[str] ∈ cache_dirs, m3 = m ∧ mkdentry(str, entries1[str]) = mkdentry(str0, entries[str0])

Heuristic symbolic execution applied rule assign right

And obtained the following new goals

Rule argument

Additional information