| boolvar0 ↔ true, ¬ fs[ri[inodekey(m3)]].directory ↔ ¬ fs[ri[inodekey(m)]].directory, boolvar ↔ old_ino = new_ino ∧ mkdentry(str0, m3) = mkdentry(str, m), fs[ri[dentrykey(m7, str0)]] = dentrynode(key0, m3), fs[ri[dentrykey(m7, str)]] = dentrynode(key, m), fs[ri[inodekey(m7)]] = inodenode(key1, md2, true, m4, n0 + (boolvar1 ⊃ 1;0), m11 + 1), dirs = abs-dirs(fs, ri)[old_ino, abs-dirs(fs, ri)[old_ino].entries:= (abs-dirs(fs, ri)[old_ino].entries -- str)], new_ino = m7, old_dent = mkdentry(str, m), old_ino = m7, orphans(fs, ri).inodes?, fo.inodes?, afs-cons(abs-dirs(fs, ri), abs-files(fs, ri)), file-node-cons(fs, ri), log-cons(log, fs), orphans-cons(fs, ri, orphans(fs, ri)), replay-cons-strong(fs, ri, orphans(fs, ri), fi, fo, log), ri-cons(ri, fs), ri-inj(ri), ri-inj(fi), ubifs-cons(fs, ri, orphans(fs, ri), fi, fo, log), dentrykey(m7, str0) ∈ ri, ri[dentrykey(m7, str0)] ∈ fs, inodekey(m3) ∈ ri, inodekey(m) ∈ ri, ri[inodekey(m7)] ∈ fs, inodekey(m7) ∈ ri, ri[dentrykey(m7, str)] ∈ fs, dentrykey(m7, str) ∈ ri, ⌊err1⌋ , fs[ri[inodekey(m3)]].directory → dentrykeys(inodekey(m3), ri) = ∅, fs[ri[inodekey(m3)]].directory → abs-children(m3, fs, ri) = ∅, boolvar3 → boolvar4, m10 = 0 → links(m3, fs, ri) = ∅ ++ dentrykey(m7, str0), fs[ri[inodekey(m3)]].directory ∧ m10 + 1 = fs[ri[inodekey(m3)]].nlink ∧ m6 = fs[ri[inodekey(m3)]].size ∧ m5 = fs[ri[inodekey(m3)]].nsubdirs ∧ boolvar2 ∨ ¬ fs[ri[inodekey(m)]].directory ∧ m10 + 1 = fs[ri[inodekey(m3)]].nlink ∧ m5 = 0 ∧ ¬ boolvar2, fs[ri[inodekey(m)]].directory ∧ m0 = fs[ri[inodekey(m)]].nlink ∧ m2 = fs[ri[inodekey(m)]].size ∧ m1 = fs[ri[inodekey(m)]].nsubdirs ∧ boolvar1 ∨ ¬ fs[ri[inodekey(m)]].directory ∧ m0 = fs[ri[inodekey(m)]].nlink ∧ m1 = 0 ∧ ¬ boolvar1, ¬ fs[ri[inodekey(m)]].directory ∧ ¬ boolvar2 ∧ m10 + 1 = fs[ri[inodekey(m3)]].nlink ∧ m5 = fs[ri[inodekey(m3)]].nsubdirs ∨ fs[ri[inodekey(m3)]].directory ∧ boolvar2 ∧ m10 + 1 = fs[ri[inodekey(m3)]].nlink ∧ m5 = fs[ri[inodekey(m3)]].nsubdirs ∧ m6 = fs[ri[inodekey(m3)]].size, ¬ fs[ri[inodekey(m)]].directory ∧ ¬ boolvar1 ∧ m0 = fs[ri[inodekey(m)]].nlink ∧ m1 = fs[ri[inodekey(m)]].nsubdirs ∨ fs[ri[inodekey(m)]].directory ∧ boolvar1 ∧ m0 = fs[ri[inodekey(m)]].nlink ∧ m1 = fs[ri[inodekey(m)]].nsubdirs ∧ m2 = fs[ri[inodekey(m)]].size, links(m7, abs-dirs(fs, ri)) ≠ ∅ ∨ m7 = ROOT_INO, m4 ≠ 0 ∨ m7 = ROOT_INO ⊦ ⟨asynced := ?⟩ ((asynced → boolvar5) ∧ err1 = err1), m3 = 0, m3 = ROOT_INO, m7 = 0, mkdentry(str, m) = mkdentry(str0, m3), dirs[old_ino].size ≥ 1, m4 = 0 ∧ m7 ≠ ROOT_INO |
Used simplifier rules: ⊦ dirs[ino, ad][ino0] = (ino0 = ino ∧ ino ∈ dirs ⊃ ad;dirs[ino0]); (s)%⊦ ino ∈ abs-dirs(fs, ri) ↔ inodekey(ino) ∈ ri ∧ fs[ri[inodekey(ino)]].directory; (s)%⊦ dentrykey(ino, str) ∈ ri ∧ ubifs-cons(fs, ri, ro, fi, fo, log) → fs[ri[inodekey(ino)]].directory; (ss)% ⊦ (ad.entries:= entries).size = ad.size; (s)% ⊦ n ≥ m ↔ m ≤ n; (s)% ⊦ m ≤ n ↔ ¬ n < m; (ss)% ⊦ m < 1 ↔ m = 0; (s)