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

cache_dirs[m] = mkdir(m1, md3, # links(m, cache_dirs), m4, entries0), cache_dirs[entries0[str0]] = mkdir(m3, md4, # links(entries0[str0], cache_dirs), m6, ∅), afs_files = (cache_files ⊕ cache_pcache) ⊕ cache_icache, dirs = cache_dirs[m, mkdir(m1, md0, # links(m, cache_dirs), m4, entries0)], err = ESUCCESS, files = cache_files, ino = inode.ino, inode = mkinode(entries0[str0], md1, true, # links(entries0[str0], cache_dirs), m6, m3), new_child_inode = (entries0[str0] ∈ dirs ⊃ mkinode(entries0[str0], dirs[entries0[str0]].meta, true, dirs[entries0[str0]].nlink, dirs[entries0[str0]].nsubdirs, dirs[entries0[str0]].size) ;mkinode (entries0[str0], files[ino, files[ino].size:= inode.size][ino, files[ino, files[ino].size:= inode.size][ino].meta:= inode.meta][entries0[str0]].meta, false, files[ino, files[ino].size:= inode.size][ino, files[ino, files[ino].size:= inode.size][ino].meta:= inode.meta][entries0[str0]].nlink, 0, files[ino, files[ino].size:= inode.size][ino, files[ino, files[ino].size:= inode.size][ino].meta:= inode.meta][entries0[str0]].size) ), new_dent = mkdentry(mkdentry(str0, entries0[str0]).name, mkdentry(str0, entries0[str0]).ino), 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) ), old_dent1 = negdentry(mkdentry(str0, entries0[str0]).name), old_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) ), mkdentry(str0, entries0[str0]).dentry?, 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), entries0[str0] ∈ cache_dirs, m ∈ cache_dirs, ino ∈ files, str0 ∈ entries0, cache_sync → synced(cache_files, cache_icache, cache_pcache), (entries0[str0] ∈ dirs ⊃ str0 ∈ entries0 ∧ str0 ∈ entries0 ∧ str0 ∈ entries0 ∧ str0 ∈ entries0 ∧ str0 ∈ entries0 ;str0 ∈ entries0 ∧ str0 ∈ entries0 ∧ str0 ∈ entries0 ∧ str0 ∈ entries0 ), links(m, cache_dirs) ≠ ∅ ∨ m = ROOT_INO ⊦ [str := str0; 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, files[ino, files[ino].size:= inode.size][ino, files[ino, files[ino].size:= inode.size][ino].meta:= inode.meta]) ∧ dcache-cons (cache_dcache, dirs, files[ino, files[ino].size:= inode.size][ino, files[ino, files[ino].size:= inode.size][ino].meta:= inode.meta]) ∧ pcache-cons (cache_pcache, dirs, files[ino, files[ino].size:= inode.size][ino, files[ino, files[ino].size:= inode.size][ino].meta:= inode.meta]) ∧ afs-cons(dirs, files[ino, files[ino].size:= inode.size][ino, files[ino, files[ino].size:= inode.size][ino].meta:= inode.meta]) ∧ synced(dirs, cache_icache, cache_pcache) ∧ ( cache_sync → synced (files[ino, files[ino].size:= inode.size][ino, files[ino, files[ino].size:= inode.size][ino].meta:= inode.meta], cache_icache, cache_pcache)) → ⟨new_dent0 := mkdentry(str, entries0[str]); old_dent0 := mkdentry(str0, entries0[str0]); new_parent_inode0 := mkinode(m, md0, true, # links(m, cache_dirs), m4, m1); old_parent_inode0 := mkinode(m, md0, true, # links(m, cache_dirs), m4, m1); new_child_inode0 := mkinode (entries0[str], md1, true, # links(entries0[str], cache_dirs), cache_dirs[entries0[str]].nsubdirs, cache_dirs[entries0[str]].size); old_child_inode0 := mkinode(entries0[str0], md2, true, # links(entries0[str0], cache_dirs), m6, m3); cache_dirs0 := cache_dirs; cache_dirs1 := cache_dirs; cache_dirs2 := 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 (entries0[str0], md2, true, # links(entries0[str0], cache_dirs0), cache_dirs1[entries0[str0]].nsubdirs, cache_dirs2[entries0[str0]].size) = old_child_inode0 ∧ new_child_inode = 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))), entries0[str0] = ROOT_INO

Heuristic symbolic execution applied rule assign right

And obtained the following new goals

Rule argument

Additional information