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

(entries2[str] = m ⊃ mkdir(m8, md6, m10, m11, entries1[str, entries0[str0]]) ;(entries2[str] = m0 ⊃ mkdir(m1, md0, # links(entries2[str], dirs0), m2, entries0 -- str0) ;mkdir(m6, md5, # links(entries2[str], dirs0), m9, ∅) ) ) = mkdir(m13, md7, m12 + 1, m15, entries3), (m = m0 ⊃ mkdir(m1, md0, # links(m0, dirs0), m2, entries0 -- str0);mkdir(m4, md3, # links(m, dirs0), m7, entries2)) = mkdir(m8, md6, m10, m11, entries1), dirs0[entries0[str0]] = mkdir(m3, md4, # links(entries0[str0], dirs0), m5, entries), dirs0[entries2[str]] = mkdir(m6, md5, # links(entries2[str], dirs0), m9, ∅), dirs0[m] = mkdir(m4, md3, # links(m, dirs0), m7, entries2), dirs0[m0] = mkdir(m1 + 1, md0, # links(m0, dirs0), m2 + 1, entries0), dirs = dirs0[entries2[str], mkdir(m13, md7, m12, m15, entries3)] [m0, (m0 = entries2[str] ⊃ mkdir(m13, md7, m12, m15, entries3) ;(m0 = m ⊃ mkdir(m8, md6, m10, m11, entries1[str, entries0[str0]]);mkdir(m1, md0, # links(m0, dirs0), m2, entries0 -- str0)) ) .meta:= md2 ] [m, (m = m0 ⊃ (m0 = entries2[str] ⊃ mkdir(m13, md7, m12, m15, entries3);mkdir(m8, md6, m10, m11, entries1[str, entries0[str0]])).meta:= md2 ;(m = entries2[str] ⊃ mkdir(m13, md7, m12, m15, entries3);mkdir(m8, md6, m10, m11, entries1[str, entries0[str0]])) ) .meta:= md1 ], ino = inode.ino, inode = mkinode(entries2[str], md, true, # links(entries2[str], dirs0), m9, m6), afs-cons(dirs0, files), dcache-cons(dcache, dirs0, files), icache-cons(icache, dirs0, files), pcache-cons(pcache, dirs0, files), synced(dirs0, icache, pcache), m ∈ dirs0, str ∈ entries2, m0 ∈ dirs0, str0 ∈ entries0, entries2[str] ∈ dirs0, entries0[str0] ∈ dirs0, ino ∈ dirs, asynced2 → synced(files, icache, pcache), m = m0 → md1 = md2, (entries2[str] ∈ dirs[ino, dirs[ino].meta:= inode.meta] ⊃ str ∈ entries2 ∧ str ∈ entries2 ∧ str ∈ entries2 ∧ str ∈ entries2 ∧ str ∈ entries2 ;str ∈ entries2 ∧ str ∈ entries2 ∧ str ∈ entries2 ∧ str ∈ entries2 ), links(m, dirs0) ≠ ∅ ∨ m = ROOT_INO, links(m0, dirs0) ≠ ∅ ∨ m0 = ROOT_INO ⊦ [new_parent_inode := (m ∈ dirs[ino, dirs[ino].meta:= inode.meta] ⊃ mkinode (m, dirs[ino, dirs[ino].meta:= inode.meta][m].meta, true, dirs[ino, dirs[ino].meta:= inode.meta][m].nlink, dirs[ino, dirs[ino].meta:= inode.meta][m].nsubdirs, dirs[ino, dirs[ino].meta:= inode.meta][m].size) ;mkinode(m, files[m].meta, false, files[m].nlink, 0, files[m].size) ); err := ESUCCESS; asynced := ?] ( afs-cons(dirs[ino, dirs[ino].meta:= inode.meta], files) → ⟪if err = ESUCCESS then let asynced = false in {icache_set# ((m0 ∈ dirs[ino, dirs[ino].meta:= inode.meta] ⊃ mkinode (m0, dirs[ino, dirs[ino].meta:= inode.meta][m0].meta, true, dirs[ino, dirs[ino].meta:= inode.meta][m0].nlink, dirs[ino, dirs[ino].meta:= inode.meta][m0].nsubdirs, dirs[ino, dirs[ino].meta:= inode.meta][m0].size) ;mkinode(m0, files[m0].meta, false, files[m0].nlink, 0, files[m0].size) ), asynced ; err, icache); icache_set#(new_parent_inode, asynced; err, icache); if true then icache_set# ((entries2[str] ∈ dirs[ino, dirs[ino].meta:= inode.meta] ⊃ mkinode (entries2[str], dirs[ino, dirs[ino].meta:= inode.meta][entries2[str]].meta, true, dirs[ino, dirs[ino].meta:= inode.meta][entries2[str]].nlink, dirs[ino, dirs[ino].meta:= inode.meta][entries2[str]].nsubdirs, dirs[ino, dirs[ino].meta:= inode.meta][entries2[str]].size) ;mkinode(entries2[str], files[entries2[str]].meta, false, files[entries2[str]].nlink, 0, files[entries2[str]].size) ), asynced ; err, icache); dcache_delete# ((m0 ∈ dirs[ino, dirs[ino].meta:= inode.meta] ⊃ mkinode (m0, dirs[ino, dirs[ino].meta:= inode.meta][m0].meta, true, dirs[ino, dirs[ino].meta:= inode.meta][m0].nlink, dirs[ino, dirs[ino].meta:= inode.meta][m0].nsubdirs, dirs[ino, dirs[ino].meta:= inode.meta][m0].size) ;mkinode(m0, files[m0].meta, false, files[m0].nlink, 0, files[m0].size) ) .ino, mkdentry(str0, entries0[str0]).name ; err, dcache); dcache_set# (new_parent_inode.ino, mkdentry(mkdentry(str, entries2[str]).name, mkdentry(str0, entries0[str0]).ino).name, mkdentry(mkdentry(str, entries2[str]).name, mkdentry(str0, entries0[str0]).ino) ; err, dcache)}⟫ ( icache-cons(icache, dirs[ino, dirs[ino].meta:= inode.meta], files) ∧ dcache-cons(dcache, dirs[ino, dirs[ino].meta:= inode.meta], files) ∧ pcache-cons(pcache, dirs[ino, dirs[ino].meta:= inode.meta], files) ∧ synced(dirs[ino, dirs[ino].meta:= inode.meta], icache, pcache) ∧ (asynced2 → synced(files, icache, pcache)))), entries2[str] = ROOT_INO, ino ∈ files, m0 = m ∧ mkdentry(str, entries2[str]) = mkdentry(str0, entries0[str0])

Heuristic symbolic execution applied rule assign right

And obtained the following new goals

Rule argument

Additional information