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

# links(entries1[str], cache_dirs) = m19 + 1, # links(m15, cache_dirs) = cache_dirs[m15].nlink, # links(m3, cache_dirs) = cache_dirs[m3].nlink, m1 + 1 = cache_dirs[m15].size, (m3 = m15 ⊃ mkdir(m5, md0, m9, m11, entries2[str, entries[str0]]);mkdir(m5, md8, m9, m11, entries2[str, entries[str0]])) = mkdir(m10, md1, m14, m20, entries0), (m3 = m15 ⊃ mkdir(m1, md6, cache_dirs[m15].nlink, cache_dirs[m15].nsubdirs, entries -- str0);cache_dirs[m3]) = mkdir(m5, md8, m9, m11, entries2), (m15 = m3 ⊃ mkdir(m5, md10, m9, m11, entries2[str, entries[str0]]);mkdir(m1, md0, cache_dirs[m15].nlink, cache_dirs[m15].nsubdirs, entries -- str0)) = mkdir(m, md, m16, m17, entries3), asynced1 ↔ true, asynced0 ↔ old_ino = new_ino ∧ mkdentry(str, entries1[str]) = mkdentry(str0, entries[str0]), cache_files[entries[str0]] = mkfile(m4, md5, # links(entries[str0], cache_dirs), content2), cache_dirs[m3] = mkdir(cache_dirs[m3].size, md9, cache_dirs[m3].nlink, cache_dirs[m3].nsubdirs, entries1), ((cache_files ⊕ cache_pcache) ⊕ cache_icache)[entries[str0]] = mkfile(m8, md4, # links(entries[str0], cache_dirs), content0), ((cache_files ⊕ cache_pcache) ⊕ cache_icache)[entries1[str]] = mkfile(m12, md3, m19 + 1, content), cache_dirs[m15] = mkdir(m1 + 1, md6, cache_dirs[m15].nlink, cache_dirs[m15].nsubdirs, entries), cache_files[entries1[str]] = mkfile(m2, md7, m19 + 1, content1), entries1[str] = cache_dirs[m3].entries[str], entries[str0] = cache_dirs[m15].entries[str0], afs_files = (cache_files ⊕ cache_pcache) ⊕ cache_icache, asynced0, dirs = dirs0[new_ino, dirs0[new_ino].entries:= dirs0[new_ino].entries[mkdentry(str, entries1[str]).name, old_dent.ino]], dirs0 = cache_dirs[old_ino, cache_dirs[old_ino].entries:= (cache_dirs[old_ino].entries -- mkdentry(str0, entries[str0]).name)], new_dent = mkdentry(str, entries1[str]), new_ino = m3, old_dent = mkdentry(str0, entries[str0]), old_ino = m15, old_dent.dentry?, afs-cons(cache_dirs, cache_files), afs-cons(cache_dirs, (cache_files ⊕ cache_pcache) ⊕ cache_icache), afs-cons (cache_dirs [m15, (m15 = m3 ⊃ mkdir(m5, md8, m9, m11, entries2[str, entries[str0]]) ;mkdir(m1, md6, cache_dirs[m15].nlink, cache_dirs[m15].nsubdirs, entries -- str0) ) .meta:= md0 ] [m3, mkdir(m10, md10, m14, m20, entries0) ], cache_files[entries1[str], mkfile(m18, md11, m19, content1)]), dcache-cons ((cache_dcache -- dentrykey(m15, str0))[dentrykey(m3, str), mkdentry(str, entries[str0])], cache_dirs [m15, (m15 = m3 ⊃ mkdir(m5, md8, m9, m11, entries2[str, entries[str0]]) ;mkdir(m1, md6, cache_dirs[m15].nlink, cache_dirs[m15].nsubdirs, entries -- str0) ) .meta:= md0 ] [m3, mkdir(m10, md10, m14, m20, entries0) ], cache_files[entries1[str], mkfile(m18, md11, m19, content1)]), dcache-cons(cache_dcache, cache_dirs, cache_files), icache-cons (cache_icache[m15, mkientry(false, mkinode(m15, md, true, m16, m17, m))][m3, mkientry(false, mkinode(m3, md10, true, m14, m20, m10))] [entries1[str], mkientry(false, mkinode(entries1[str], md11, false, m19, 0, m18)) ], cache_dirs [m15, (m15 = m3 ⊃ mkdir(m5, md8, m9, m11, entries2[str, entries[str0]]) ;mkdir(m1, md6, cache_dirs[m15].nlink, cache_dirs[m15].nsubdirs, entries -- str0) ) .meta:= md0 ] [m3, mkdir(m10, md10, m14, m20, entries0) ], cache_files[entries1[str], mkfile(m18, md11, m19, content1)]), icache-cons(cache_icache, cache_dirs, cache_files), pcache-cons (cache_pcache, cache_dirs [m15, (m15 = m3 ⊃ mkdir(m5, md8, m9, m11, entries2[str, entries[str0]]) ;mkdir(m1, md6, cache_dirs[m15].nlink, cache_dirs[m15].nsubdirs, entries -- str0) ) .meta:= md0 ] [m3, mkdir(m10, md10, m14, m20, entries0) ], cache_files[entries1[str], mkfile(m18, md11, m19, content1)]), pcache-cons(cache_pcache, cache_dirs, cache_files), synced (cache_dirs [m15, (m15 = m3 ⊃ mkdir(m5, md8, m9, m11, entries2[str, entries[str0]]) ;mkdir(m1, md6, cache_dirs[m15].nlink, cache_dirs[m15].nsubdirs, entries -- str0) ) .meta:= md0 ] [m3, mkdir(m10, md10, m14, m20, entries0) ], cache_icache[m15, mkientry(false, mkinode(m15, md, true, m16, m17, m))][m3, mkientry(false, mkinode(m3, md10, true, m14, m20, m10))] [entries1[str], mkientry(false, mkinode(entries1[str], md11, false, m19, 0, m18)) ], cache_pcache), synced(cache_dirs, cache_icache, cache_pcache), str ∈ entries1, str0 ∈ entries, m3 ∈ cache_dirs, entries[str0] ∈ cache_files, m15 ∈ cache_dirs, entries1[str] ∈ cache_files, str ∈ cache_dirs[m3].entries, str0 ∈ cache_dirs[m15].entries, cache_sync → synced (cache_files[entries1[str], mkfile(m18, md11, m19, content1)], cache_icache[m15, mkientry(false, mkinode(m15, md, true, m16, m17, m))][m3, mkientry(false, mkinode(m3, md10, true, m14, m20, m10))] [entries1[str], mkientry(false, mkinode(entries1[str], md11, false, m19, 0, m18)) ], cache_pcache), cache_sync → synced(cache_files, cache_icache, cache_pcache), m3 = m15 → md10 = md0, old_ino = new_ino → str ∈ entries1 ∧ str0 ∈ entries, links(m3, cache_dirs) ≠ ∅ ∨ m3 = ROOT_INO, links(m15, cache_dirs) ≠ ∅ ∨ m15 = ROOT_INO ⊦ ⟨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(m15, md0, true, # links(m15, cache_dirs), cache_dirs[m15].nsubdirs, m1 + 1); dirs, afs_files); afs_inode_sync#(mkinode(m3, md10, true, # links(m3, cache_dirs), cache_dirs[m3].nsubdirs, cache_dirs[m3].size); dirs, afs_files); new_child_inode := mkinode(entries1[str], md11, false, m19 + 1, 0, m18); 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 := (m15 ∈ dirs ⊃ mkinode(m15, dirs[m15].meta, true, dirs[m15].nlink, dirs[m15].nsubdirs, dirs[m15].size) ;mkinode(m15, afs_files[m15].meta, false, afs_files[m15].nlink, 0, afs_files[m15].size) ); new_parent_inode := (m3 ∈ dirs ⊃ mkinode(m3, dirs[m3].meta, true, dirs[m3].nlink, dirs[m3].nsubdirs, dirs[m3].size) ;mkinode(m3, afs_files[m3].meta, false, afs_files[m3].nlink, 0, afs_files[m3].size) ); err := ESUCCESS; asynced := ?⟩ ( mkinode (m15, (m15 = m3 ⊃ mkdir(m5, md10, m9, m11, entries2[str, entries[str0]]) ;mkdir(m1, md0, # links(m15, cache_dirs), cache_dirs[m15].nsubdirs, entries -- str0) ) .meta, true, (m15 = m3 ⊃ mkdir(m5, md10, m9, m11, entries2[str, entries[str0]]) ;mkdir(m1, md0, # links(m15, cache_dirs), cache_dirs[m15].nsubdirs, entries -- str0) ) .nlink, (m15 = m3 ⊃ mkdir(m5, md10, m9, m11, entries2[str, entries[str0]]) ;mkdir(m1, md0, # links(m15, cache_dirs), cache_dirs[m15].nsubdirs, entries -- str0) ) .nsubdirs, (m15 = m3 ⊃ mkdir(m5, md10, m9, m11, entries2[str, entries[str0]]) ;mkdir(m1, md0, # links(m15, cache_dirs), cache_dirs[m15].nsubdirs, entries -- str0) ) .size) = old_parent_inode ∧ mkinode(m3, md10, true, m14, m20, m10) = new_parent_inode ∧ mkinode(entries1[str], md11, false, m19, 0, m18) = new_child_inode ∧ negdentry(str0) = old_dent ∧ mkdentry(str, entries[str0]) = new_dent ∧ ESUCCESS = err ∧ dirs = cache_dirs [m15, (m15 = m3 ⊃ mkdir(m5, md8, m9, m11, entries2[str, entries[str0]]) ;mkdir(m1, md6, # links(m15, cache_dirs), cache_dirs[m15].nsubdirs, entries -- str0) ) .meta:= md0 ] [m3, (m3 = m15 ⊃ mkdir(m5, md0, m9, m11, entries2[str, entries[str0]]);mkdir(m5, md8, m9, m11, entries2[str, entries[str0]])).meta:= md10 ] ∧ afs_files = (cache_files[entries1[str], mkfile(m18, md11, m19, content1)] ⊕ cache_pcache) ⊕ cache_icache[m15, mkientry(false, mkinode(m15, md, true, m16, m17, m))][m3, mkientry(false, mkinode(m3, md10, true, m14, m20, m10))] [entries1[str], mkientry(false, mkinode(entries1[str], md11, false, m19, 0, m18)) ] ∧ (asynced ↔ asynced2)), entries[str0] ∈ cache_dirs, entries1[str] ∈ cache_dirs, m15 = m3 ∧ mkdentry(str, entries1[str]) = mkdentry(str0, entries[str0])

Heuristic symbolic execution applied rule if negative right

And obtained the following new goals

Rule argument

pos: right 1

Additional information