[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 231 from proof refine-truncate (previous step)

files0[ino2] = mkfile(m0, md0, # links(ino2, dirs), content0), root[path] = fnode(fid), root.dir?, dom of < ino3, abs(root, ROOT_INO)(dirs), afs-cons(dirs, files0), afs-cons(dirs, files0[ino2, mkfile(n, md0, # links(ino2, dirs), content0 upto min(n, m0))]), fids-cons(root, abs-files(files0), abs-of(of)), ispath(path, ROOT_INO, ino2, dirs, files0), of-cons(of, dirs, files0), of-cons(of, dirs, files0[ino2, mkfile(n, md0, # links(ino2, dirs), content0 upto min(n, m0))]), pw(user, md0), px-parent(user, path, ROOT_INO, dirs, files0), ino2 ∈ files0, ROOT_INO ∈ dirs, fid ∈ abs-files(files0), psynced → asynced0 ⊦ ⟨psynced := ?⟩ ( abs-files(files0)[fid, mkfile(abs-files(files0)[fid].meta, resize(abs-files(files0)[fid].content, n))] = abs-files(files0[ino2, mkfile(n, md0, # links(ino2, dirs), content0 upto min(n, m0))]) ∧ (psynced → asynced)), root[path].dir?, ino2 ∈ dirs, m0 ≤ n ∧ m0 % VFS_PAGE_SIZE ≠ 0 ∧ m0 / VFS_PAGE_SIZE ∈ content0

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 232:
⊦ 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 ∈ files → (tree[p] = fnode(fid) ↔ fid = ⌜m⌝ )
Proof step 233:
files0[ino2] = mkfile(m0, md0, # links(ino2, dirs), content0), root.dir?, dom of < ino3, abs(root, ROOT_INO)(dirs), afs-cons(dirs, files0[ino2, mkfile(n, md0, # links(ino2, dirs), content0 upto min(n, m0))]), afs-cons(dirs, files0), fids-cons(root, abs-files(files0), abs-of(of)), ispath(path, ROOT_INO, ino2, dirs, files0), of-cons(of, dirs, files0[ino2, mkfile(n, md0, # links(ino2, dirs), content0 upto min(n, m0))]), of-cons(of, dirs, files0), pw(user, md0), px-parent(user, path, ROOT_INO, dirs, files0), ROOT_INO ∈ dirs, ino2 ∈ files0, ¬ root[path].dir?, ¬ ino2 ∈ dirs, psynced → asynced0 ⊦ ⟨psynced := ?⟩ (resize((content0.stream to m0).buf, n) = ((content0 upto min(n, m0)).stream to n).buf ∧ (psynced → asynced)), m0 ≤ n ∧ m0 % VFS_PAGE_SIZE ≠ 0 ∧ m0 / VFS_PAGE_SIZE ∈ content0

Rule argument

Additional information

Used simplifier rules: fid-ino: ⊦ 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 ∈ files → (tree[p] = fnode(fid) ↔ fid = ⌜m⌝ );% ⊦ mkfile(m, md, m0, content).size = m; (s)% ⊦ mkfile(m, md, m0, content).content = content; (s)% ⊦ mkfile(m, md, m0, content).meta = md; (s)%⊦ ino ∈ files → ( abs-files(files)[⌜ino⌝ , f] = abs-files(files[ino, af]) ↔ f.meta = af.meta ∧ f.content = (af.content.stream to af.size).buf); (s)% ⊦ mkfile(md, buf).content = buf; (s)% ⊦ mkfile(md, buf).meta = md; (s)%⊦ ino ∈ files → abs-files(files)[⌜ino⌝ ] = mkfile (files[ino].meta, (files[ino].content.stream to files[ino].size).buf); (s)% ⊦ ⌜ino⌝ ∈ abs-files(files) ↔ ino ∈ files; (s)