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

1 = fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].nlink, abs-children(fs[ri[dentrykey(m, str)]].ino, fs, ri) = ∅, dentrykeys(inodekey(fs[ri[dentrykey(m, str)]].ino), ri) = ∅, ino = mkdentry(str, fs[ri[dentrykey(m, str)]].ino).ino, links(fs[ri[dentrykey(m, str)]].ino, fs, ri) = ∅ ++ dentrykey(m, str), p_ino = mkinode(m, md, true, fs[ri[inodekey(m)]].nlink, fs[ri[inodekey(m)]].nsubdirs, fs[ri[inodekey(m)]].size).ino, mkdentry(str, fs[ri[dentrykey(m, str)]].ino).dentry?, fs[ri[dentrykey(m, str)]].dentry?, fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].directory, fs[ri[inodekey(m)]].directory, fs[ri[inodekey(m)]].inode?, 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), ri[inodekey(m)] ∈ fs, inodekey(m) ∈ ri, inodekey(fs[ri[dentrykey(m, str)]].ino) ∈ ri, dentrykey(m, str) ∈ ri, ri[dentrykey(m, str)] ∈ fs, 1 ≤ fs[ri[inodekey(m)]].nsubdirs, 1 ≤ fs[ri[inodekey(m)]].size, abs-dirs(fs, ri)[p_ino, abs-dirs(fs, ri)[p_ino].entries:= (abs-dirs(fs, ri)[p_ino].entries -- mkdentry(str, fs[ri[dentrykey(m, str)]].ino).name)] [p_ino ] .size ≥ 1, abs-dirs(fs, ri)[p_ino, abs-dirs(fs, ri)[p_ino].entries:= (abs-dirs(fs, ri)[p_ino].entries -- mkdentry(str, fs[ri[dentrykey(m, str)]].ino).name)] [p_ino, abs-dirs(fs, ri) [p_ino, abs-dirs(fs, ri)[p_ino].entries:= (abs-dirs(fs, ri)[p_ino].entries -- mkdentry(str, fs[ri[dentrykey(m, str)]].ino).name) ] [p_ino ] .size:= ( abs-dirs(fs, ri) [p_ino, abs-dirs(fs, ri)[p_ino].entries:= (abs-dirs(fs, ri)[p_ino].entries -- mkdentry(str, fs[ri[dentrykey(m, str)]].ino).name) ] [p_ino ] .size - 1) ] [p_ino ] .nsubdirs ≥ 1, asynced → boolvar0, ∀ adr, adr0, adr1. adr ∈ fs ∨ adr0 ∈ fs ∨ adr1 ∈ fs ∨ adr = adr0 ∨ adr = adr1 ∨ adr0 = adr1, fs[ri[inodekey(m)]].trunc? ∨ fs[ri[inodekey(m)]].inode?, links(m, abs-dirs(fs, ri)) ≠ ∅ ∨ m = ROOT_INO, fs[ri[inodekey(m)]].nlink ≠ 0 ∨ m = ROOT_INO ⊦ ⟨files := abs-files(fs, ri); dirs := abs-dirs(fs, ri) [p_ino, abs-dirs(fs, ri)[p_ino].entries:= (abs-dirs(fs, ri)[p_ino].entries -- mkdentry(str, fs[ri[dentrykey(m, str)]].ino).name) ] [p_ino, abs-dirs(fs, ri) [p_ino, abs-dirs(fs, ri)[p_ino].entries:= (abs-dirs(fs, ri)[p_ino].entries -- mkdentry(str, fs[ri[dentrykey(m, str)]].ino).name) ] [p_ino ] .size:= ( abs-dirs(fs, ri) [p_ino, abs-dirs(fs, ri)[p_ino].entries:= (abs-dirs(fs, ri)[p_ino].entries -- mkdentry(str, fs[ri[dentrykey(m, str)]].ino).name) ] [p_ino ] .size - 1) ] [p_ino, abs-dirs(fs, ri) [p_ino, abs-dirs(fs, ri)[p_ino].entries:= (abs-dirs(fs, ri)[p_ino].entries -- mkdentry(str, fs[ri[dentrykey(m, str)]].ino).name) ] [p_ino, abs-dirs(fs, ri) [p_ino, abs-dirs(fs, ri)[p_ino].entries:= (abs-dirs(fs, ri)[p_ino].entries -- mkdentry(str, fs[ri[dentrykey(m, str)]].ino).name) ] [p_ino ] .size:= ( abs-dirs(fs, ri) [p_ino, abs-dirs(fs, ri)[p_ino] .entries:= (abs-dirs(fs, ri)[p_ino].entries -- mkdentry(str, fs[ri[dentrykey(m, str)]].ino).name) ] [p_ino ] .size - 1) ] [p_ino ] .nsubdirs:= ( abs-dirs(fs, ri) [p_ino, abs-dirs(fs, ri)[p_ino].entries:= (abs-dirs(fs, ri)[p_ino].entries -- mkdentry(str, fs[ri[dentrykey(m, str)]].ino).name) ] [p_ino, abs-dirs(fs, ri) [p_ino, abs-dirs(fs, ri)[p_ino] .entries:= (abs-dirs(fs, ri)[p_ino].entries -- mkdentry(str, fs[ri[dentrykey(m, str)]].ino).name) ] [p_ino ] .size:= ( abs-dirs(fs, ri) [p_ino, abs-dirs(fs, ri)[p_ino] .entries:= (abs-dirs(fs, ri)[p_ino].entries -- mkdentry(str, fs[ri[dentrykey(m, str)]].ino).name) ] [p_ino ] .size - 1) ] [p_ino ] .nsubdirs - 1) ]; afs_drop_nlink#(ino; dirs, files); dent := negdentry(mkdentry(str, fs[ri[dentrykey(m, str)]].ino).name); afs_inode_sync#(mkinode(m, md, true, fs[ri[inodekey(m)]].nlink, fs[ri[inodekey(m)]].nsubdirs, fs[ri[inodekey(m)]].size); dirs, files); afs_inode_sync# (mkinode (fs[ri[dentrykey(m, str)]].ino, md0, true, 1, fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].nsubdirs, fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].size) ; dirs, files); p_inode := getinode(mkinode(m, md, true, fs[ri[inodekey(m)]].nlink, fs[ri[inodekey(m)]].nsubdirs, fs[ri[inodekey(m)]].size).ino, dirs, files); c_inode := getinode (mkinode (fs[ri[dentrykey(m, str)]].ino, md0, true, 1, fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].nsubdirs, fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].size) .ino, dirs, files); err := ESUCCESS; asynced := ?⟩ ( dirs = abs-dirs(fs, ri) ∧ files = abs-files(fs, ri) ∧ (asynced → boolvar) ∧ mkinode(m, md, true, fs[ri[inodekey(m)]].nlink, fs[ri[inodekey(m)]].nsubdirs, fs[ri[inodekey(m)]].size) = p_inode ∧ mkinode (fs[ri[dentrykey(m, str)]].ino, md0, true, 1, fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].nsubdirs, fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].size) = c_inode ∧ mkdentry(str, fs[ri[dentrykey(m, str)]].ino) = dent ∧ ENOSPC = err), ⟨fail#(; ; err); asynced := ?⟩ ((asynced → boolvar) ∧ ENOSPC = err), fs[ri[dentrykey(m, str)]].ino = 0, fs[ri[dentrykey(m, str)]].ino = ROOT_INO, fs[ri[inodekey(m)]].nsubdirs = 0, fs[ri[inodekey(m)]].size = 0, m = 0, fs[ri[inodekey(m)]].nlink = 0 ∧ m ≠ ROOT_INO

Heuristic symbolic execution applied rule assign right

And obtained the following new goals

Rule argument

Additional information