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

cache_dirs[m2] = mkdir(m6, md3, # links(m2, cache_dirs), m5, entries), cache_files[entries[str0]] = mkfile(m1, md, # links(entries[str0], cache_dirs), content), ((cache_files ⊕ cache_pcache) ⊕ cache_icache)[entries[str0]] = mkfile(m8, md4, # links(entries[str0], cache_dirs), content0), 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_inode0 = mkinode(entries[str0], md0, false, # links(entries[str0], cache_dirs), 0, m), new_dent = new_dent0, new_dent0 = mkdentry(str0, entries[str0]), new_parent_inode = new_parent_inode0, new_parent_inode0 = mkinode(m2, md5, true, # links(m2, cache_dirs), m5, m6), old_child_inode = old_child_inode0, old_child_inode0 = mkinode(entries[str0], md2, false, # links(entries[str0], cache_dirs), 0, m13), old_dent = old_dent0, old_dent0 = mkdentry(str0, entries[str0]), old_parent_inode = old_parent_inode0, old_parent_inode0 = mkinode(m2, md5, true, # links(m2, cache_dirs), m5, m6), afs-cons(cache_dirs, (cache_files ⊕ cache_pcache) ⊕ cache_icache), afs-cons(cache_dirs, cache_files), afs-cons (cache_dirs[m2, mkdir(m6, md5, # links(m2, cache_dirs), m5, entries)], cache_files[entries[str0], mkfile(m, md0, # links(entries[str0], cache_dirs), content)]), dcache-cons (cache_dcache[dentrykey(m2, str0), mkdentry(str0, entries[str0])], cache_dirs[m2, mkdir(m6, md5, # links(m2, cache_dirs), m5, entries)], cache_files[entries[str0], mkfile(m, md0, # links(entries[str0], cache_dirs), content)]), dcache-cons(cache_dcache, cache_dirs, cache_files), icache-cons (cache_icache[m2, mkientry(false, mkinode(m2, md5, true, # links(m2, cache_dirs), m5, m6))] [entries[str0], mkientry(false, mkinode(entries[str0], md0, false, # links(entries[str0], cache_dirs), 0, m)) ], cache_dirs[m2, mkdir(m6, md5, # links(m2, cache_dirs), m5, entries)], cache_files[entries[str0], mkfile(m, md0, # links(entries[str0], cache_dirs), content)]), icache-cons(cache_icache, cache_dirs, cache_files), pcache-cons (cache_pcache, cache_dirs[m2, mkdir(m6, md5, # links(m2, cache_dirs), m5, entries)], cache_files[entries[str0], mkfile(m, md0, # links(entries[str0], cache_dirs), content)]), pcache-cons(cache_pcache, cache_dirs, cache_files), synced (cache_dirs[m2, mkdir(m6, md5, # links(m2, cache_dirs), m5, entries)], cache_icache[m2, mkientry(false, mkinode(m2, md5, true, # links(m2, cache_dirs), m5, m6))] [entries[str0], mkientry(false, mkinode(entries[str0], md0, false, # links(entries[str0], cache_dirs), 0, m)) ], cache_pcache), synced(cache_dirs, cache_icache, cache_pcache), m2 ∈ cache_dirs, entries[str0] ∈ cache_files, str0 ∈ entries, cache_sync → synced(cache_files, cache_icache, cache_pcache), cache_sync → synced (cache_files[entries[str0], mkfile(m, md0, # links(entries[str0], cache_dirs), content)], cache_icache[m2, mkientry(false, mkinode(m2, md5, true, # links(m2, cache_dirs), m5, m6))] [entries[str0], mkientry(false, mkinode(entries[str0], md0, false, # links(entries[str0], cache_dirs), 0, m)) ], cache_pcache), links(m2, cache_dirs) ≠ ∅ ∨ m2 = ROOT_INO ⊦ ⟨abort⟩ ( (m2 ∈ cache_dirs0 ⊃ mkinode(m2, md5, true, # links(m2, cache_dirs0), m5, m6) ;mkinode (m2, (m2 = entries[str0] ⊃ (cache_files[entries[str0]].size:= m).meta:= md0;cache_files[m2]).meta, false, (m2 = entries[str0] ⊃ (cache_files[entries[str0]].size:= m).meta:= md0;cache_files[m2]).nlink, 0, (m2 = entries[str0] ⊃ (cache_files[entries[str0]].size:= m).meta:= md0;cache_files[m2]).size) ) = old_parent_inode ∧ (m2 ∈ cache_dirs0 ⊃ mkinode(m2, md5, true, # links(m2, cache_dirs0), m5, m6) ;mkinode (m2, (m2 = entries[str0] ⊃ (cache_files[entries[str0]].size:= m).meta:= md0;cache_files[m2]).meta, false, (m2 = entries[str0] ⊃ (cache_files[entries[str0]].size:= m).meta:= md0;cache_files[m2]).nlink, 0, (m2 = entries[str0] ⊃ (cache_files[entries[str0]].size:= m).meta:= md0;cache_files[m2]).size) ) = new_parent_inode ∧ mkinode(entries[str0], md2, false, # links(entries[str0], cache_dirs0), 0, m13) = old_child_inode ∧ (entries[str0] ∈ cache_dirs0 ⊃ mkinode (entries[str0], (entries[str0] = m2 ⊃ mkdir(m6, md5, # links(entries[str0], cache_dirs0), m5, entries);cache_dirs0[entries[str0]]).meta, true, (entries[str0] = m2 ⊃ mkdir(m6, md5, # links(entries[str0], cache_dirs0), m5, entries);cache_dirs0[entries[str0]]).nlink, (entries[str0] = m2 ⊃ mkdir(m6, md5, # links(entries[str0], cache_dirs0), m5, entries);cache_dirs0[entries[str0]]).nsubdirs, (entries[str0] = m2 ⊃ mkdir(m6, md5, # links(entries[str0], cache_dirs0), m5, entries);cache_dirs0[entries[str0]]).size) ;mkinode(entries[str0], md0, false, cache_files[entries[str0]].nlink, 0, m) ) = new_child_inode ∧ negdentry(str0) = old_dent ∧ mkdentry(str0, entries[str0]) = new_dent ∧ ESUCCESS = err ∧ dirs = cache_dirs0[m2, mkdir(m6, md5, # links(m2, cache_dirs0), m5, entries)] ∧ files = (cache_files[entries[str0], (cache_files[entries[str0]].size:= m).meta:= md0] ⊕ cache_pcache) ⊕ cache_icache[m2, mkientry(false, mkinode(m2, md5, true, # links(m2, cache_dirs0), m5, m6))] [entries[str0], mkientry(false, mkinode(entries[str0], md0, false, # links(entries[str0], cache_dirs0), 0, m)) ] ∧ (asynced ↔ asynced0)), pre-rename(old_parent_inode, old_dent, old_child_inode, new_parent_inode, new_dent, new_child_inode, dirs, files), entries[str0] ∈ cache_dirs

Heuristic symbolic execution applied rule abort right

And obtained the following new goals

Rule argument

Additional information