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

fs[ri[dentrykey(ino3, str)]].ino = fs[ri[dentrykey(ino1, str)]].ino, 0 = fs[ri[inodekey(fs[ri[dentrykey(ino1, str)]].ino)]].nsubdirs, fs[ri[dentrykey(ino0, str)]] = dentrynode(key, fs[ri[dentrykey(ino1, str)]].ino), fs[ri[dentrykey(ino2, str)]] = dentrynode(key0, fs[ri[dentrykey(ino1, str)]].ino), fs[ri[dentrykey(ino1, str)]].ino ≠ 0, m0 ≠ 0, fs[ri[inodekey(ino2)]].directory, fs[ri[inodekey(ino3)]].directory, fs[ri[inodekey(ino1)]].directory, fs[ri[inodekey(m0)]].directory, fs[ri[inodekey(ino0)]].directory, fo.inodes?, orphans(fs, ri).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(fi), ri-inj(ri), ubifs-cons(fs, ri, orphans(fs, ri), fi, fo, log), ri[dentrykey(ino2, str)] ∈ fs, inodekey(ino3) ∈ ri, inodekey(ino2) ∈ ri, dentrykey(ino2, str) ∈ ri, dentrykey(ino3, str) ∈ ri, inodekey(ino1) ∈ ri, inodekey(fs[ri[dentrykey(ino1, str)]].ino) ∈ ri, dentrykey(ino1, str) ∈ ri, inodekey(m0) ∈ ri, inodekey(ino0) ∈ ri, ri[dentrykey(ino0, str)] ∈ fs, dentrykey(ino0, str) ∈ ri, ¬ fs[ri[inodekey(fs[ri[dentrykey(ino1, str)]].ino)]].directory, ¬ dentrykey(m0, str0) ∈ ri, asynced → boolvar0, ∀ adr, adr0, adr1. adr ∈ fs ∨ adr0 ∈ fs ∨ adr1 ∈ fs ∨ adr = adr0 ∨ adr = adr1 ∨ adr0 = adr1, links(ino2, abs-dirs(fs, ri)) ≠ ∅ ∨ ino2 = ROOT_INO, fs[ri[inodekey(fs[ri[dentrykey(ino1, str)]].ino)]].nlink ≠ 0 ∨ fs[ri[dentrykey(ino1, str)]].ino = ROOT_INO, fs[ri[inodekey(ino3)]].nlink ≠ 0 ∨ ino3 = ROOT_INO, fs[ri[inodekey(ino1)]].nlink ≠ 0 ∨ ino1 = ROOT_INO, fs[ri[inodekey(m0)]].nlink ≠ 0 ∨ m0 = ROOT_INO, links(ino0, abs-dirs(fs, ri)) ≠ ∅ ∨ ino0 = ROOT_INO, links(m0, abs-dirs(fs, ri)) ≠ ∅ ∨ m0 = ROOT_INO, links(fs[ri[dentrykey(ino1, str)]].ino, abs-dirs(fs, ri)) ≠ ∅ ∨ fs[ri[dentrykey(ino1, str)]].ino = ROOT_INO ⊦ ∃ err0. ⌊err0⌋ ∧ ⟨err := err0; asynced := ?⟩ ((asynced → boolvar) ∧ ENOSPC = err), fs[ri[inodekey(fs[ri[dentrykey(ino1, str)]].ino)]].nlink = 0 ∧ fs[ri[dentrykey(ino1, str)]].ino ≠ ROOT_INO, fs[ri[inodekey(m0)]].nlink = 0 ∧ m0 ≠ ROOT_INO, fs[ri[inodekey(ino1)]].nlink = 0 ∧ ino1 ≠ ROOT_INO

User applied rule exists right

And obtained the following new goals

Proof step 299:
fs[ri[dentrykey(ino3, str)]].ino = fs[ri[dentrykey(ino1, str)]].ino, 0 = fs[ri[inodekey(fs[ri[dentrykey(ino1, str)]].ino)]].nsubdirs, fs[ri[dentrykey(ino2, str)]] = dentrynode(key0, fs[ri[dentrykey(ino1, str)]].ino), fs[ri[dentrykey(ino0, str)]] = dentrynode(key, fs[ri[dentrykey(ino1, str)]].ino), fs[ri[inodekey(ino0)]].directory, fs[ri[inodekey(m0)]].directory, fs[ri[inodekey(ino1)]].directory, fs[ri[inodekey(ino3)]].directory, fs[ri[inodekey(ino2)]].directory, 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(ino0, str) ∈ ri, ri[dentrykey(ino0, str)] ∈ fs, inodekey(ino0) ∈ ri, inodekey(m0) ∈ ri, dentrykey(ino1, str) ∈ ri, inodekey(fs[ri[dentrykey(ino1, str)]].ino) ∈ ri, inodekey(ino1) ∈ ri, dentrykey(ino3, str) ∈ ri, dentrykey(ino2, str) ∈ ri, inodekey(ino2) ∈ ri, inodekey(ino3) ∈ ri, ri[dentrykey(ino2, str)] ∈ fs, asynced → boolvar0, ∀ adr, adr0, adr1. adr ∈ fs ∨ adr0 ∈ fs ∨ adr1 ∈ fs ∨ adr = adr0 ∨ adr = adr1 ∨ adr0 = adr1, links(fs[ri[dentrykey(ino1, str)]].ino, abs-dirs(fs, ri)) ≠ ∅ ∨ fs[ri[dentrykey(ino1, str)]].ino = ROOT_INO, links(m0, abs-dirs(fs, ri)) ≠ ∅ ∨ m0 = ROOT_INO, links(ino0, abs-dirs(fs, ri)) ≠ ∅ ∨ ino0 = ROOT_INO, fs[ri[inodekey(m0)]].nlink ≠ 0 ∨ m0 = ROOT_INO, fs[ri[inodekey(ino1)]].nlink ≠ 0 ∨ ino1 = ROOT_INO, fs[ri[inodekey(ino3)]].nlink ≠ 0 ∨ ino3 = ROOT_INO, fs[ri[inodekey(fs[ri[dentrykey(ino1, str)]].ino)]].nlink ≠ 0 ∨ fs[ri[dentrykey(ino1, str)]].ino = ROOT_INO, links(ino2, abs-dirs(fs, ri)) ≠ ∅ ∨ ino2 = ROOT_INO ⊦ ⌊ENOSPC⌋ ∧ ⟨err := ENOSPC; asynced := ?⟩ ((asynced → boolvar) ∧ ENOSPC = err), fs[ri[dentrykey(ino1, str)]].ino = 0, m0 = 0, fs[ri[inodekey(fs[ri[dentrykey(ino1, str)]].ino)]].directory, dentrykey(m0, str0) ∈ ri, fs[ri[inodekey(ino1)]].nlink = 0 ∧ ino1 ≠ ROOT_INO, fs[ri[inodekey(m0)]].nlink = 0 ∧ m0 ≠ ROOT_INO, fs[ri[inodekey(fs[ri[dentrykey(ino1, str)]].ino)]].nlink = 0 ∧ fs[ri[dentrykey(ino1, str)]].ino ≠ ROOT_INO

Rule argument

pos: right 1 terms: ENOSPC abort: F discard: T computed: T

Additional information

Used terms: ENOSPC