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

(m = m3 ⊃ mkdir(m1, md4, # links(m3, cache_dirs), m5, entries -- str);mkdir(m7, md7, # links(m, 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[m] = mkdir(m7, md7, # links(m, cache_dirs), m11, entries2), ((cache_files ⊕ cache_pcache) ⊕ cache_icache)[entries[str]] = mkfile(m9, md2, # links(entries[str], cache_dirs), content), cache_dirs[m3] = mkdir(m1 + 1, md4, # links(m3, cache_dirs), m5, entries), afs_files = (cache_files ⊕ cache_pcache) ⊕ cache_icache, dirs = cache_dirs[m, mkdir(m0 + 1, md6, m4, m6, entries1[str0, entries[str]])] [m3, (m3 = m ⊃ mkdir(m0 + 1, md6, m4, m6, entries1[str0, entries[str]]);mkdir(m1, md4, # links(m3, cache_dirs), m5, entries -- str)).meta:= md0 ], files = cache_files, ino = inode.ino, inode = mkinode(m, md, true, # links(m, cache_dirs), m11, m7), 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), ino ∈ files, m3 ∈ cache_dirs, m ∈ cache_dirs, entries[str] ∈ cache_files, str ∈ entries, m = m3 → md = md0, cache_sync → synced(cache_files, cache_icache, cache_pcache), links(m, cache_dirs) ≠ ∅ ∨ m = ROOT_INO, links(m3, cache_dirs) ≠ ∅ ∨ m3 = ROOT_INO ⊦ [old_parent_inode := (m3 ∈ dirs ⊃ mkinode(m3, dirs[m3].meta, true, dirs[m3].nlink, dirs[m3].nsubdirs, dirs[m3].size) ;mkinode (m3, files[ino, files[ino].size:= inode.size][ino, files[ino, files[ino].size:= inode.size][ino].meta:= inode.meta][m3].meta, false, files[ino, files[ino].size:= inode.size][ino, files[ino, files[ino].size:= inode.size][ino].meta:= inode.meta][m3].nlink, 0, files[ino, files[ino].size:= inode.size][ino, files[ino, files[ino].size:= inode.size][ino].meta:= inode.meta][m3].size) ); new_parent_inode := (m ∈ dirs ⊃ mkinode(m, dirs[m].meta, true, dirs[m].nlink, dirs[m].nsubdirs, dirs[m].size) ;mkinode (m, files[ino, files[ino].size:= inode.size][ino, files[ino, files[ino].size:= inode.size][ino].meta:= inode.meta][m].meta, false, files[ino, files[ino].size:= inode.size][ino, files[ino, files[ino].size:= inode.size][ino].meta:= inode.meta][m].nlink, 0, files[ino, files[ino].size:= inode.size][ino, files[ino, files[ino].size:= inode.size][ino].meta:= inode.meta][m].size) ); err := ESUCCESS; asynced := ?] ( afs-cons(dirs, files[ino, files[ino].size:= inode.size][ino, files[ino, files[ino].size:= inode.size][ino].meta:= inode.meta]) → ⟪new_dent := mkdentry(str0, mkdentry(str, entries[str]).ino); old_dent1 := negdentry(mkdentry(str, entries[str]).name); 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); skip; 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)}⟫ ⟨old_dent0 := mkdentry(str, entries[str]); new_dent0 := negdentry(str0); new_parent_inode0 := mkinode(m, md, true, # links(m, cache_dirs), m11, m7); old_parent_inode0 := mkinode(m3, md0, true, # links(m3, cache_dirs), m5, m1 + 1); old_child_inode0 := mkinode(entries[str], md1, false, # links(entries[str], cache_dirs), 0, m10); cache_dirs0 := cache_dirs; new_child_inode1 := new_child_inode0; 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[str], md1, false, # links(entries[str], cache_dirs0), 0, m10) = old_child_inode0 ∧ new_child_inode1 = new_child_inode0 ∧ old_dent1 = old_dent0 ∧ new_dent = new_dent0 ∧ err = err0 ∧ cache_dirs = dirs ∧ afs_files = (files[ino, files[ino].size:= inode.size][ino, files[ino, files[ino].size:= inode.size][ino].meta:= inode.meta] ⊕ cache_pcache) ⊕ cache_icache ∧ (afs_asynced ↔ asynced))), str0 ∈ entries2, entries[str] ∈ cache_dirs

Heuristic symbolic execution applied rule assign right

And obtained the following new goals

Rule argument

Additional information