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

fs0[ri0[inodekey(m)]].nlink = 0 ∧ m ≠ ROOT_INO ↔ inodekey(m) ∈ ro, fs0[ri0[inodekey(m)]].inode?, fo.inodes?, ro.inodes?, file-node-cons(fs0, ri0), log-cons(log0, fs0), orphans-cons(fs0, ri0, ro), replay-cons-strong(fs0, ri0, ro, fi, fo, log0), ri-cons(ri0, fs0), ri-inj(fi), ri-inj(ri0), ubifs-cons(fs0, ri0, ro, fi, fo, log0), inodekey(m) ∈ ri0, ri0[inodekey(m)] ∈ fs0, ro ⊆ dom ri0, adr ∈ log0 → adr ∈ fs0 ∧ (fs0[adr].inode? → fs0[adr].key.inode? ∧ fs0[adr].key.ino ≠ 0) ∧ (fs0[adr].dentry? → fs0[adr].key.dentry?) ∧ (fs0[adr].data? → fs0[adr].key.data?) ∧ (fs0[adr].trunc? → fs0[adr].key.inode?), buf-opt.some? → # buf-opt.buf = VFS_PAGE_SIZE, adr ∈ log0 ∨ adr = adr1 ∨ adr = adr2 ⊦ adr1 = adr2, m = 0, fs0[ri0[inodekey(m)]].directory, adr1 ∈ fs0, adr2 ∈ fs0, m3 ≤ n0 ∧ m3 % VFS_PAGE_SIZE ≠ 0, (adr = adr2 ∨ adr = adr1 ∨ adr ∈ fs0) ∧ ( (adr2 = adr ⊃ inodenode(inodekey(m), md0, false, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, n0) ;(adr1 = adr ⊃ truncnode(inodekey(m), min(n0, m3));fs0[adr]) ) .inode? → (adr2 = adr ⊃ inodenode(inodekey(m), md0, false, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, n0) ;(adr1 = adr ⊃ truncnode(inodekey(m), min(n0, m3));fs0[adr]) ) .key .inode? ∧ (adr2 = adr ⊃ inodenode(inodekey(m), md0, false, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, n0) ;(adr1 = adr ⊃ truncnode(inodekey(m), min(n0, m3));fs0[adr]) ) .key .ino ≠ 0) ∧ ( (adr2 = adr ⊃ inodenode(inodekey(m), md0, false, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, n0) ;(adr1 = adr ⊃ truncnode(inodekey(m), min(n0, m3));fs0[adr]) ) .dentry? → (adr2 = adr ⊃ inodenode(inodekey(m), md0, false, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, n0) ;(adr1 = adr ⊃ truncnode(inodekey(m), min(n0, m3));fs0[adr]) ) .key .dentry?) ∧ ( (adr2 = adr ⊃ inodenode(inodekey(m), md0, false, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, n0) ;(adr1 = adr ⊃ truncnode(inodekey(m), min(n0, m3));fs0[adr]) ) .data? → (adr2 = adr ⊃ inodenode(inodekey(m), md0, false, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, n0) ;(adr1 = adr ⊃ truncnode(inodekey(m), min(n0, m3));fs0[adr]) ) .key .data?) ∧ ( (adr2 = adr ⊃ inodenode(inodekey(m), md0, false, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, n0) ;(adr1 = adr ⊃ truncnode(inodekey(m), min(n0, m3));fs0[adr]) ) .trunc? → (adr2 = adr ⊃ inodenode(inodekey(m), md0, false, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, n0) ;(adr1 = adr ⊃ truncnode(inodekey(m), min(n0, m3));fs0[adr]) ) .key .inode?)

Heuristic nonsplitting cut applied rule cut formula

And obtained the following new goals

Proof step 761:
fs0[ri0[inodekey(m)]].nlink = 0 ∧ m ≠ ROOT_INO ↔ inodekey(m) ∈ ro, fs0[ri0[inodekey(m)]].inode?, ro.inodes?, fo.inodes?, file-node-cons(fs0, ri0), log-cons(log0, fs0), orphans-cons(fs0, ri0, ro), replay-cons-strong(fs0, ri0, ro, fi, fo, log0), ri-cons(ri0, fs0), ri-inj(ri0), ri-inj(fi), ubifs-cons(fs0, ri0, ro, fi, fo, log0), ri0[inodekey(m)] ∈ fs0, inodekey(m) ∈ ri0, ro ⊆ dom ri0, buf-opt.some? → # buf-opt.buf = VFS_PAGE_SIZE, adr ∈ log0 → adr ∈ fs0 ∧ (fs0[adr].inode? → fs0[adr].key.inode? ∧ fs0[adr].key.ino ≠ 0) ∧ (fs0[adr].dentry? → fs0[adr].key.dentry?) ∧ (fs0[adr].data? → fs0[adr].key.data?) ∧ (fs0[adr].trunc? → fs0[adr].key.inode?), adr ∈ log0 ∨ adr = adr1 ∨ adr = adr2 ⊦ adr1 = adr2, m = 0, fs0[ri0[inodekey(m)]].directory, adr2 ∈ fs0, adr1 ∈ fs0, adr ∈ log0, (adr = adr2 ∨ adr = adr1 ∨ adr ∈ fs0) ∧ ( (adr2 = adr ⊃ inodenode(inodekey(m), md0, false, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, n0) ;(adr1 = adr ⊃ truncnode(inodekey(m), min(n0, m3));fs0[adr]) ) .inode? → (adr2 = adr ⊃ inodenode(inodekey(m), md0, false, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, n0) ;(adr1 = adr ⊃ truncnode(inodekey(m), min(n0, m3));fs0[adr]) ) .key .inode? ∧ (adr2 = adr ⊃ inodenode(inodekey(m), md0, false, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, n0) ;(adr1 = adr ⊃ truncnode(inodekey(m), min(n0, m3));fs0[adr]) ) .key .ino ≠ 0) ∧ ( (adr2 = adr ⊃ inodenode(inodekey(m), md0, false, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, n0) ;(adr1 = adr ⊃ truncnode(inodekey(m), min(n0, m3));fs0[adr]) ) .dentry? → (adr2 = adr ⊃ inodenode(inodekey(m), md0, false, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, n0) ;(adr1 = adr ⊃ truncnode(inodekey(m), min(n0, m3));fs0[adr]) ) .key .dentry?) ∧ ( (adr2 = adr ⊃ inodenode(inodekey(m), md0, false, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, n0) ;(adr1 = adr ⊃ truncnode(inodekey(m), min(n0, m3));fs0[adr]) ) .data? → (adr2 = adr ⊃ inodenode(inodekey(m), md0, false, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, n0) ;(adr1 = adr ⊃ truncnode(inodekey(m), min(n0, m3));fs0[adr]) ) .key .data?) ∧ ( (adr2 = adr ⊃ inodenode(inodekey(m), md0, false, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, n0) ;(adr1 = adr ⊃ truncnode(inodekey(m), min(n0, m3));fs0[adr]) ) .trunc? → (adr2 = adr ⊃ inodenode(inodekey(m), md0, false, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, n0) ;(adr1 = adr ⊃ truncnode(inodekey(m), min(n0, m3));fs0[adr]) ) .key .inode?), m3 ≤ n0 ∧ m3 % VFS_PAGE_SIZE ≠ 0

Rule argument

fma: adr ∈ log0

Additional information

Used formulas: adr ∈ log0