| #((links(entries2[str], dirs0) -- mklink(m, str)) ++ mklink(m, str0)) = # links(entries2[str], dirs0), (m19 = m ⊃ mkdir(m1 + 1, md0, # links(m, dirs0), m9, (entries2 -- str)[str0, entries2[str]]) ;mkdir(m18, md8, # links(m19, dirs0), m20, entries5) ) = mkdir(m15, md7, m16, m17, entries4), dcache0[dentrykey(m19, str1)] = mkdentry(str1, entries5[str1]), dirs0[m19] = mkdir(m18, md8, # links(m19, dirs0), m20, entries5), dirs0[m] = mkdir(m1 + 1, md4, # links(m, dirs0), m9, entries2), files[entries2[str]] = mkfile(m3, md, # links(entries2[str], dirs0), content0), afs-cons(dirs0[m, mkdir(m1 + 1, md0, # links(m, dirs0), m9, (entries2 -- str)[str0, entries2[str]])], files), afs-cons(dirs0, files), synced(dirs0, icache0, pcache), str ∈ entries2, entries2[str] ∈ files, m ∈ dirs0, dentrykey(m19, str1) ∈ dcache0, m19 ∈ dirs0, str1 ∈ entries5, asynced2 → synced(files, icache0, pcache), ∀ key0. key0 ∈ dcache0 → key0.dentry? ∧ key0.name = dcache0[key0].name ∧ key0.ino ∈ dirs0 ∧ (links(key0.ino, dirs0) ≠ ∅ ∨ key0.ino = ROOT_INO) ∧ (dcache0[key0].ino ∈ dirs0 ∨ dcache0[key0].ino ∈ files) ∧ dcache0[key0].name ∈ dirs0[key0.ino].entries ∧ dcache0[key0].ino = dirs0[key0.ino].entries[dcache0[key0].name] ∧ dcache0[key0].dentry?, links(m, dirs0) ≠ ∅ ∨ m = ROOT_INO, links(m19, dirs0) ≠ ∅ ∨ m19 = ROOT_INO, entries5[str1] ∈ dirs0 ∨ entries5[str1] ∈ files ⊦ dentrykey(m19, str1) = dentrykey(m, str0), dentrykey(m19, str1) = dentrykey(m, str), str1 ∈ entries4, entries2[str] ∈ dirs0, str0 ∈ entries2 |
Used simplifier rules: ⊦ mkdir(m, md, m0, m1, entries) = mkdir(m2, md0, m3, m4, entries0) ↔ m = m2 ∧ md = md0 ∧ m0 = m3 ∧ m1 = m4 ∧ entries = entries0; (ws)% ⊦ str ∈ entries[str0, ino] ↔ str = str0 ∨ str ∈ entries; (ws)% ⊦ str ∈ entries -- str0 ↔ str ≠ str0 ∧ str ∈ entries; (s) Used formulas: m19 = m