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

# links(m14, cache_dirs) = cache_dirs[m14].nlink, # links(m8, cache_dirs) = cache_dirs[m8].nlink, # links (entries[str], cache_dirs [m8, (m8 = m14 ⊃ mkdir(m0 + 1, md6, m4, m6, entries1[str0, entries[str]]) ;mkdir(m1, md4, cache_dirs[m8].nlink, cache_dirs[m8].nsubdirs, entries -- str) ) .meta:= md0 ] [m14, (m14 = m8 ⊃ mkdir(m0 + 1, md0, m4, m6, entries1[str0, entries[str]]);mkdir(m0 + 1, md6, m4, m6, entries1[str0, entries[str]])).meta:= md5 ]) = # links(entries[str], cache_dirs), m1 + 1 = cache_dirs[m8].size, (m8 = m14 ⊃ mkdir(m0 + 1, md5, m4, m6, entries1[str0, entries[str]]);mkdir(m1, md0, cache_dirs[m8].nlink, cache_dirs[m8].nsubdirs, entries -- str)) = mkdir(m, md, m12, m13, entries0), (m14 = m8 ⊃ mkdir(m1, md4, cache_dirs[m8].nlink, cache_dirs[m8].nsubdirs, entries -- str);cache_dirs[m14]) = mkdir(m0, md6, m4, m6, entries1), asynced0 ↔ false, asynced1 ↔ false, entries[str] = cache_dirs[m8].entries[str], cache_files[entries[str]] = mkfile(m2, md3, # links(entries[str], cache_dirs), content0), cache_dirs[m14] = mkdir(cache_dirs[m14].size, md7, cache_dirs[m14].nlink, cache_dirs[m14].nsubdirs, entries2), ((cache_files ⊕ cache_pcache) ⊕ cache_icache)[entries[str]] = mkfile(m9, md2, # links(entries[str], cache_dirs), content), cache_dirs[m8] = mkdir(m1 + 1, md4, cache_dirs[m8].nlink, cache_dirs[m8].nsubdirs, entries), new_ino = m14, old_ino = m8, afs-cons (cache_dirs [m8, (m8 = m14 ⊃ mkdir(m0 + 1, md6, m4, m6, entries1[str0, entries[str]]) ;mkdir(m1, md4, cache_dirs[m8].nlink, cache_dirs[m8].nsubdirs, entries -- str) ) .meta:= md0 ] [m14, (m14 = m8 ⊃ mkdir(m0 + 1, md0, m4, m6, entries1[str0, entries[str]]);mkdir(m0 + 1, md6, m4, m6, entries1[str0, entries[str]])).meta:= md5 ], cache_files), 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), str ∈ cache_dirs[m8].entries, m8 ∈ cache_dirs, m14 ∈ cache_dirs, entries[str] ∈ cache_files, str ∈ entries, m14 = m8 → md5 = md0, cache_sync → synced(cache_files, cache_icache, cache_pcache), links(m14, cache_dirs) ≠ ∅ ∨ m14 = ROOT_INO, links(m8, cache_dirs) ≠ ∅ ∨ m8 = ROOT_INO ⊦ ⟨dirs := cache_dirs[old_ino, cache_dirs[old_ino].entries:= (cache_dirs[old_ino].entries -- mkdentry(str, entries[str]).name)]; old_dent := mkdentry(str, entries[str]); if ¬ asynced0 then {dirs[old_ino].size := dirs[old_ino].size - 1; if old_dent.ino ∈ dirs then dirs[old_ino].nsubdirs := dirs[old_ino].nsubdirs - 1}; dirs[new_ino].entries[str0] := old_dent.ino; new_dent := negdentry(str0); afs_files := (cache_files ⊕ cache_pcache) ⊕ cache_icache; if asynced1 ∧ ¬ asynced0 then let ino = new_dent.ino in afs_drop_nlink#(ino; dirs, afs_files); if ¬ asynced1 then {dirs[new_ino].size := dirs[new_ino].size + 1; if old_dent.ino ∈ dirs then dirs[new_ino].nsubdirs := dirs[new_ino].nsubdirs + 1}; new_dent := mkdentry(new_dent.name, old_dent.ino); old_dent := negdentry(old_dent.name); afs_inode_sync#(mkinode(m8, md0, true, # links(m8, cache_dirs), cache_dirs[m8].nsubdirs, m1 + 1); dirs, afs_files); afs_inode_sync#(mkinode(m14, md5, true, # links(m14, cache_dirs), cache_dirs[m14].nsubdirs, cache_dirs[m14].size); dirs, afs_files); new_child_inode := new_child_inode0; if asynced1 then {afs_inode_sync#(new_child_inode; dirs, afs_files); 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, afs_files[new_child_inode.ino].meta, false, afs_files[new_child_inode.ino].nlink, 0, afs_files[new_child_inode.ino].size) )}; old_parent_inode := (m8 ∈ dirs ⊃ mkinode(m8, dirs[m8].meta, true, dirs[m8].nlink, dirs[m8].nsubdirs, dirs[m8].size) ;mkinode(m8, afs_files[m8].meta, false, afs_files[m8].nlink, 0, afs_files[m8].size) ); new_parent_inode := (m14 ∈ dirs ⊃ mkinode(m14, dirs[m14].meta, true, dirs[m14].nlink, dirs[m14].nsubdirs, dirs[m14].size) ;mkinode(m14, afs_files[m14].meta, false, afs_files[m14].nlink, 0, afs_files[m14].size) ); err := ESUCCESS; asynced := ?⟩ ( mkinode (m8, (m8 = m14 ⊃ mkdir(m0 + 1, md5, m4, m6, entries1[str0, entries[str]]) ;mkdir(m1, md0, # links(m8, cache_dirs), cache_dirs[m8].nsubdirs, entries -- str) ) .meta, true, (m8 = m14 ⊃ mkdir(m0 + 1, md5, m4, m6, entries1[str0, entries[str]]) ;mkdir(m1, md0, # links(m8, cache_dirs), cache_dirs[m8].nsubdirs, entries -- str) ) .nlink, (m8 = m14 ⊃ mkdir(m0 + 1, md5, m4, m6, entries1[str0, entries[str]]) ;mkdir(m1, md0, # links(m8, cache_dirs), cache_dirs[m8].nsubdirs, entries -- str) ) .nsubdirs, (m8 = m14 ⊃ mkdir(m0 + 1, md5, m4, m6, entries1[str0, entries[str]]) ;mkdir(m1, md0, # links(m8, cache_dirs), cache_dirs[m8].nsubdirs, entries -- str) ) .size) = old_parent_inode ∧ mkinode (m14, md5, true, (m14 = m8 ⊃ mkdir(m0 + 1, md0, m4, m6, entries1[str0, entries[str]]);mkdir(m0 + 1, md6, m4, m6, entries1[str0, entries[str]])).nlink, (m14 = m8 ⊃ mkdir(m0 + 1, md0, m4, m6, entries1[str0, entries[str]]);mkdir(m0 + 1, md6, m4, m6, entries1[str0, entries[str]])).nsubdirs, (m14 = m8 ⊃ mkdir(m0 + 1, md0, m4, m6, entries1[str0, entries[str]]);mkdir(m0 + 1, md6, m4, m6, entries1[str0, entries[str]])).size) = new_parent_inode ∧ new_child_inode0 = new_child_inode ∧ negdentry(str) = old_dent ∧ mkdentry(str0, entries[str]) = new_dent ∧ ESUCCESS = err ∧ dirs = cache_dirs [m8, (m8 = m14 ⊃ mkdir(m0 + 1, md6, m4, m6, entries1[str0, entries[str]]) ;mkdir(m1, md4, # links(m8, cache_dirs), cache_dirs[m8].nsubdirs, entries -- str) ) .meta:= md0 ] [m14, (m14 = m8 ⊃ mkdir(m0 + 1, md0, m4, m6, entries1[str0, entries[str]]);mkdir(m0 + 1, md6, m4, m6, entries1[str0, entries[str]])).meta:= md5 ] ∧ afs_files = (cache_files ⊕ cache_pcache) ⊕ cache_icache[m8, mkientry(false, mkinode(m8, md, true, m12, m13, m))] [m14, mkientry (false, mkinode (m14, md5, true, (m14 = m8 ⊃ mkdir(m0 + 1, md0, m4, m6, entries1[str0, entries[str]]);mkdir(m0 + 1, md6, m4, m6, entries1[str0, entries[str]])).nlink, (m14 = m8 ⊃ mkdir(m0 + 1, md0, m4, m6, entries1[str0, entries[str]]);mkdir(m0 + 1, md6, m4, m6, entries1[str0, entries[str]])).nsubdirs, (m14 = m8 ⊃ mkdir(m0 + 1, md0, m4, m6, entries1[str0, entries[str]]);mkdir(m0 + 1, md6, m4, m6, entries1[str0, entries[str]])).size)) ] ∧ (asynced ↔ asynced2)), str0 ∈ entries2, entries[str] ∈ cache_dirs, str0 ∈ cache_dirs[m14].entries

Heuristic symbolic execution applied rule assign right

And obtained the following new goals

Rule argument

Additional information