| dirs0[ino2] = mkdir(# entries1, md, # links(ino2, dirs0), m3, entries1), files0[entries[str]] = mkfile(m0, md2, # links(entries[str], dirs0), content0), entries0[str] = entries[str], dirs0[ino3] = mkdir(# entries, md1, # links(ino3, dirs0), m4, entries), root[q] = dnode(md0, sdt), root[q + str '] = fnode(fid), ((abs|(root, ROOT_INO, q, ino1) * ino1 => mkdir(# entries0, md0, # links(ino1, dirs0), m2, entries0) * abs(sdt, entries0)))(dirs0), root.dir?, root[q0].dir?, dom of < ino0, afs-cons(dirs0, files0), afs-cons(dirs, files0[entries[str], mkfile(m0, md2, # links(entries[str], dirs0) + 1, content0)]), fids-cons(root, abs-files(files0), abs-of(of)), ispath(q0, ROOT_INO, ino2, dirs0, files0), ispath(q, ROOT_INO, ino1, dirs0, files0), of-cons(of, dirs, files0[entries[str], mkfile(m0, md2, # links(entries[str], dirs0) + 1, content0)]), of-cons(of, dirs0, files0), pw(user, md), px(user, md0), px(user, md), px-parent(user, q0, ROOT_INO, dirs0, files0), px-parent(user, q, ROOT_INO, dirs0, files0), str ∈ entries0, entries[str] ∈ files0, ino3 ∈ dirs0, str ∈ entries, ino2 ∈ dirs0, q ∈ root, str ∈ sdt, dirs ≡ dirs0[ino2, mkdir(# entries1 + 1, md, # links(ino2, dirs0), m3, entries1[str0, entries[str]])], psynced0 → asynced0, links(ino1, dirs0) ≠ ∅ ∨ ino1 = ROOT_INO, links(ino2, dirs0) ≠ ∅ ∨ ino2 = ROOT_INO, links(ino3, dirs0) ≠ ∅ ∨ ino3 = ROOT_INO ⊦ abs(root[q0 + str0 ', fnode(fid)], ROOT_INO)(dirs), str0 ∈ entries1, entries[str] ∈ dirs0 |
⊦ ispath(p, ino, m, dirs, files) ∧ px-parent(user, p, ino, dirs, files) ∧ abs(tree, ino)(dirs) ∧ fids-cons(tree, abs-files(files), ofh) ∧ afs-cons(dirs, files) ∧ m ∈ dirs ∧ dirs[m] = mkdir(m0, md, n0, n1, entries) ∧ str ∈ entries ∧ entries[str] ∈ files → (tree[p + str '] = fnode(fid) ↔ fid = ⌜entries[str]⌝ )
root[q + str '] = fnode(fid), root[q] = dnode(md0, sdt), dirs0[ino3] = mkdir(# entries, md1, # links(ino3, dirs0), m4, entries), entries0[str] = entries[str], files0[entries[str]] = mkfile(m0, md2, # links(entries[str], dirs0), content0), dirs0[ino2] = mkdir(# entries1, md, # links(ino2, dirs0), m3, entries1), ((abs|(root, ROOT_INO, q, ino1) * ino1 => mkdir(# entries0, md0, # links(ino1, dirs0), m2, entries0) * abs(sdt, entries0)))(dirs0), root[q0].dir?, root.dir?, dom of < ino0, afs-cons(dirs, files0[entries[str], mkfile(m0, md2, # links(entries[str], dirs0) + 1, content0)]), afs-cons(dirs0, files0), fids-cons(root, abs-files(files0), abs-of(of)), ispath(q, ROOT_INO, ino1, dirs0, files0), ispath(q0, ROOT_INO, ino2, dirs0, files0), of-cons(of, dirs0, files0), of-cons(of, dirs, files0[entries[str], mkfile(m0, md2, # links(entries[str], dirs0) + 1, content0)]), pw(user, md), px(user, md), px(user, md0), px-parent(user, q, ROOT_INO, dirs0, files0), px-parent(user, q0, ROOT_INO, dirs0, files0), str ∈ sdt, q ∈ root, ino2 ∈ dirs0, str ∈ entries, ino3 ∈ dirs0, entries[str] ∈ files0, str ∈ entries0, dirs ≡ dirs0[ino2, mkdir(# entries1 + 1, md, # links(ino2, dirs0), m3, entries1[str0, entries[str]])], psynced0 → asynced0, links(ino3, dirs0) ≠ ∅ ∨ ino3 = ROOT_INO, links(ino2, dirs0) ≠ ∅ ∨ ino2 = ROOT_INO, links(ino1, dirs0) ≠ ∅ ∨ ino1 = ROOT_INO ⊦ abs(root[q0 + str0 ', fnode(fid)], ROOT_INO)(dirs), entries[str] ∈ dirs0, str0 ∈ entries1, ispath(q, ROOT_INO, ino1, dirs0, files0) ∧ px-parent(user, q, ROOT_INO, dirs0, files0) ∧ abs(root, ROOT_INO)(dirs0) ∧ fids-cons(root, abs-files(files0), abs-of(of)) ∧ afs-cons(dirs0, files0) ∧ ino1 ∈ dirs0 ∧ dirs0[ino1] = mkdir(# entries0, md0, # links(ino1, dirs0), m2, entries0) ∧ str ∈ entries0 ∧ entries0[str] ∈ files0
⊦ abs(tree, ino)(dirs) ∧ fids-cons(tree, abs-files(files), ofh) ∧ afs-cons(dirs, files) → (p ∈ tree ↔ ispath(p, ino, dirs, files))
⊦ ispath(p, ROOT_INO, ino, dirs, files) ∧ ino ∈ dirs ∧ dirs[ino] = mkdir(n, md, m0, m1, entries) ∧ fids-cons(tree, abs-files(files), ofh) ∧ afs-cons(dirs, files) ∧ ¬ abs(tree0, ROOT_INO)(dirs0) → ( abs(tree, ROOT_INO)(dirs) ↔ (∃ sdt. ((abs|(tree, ROOT_INO, p, ino) * ino => mkdir(n, md, m0, m1, entries) * abs(sdt, entries)))(dirs) ∧ p ∈ tree ∧ tree[p] = dnode(md, sdt)))
abs(tree0, ino1) = emp ⊦ ¬ str ∈ entries ∧ p ∈ tree ∧ tree[p] = dnode(md, sdt) ∧ ((abs|(tree, ROOT_INO, p, ino0) * ino0 => mkdir(# entries + 1, md, m0, m1, entries[str, ino1]) * abs(sdt, entries)))(dirs) → abs(tree[p + str ', tree0], ROOT_INO)(dirs)
Used simplifier rules: path-in-eq: ⊦ abs(tree, ino)(dirs) ∧ fids-cons(tree, abs-files(files), ofh) ∧ afs-cons(dirs, files) → (p ∈ tree ↔ ispath(p, ino, dirs, files));%abs-unfold: ⊦ ispath(p, ROOT_INO, ino, dirs, files) ∧ ino ∈ dirs ∧ dirs[ino] = mkdir(n, md, m0, m1, entries) ∧ fids-cons(tree, abs-files(files), ofh) ∧ afs-cons(dirs, files) ∧ ¬ abs(tree0, ROOT_INO)(dirs0) → ( abs(tree, ROOT_INO)(dirs) ↔ (∃ sdt. (( abs|(tree, ROOT_INO, p, ino) * ino => mkdir(n, md, m0, m1, entries) * abs(sdt, entries)) )(dirs) ∧ p ∈ tree ∧ tree[p] = dnode(md, sdt)));%abs-fold-new: abs(tree0, ino1) = emp ⊦ ¬ str ∈ entries ∧ p ∈ tree ∧ tree[p] = dnode(md, sdt) ∧ (( abs|(tree, ROOT_INO, p, ino0) * ino0 => mkdir(# entries + 1, md, m0, m1, entries[str, ino1]) * abs(sdt, entries)) )(dirs) → abs(tree[p + str ', tree0], ROOT_INO)(dirs);%sep-ass: ⊦ (D * D0) * D1 = D * D0 * D1; from specification heap-sep[dir-heap]%sep-com: ⊦ D * D0 = D0 * D; from specification heap-sep[dir-heap]% ⊦ ((ino => ad * D))(dirs) → (dirs[ino] = ad0 ↔ ad = ad0); (s)% ⊦ ((ino => ad * D))(dirs) → ino ∈ dirs; (s)% ⊦ ispath(p, n, m, dirs, files) → ispath(p, n, dirs, files); (s)%⊦ dirs ≡ dirs0[ino, ad] → ( ((ino => ad0 * D))(dirs0) ↔ ((ino => ad * D))(dirs) ∧ dirs0[ino] = ad0 ∧ ino ∈ dirs0); (ws)%a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic%c: ⊦ m + n = n + m; from specification nat-basic% ⊦ abs(fnode(fid), ino) = (emp ∧ ⌜ino = fid.ino⌝ ); (s)% ⊦ ⌜m⌝ .ino = m; (s)% ⊦ ⌜true⌝ = true; (s)% ⊦ (true ∧ D) = D; (s)%and-ass: ⊦ ((D ∧ D0) ∧ D1) = (D ∧ D0 ∧ D1); from specification heap-sep[dir-heap]%and-com: ⊦ (D ∧ D0) = (D0 ∧ D); from specification heap-sep[dir-heap]%a: ⊦ (p + p0) + p1 = p + p0 + p1; from specification list[path] Used terms: ROOT_INO, ino1, dirs0, files0, user, abs-of(of), # entries0, md0, # links(ino1, dirs0), m2, entries0, fid, str, q, root