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

boolvar ↔ boolvar2, VFS_PAGE_SIZE = n0 + m2 % VFS_PAGE_SIZE, fs0[ri0[datakey(m, m2 / VFS_PAGE_SIZE)]] = datanode(datakey(m, m2 / VFS_PAGE_SIZE), buf), fs0[ri0[inodekey(m)]] = inodenode(key1, md0, false, m3, 0, m5), buf-opt = buf-opt0, dirs = abs-dirs(fs0, ri0), err = err1, files = abs-files(fs0, ri0), inode = p_inode, n = n1, p_inode = mkinode(m, md, false, m3, 0, m2), pageno1 = m2 / VFS_PAGE_SIZE, fo.inodes?, orphans(fs0, ri0).inodes?, afs-cons(abs-dirs(fs0, ri0), abs-files(fs0, ri0)), file-node-cons (fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, m3, 0, n1)] [adr3, datanode(datakey(m, m2 / VFS_PAGE_SIZE), fill(buf, zero, m2 % VFS_PAGE_SIZE, n0)) ], ri0[datakey(m, m2 / VFS_PAGE_SIZE), adr3][inodekey(m), adr2] \ datakeys(inodekey(m), m2, ri0[datakey(m, m2 / VFS_PAGE_SIZE), adr3][inodekey(m), adr2])), file-node-cons(fs0, ri0), log-cons (log0, fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, m3, 0, n1)] [adr3, datanode(datakey(m, m2 / VFS_PAGE_SIZE), fill(buf, zero, m2 % VFS_PAGE_SIZE, n0)) ]), log-cons(log0, fs0), orphans-cons (fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, m3, 0, n1)] [adr3, datanode(datakey(m, m2 / VFS_PAGE_SIZE), fill(buf, zero, m2 % VFS_PAGE_SIZE, n0)) ], ri0[datakey(m, m2 / VFS_PAGE_SIZE), adr3][inodekey(m), adr2] \ datakeys(inodekey(m), m2, ri0[datakey(m, m2 / VFS_PAGE_SIZE), adr3][inodekey(m), adr2]), orphans(fs0, ri0)), orphans-cons(fs0, ri0, orphans(fs0, ri0)), replay-cons-strong (fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, m3, 0, n1)] [adr3, datanode(datakey(m, m2 / VFS_PAGE_SIZE), fill(buf, zero, m2 % VFS_PAGE_SIZE, n0)) ], ri0[datakey(m, m2 / VFS_PAGE_SIZE), adr3][inodekey(m), adr2] \ datakeys(inodekey(m), m2, ri0[datakey(m, m2 / VFS_PAGE_SIZE), adr3][inodekey(m), adr2]), orphans(fs0, ri0), fi, fo, ((log0 + adr1 ') + adr2 ') + adr3 '), replay-cons-strong(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), ri-cons(ri0, fs0), ri-inj ( ri0[datakey(m, m2 / VFS_PAGE_SIZE), adr3][inodekey(m), adr2] \ datakeys(inodekey(m), m2, ri0[datakey(m, m2 / VFS_PAGE_SIZE), adr3][inodekey(m), adr2])), ri-inj(fi), ri-inj(ri0), ubifs-cons (fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, m3, 0, n1)] [adr3, datanode(datakey(m, m2 / VFS_PAGE_SIZE), fill(buf, zero, m2 % VFS_PAGE_SIZE, n0)) ], ri0[datakey(m, m2 / VFS_PAGE_SIZE), adr3][inodekey(m), adr2] \ datakeys(inodekey(m), m2, ri0[datakey(m, m2 / VFS_PAGE_SIZE), adr3][inodekey(m), adr2]), orphans(fs0, ri0), fi, fo, ((log0 + adr1 ') + adr2 ') + adr3 '), ubifs-cons(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), inodekey(m) ∈ ri0, datakey(m, m2 / VFS_PAGE_SIZE) ∈ ri0, ri0[datakey(m, m2 / VFS_PAGE_SIZE)] ∈ fs0, ri0[inodekey(m)] ∈ fs0, m2 ≤ n1, VFS_PAGE_SIZE ≤ # buf, asynced → boolvar0 ⊦ m2 % VFS_PAGE_SIZE = 0, VFS_PAGE_SIZE = 0, adr1 = adr2, adr1 = adr3, adr2 = adr3, m = 0, buf-opt0.some?, pre-truncate(inode, n, pageno1, buf-opt, dirs, files), adr3 ∈ ri0, adr3 ∈ fs0, adr2 ∈ fs0, adr1 ∈ fs0

Heuristic simplifier applied rule simplifier

And closed the goal!

Rule argument

Additional information

Used simplifier rules: ⊦ inodenode(key, md, boolvar, m, m0, m1).nlink = m; (s)% ⊦ inodenode(key, md, boolvar, m, m0, m1).directory ↔ boolvar; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).size = m2; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).directory ↔ boolvar; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).nsubdirs = m1; (s)% ⊦ mkfile(m, md, m0, content).nlink = m0; (s)%⊦ abs-file(ino, fs, ri) = mkfile (fs[ri[inodekey(ino)]].size, fs[ri[inodekey(ino)]].meta, fs[ri[inodekey(ino)]].nlink, abs-content(ino, fs, ri)); (s)%⊦ inodekey(ino) ∈ ri ∧ ¬ fs[ri[inodekey(ino)]].directory → abs-files(fs, ri)[ino] = abs-file(ino, fs, ri); (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).nlink = m0; (s)%⊦ ino ∈ abs-files(fs, ri) ↔ inodekey(ino) ∈ ri ∧ ¬ fs[ri[inodekey(ino)]].directory; (s)% ⊦ valid-file-ino(ino, dirs, files) ↔ ino ∈ files; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).ino = m; (s)%⊦ valid-file-inode(inode, dirs, files) ↔ valid-file-ino(inode.ino, dirs, files) ∧ inode.nlink = files[inode.ino].nlink ∧ inode.nsubdirs = 0 ∧ ¬ inode.directory; (s)%⊦ pre-truncate(inode, n, pageno, buf-opt, dirs, files) ↔ valid-file-inode(inode, dirs, files) ∧ pageno = inode.size / VFS_PAGE_SIZE ∧ (buf-opt.some? → # buf-opt.buf = VFS_PAGE_SIZE); (s)% ⊦ VFS_PAGE_SIZE ≠ 0; (s)