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

(entries[str0] = m0 ⊃ mkdir(m1, md0, # links(entries[str0], cache_dirs), m4, entries) ;mkdir(m1, md2, # links(entries[str0], cache_dirs), m4, ∅) ) = mkdir(m7, md1, m8, m9, entries1), (m0 = entries[str0] ⊃ mkdir(m1, md5, # links(entries[str0], cache_dirs), m4, entries);mkdir(m, md0, # links(m0, cache_dirs), m5, entries)) = mkdir(m3, md4, m6, m10, entries2), cache_dirs[entries[str0]] = mkdir(m1, md2, # links(entries[str0], cache_dirs), m4, ∅), cache_dirs[m0] = mkdir(m, md, # links(m0, cache_dirs), m5, entries), afs_files = (cache_files ⊕ cache_pcache) ⊕ cache_icache, dirs = cache_dirs[m0, mkdir(m, md0, # links(m0, cache_dirs), m5, entries)], files = afs_files, ino = inode.ino, inode = mkinode(entries[str0], md5, true, # links(entries[str0], cache_dirs), m4, m1), afs-cons(cache_dirs, (cache_files ⊕ cache_pcache) ⊕ cache_icache), afs-cons(cache_dirs, cache_files), afs-cons(cache_dirs[m0, mkdir(m, md0, # links(m0, cache_dirs), m5, entries)][entries[str0], mkdir(m7, md5, m8, m9, entries1)], cache_files), dcache-cons(cache_dcache, cache_dirs, cache_files), dcache-cons (cache_dcache[dentrykey(m0, str0), mkdentry(str0, entries[str0])], cache_dirs[m0, mkdir(m, md0, # links(m0, cache_dirs), m5, entries)][entries[str0], mkdir(m7, md5, m8, m9, entries1)], cache_files), icache-cons(cache_icache, cache_dirs, cache_files), icache-cons (cache_icache[m0, mkientry(false, mkinode(m0, md4, true, m6, m10, m3))][entries[str0], mkientry(false, mkinode(entries[str0], md5, true, m8, m9, m7))], cache_dirs[m0, mkdir(m, md0, # links(m0, cache_dirs), m5, entries)][entries[str0], mkdir(m7, md5, m8, m9, entries1)], cache_files), pcache-cons(cache_pcache, cache_dirs, cache_files), pcache-cons (cache_pcache, cache_dirs[m0, mkdir(m, md0, # links(m0, cache_dirs), m5, entries)][entries[str0], mkdir(m7, md5, m8, m9, entries1)], cache_files), synced(cache_dirs, cache_icache, cache_pcache), synced (cache_dirs[m0, mkdir(m, md0, # links(m0, cache_dirs), m5, entries)][entries[str0], mkdir(m7, md5, m8, m9, entries1)], cache_icache[m0, mkientry(false, mkinode(m0, md4, true, m6, m10, m3))][entries[str0], mkientry(false, mkinode(entries[str0], md5, true, m8, m9, m7))], cache_pcache), ino ∈ files, m0 ∈ cache_dirs, entries[str0] ∈ cache_dirs, str0 ∈ entries, cache_sync → synced(cache_files, cache_icache, cache_pcache), cache_sync → synced (cache_files, cache_icache[m0, mkientry(false, mkinode(m0, md4, true, m6, m10, m3))] [entries[str0], mkientry(false, mkinode(entries[str0], md5, true, m8, m9, m7)) ], cache_pcache), links(m0, cache_dirs) ≠ ∅ ∨ m0 = ROOT_INO ⊦ ⟨files[ino].size := inode.size; files[ino].meta := inode.meta; new_child_inode := (entries[str0] ∈ dirs ⊃ mkinode(entries[str0], dirs[entries[str0]].meta, true, dirs[entries[str0]].nlink, dirs[entries[str0]].nsubdirs, dirs[entries[str0]].size) ;mkinode(entries[str0], files[entries[str0]].meta, false, files[entries[str0]].nlink, 0, files[entries[str0]].size) ); old_parent_inode := (m0 ∈ dirs ⊃ mkinode(m0, dirs[m0].meta, true, dirs[m0].nlink, dirs[m0].nsubdirs, dirs[m0].size) ;mkinode(m0, files[m0].meta, false, files[m0].nlink, 0, files[m0].size) ); new_parent_inode := (m0 ∈ dirs ⊃ mkinode(m0, dirs[m0].meta, true, dirs[m0].nlink, dirs[m0].nsubdirs, dirs[m0].size) ;mkinode(m0, files[m0].meta, false, files[m0].nlink, 0, files[m0].size) ); err := ESUCCESS; asynced := ?⟩ ( mkinode(m0, md4, true, m6, m10, m3) = old_parent_inode ∧ mkinode(m0, md4, true, m6, m10, m3) = new_parent_inode ∧ mkinode(entries[str0], md5, true, m8, m9, m7) = new_child_inode ∧ ESUCCESS = err ∧ dirs = cache_dirs[m0, mkdir(m, md0, # links(m0, cache_dirs), m5, entries)] [entries[str0], (entries[str0] = m0 ⊃ mkdir(m1, md0, # links(entries[str0], cache_dirs), m4, entries);cache_dirs[entries[str0]]).meta:= md5 ] ∧ files = (cache_files ⊕ cache_pcache) ⊕ cache_icache[m0, mkientry(false, mkinode(m0, md4, true, m6, m10, m3))] [entries[str0], mkientry(false, mkinode(entries[str0], md5, true, m8, m9, m7)) ] ∧ (asynced ↔ asynced2)), entries[str0] = ROOT_INO

Heuristic symbolic execution applied rule assign right

And obtained the following new goals

Rule argument

Additional information