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

isdir ↔ old_ino = new_ino ∧ new_dent = old_dent, isdir0 ↔ new_dent.dentry?, dirs0[entries[str]] = mkdir(m0, md1, # links(entries[str], dirs0), m3, entries1), dirs0[ino1] = mkdir(m2, md, # links(ino1, dirs0), m5, entries), dirs0[ino] = mkdir(m, md2, # links(ino, dirs0), m1, entries2), dirs = dirs4[new_ino, dirs4[new_ino].nsubdirs:= (dirs4[new_ino].nsubdirs + 1)], dirs1 = dirs0[old_ino, dirs0[old_ino].entries:= (dirs0[old_ino].entries -- old_dent.name)], dirs2 = dirs1[old_ino, dirs1[old_ino].size:= (dirs1[old_ino].size - 1)], dirs3 = dirs2[new_ino, dirs2[new_ino].entries:= dirs2[new_ino].entries[new_dent.name, old_dent.ino]], dirs4 = dirs3[new_ino, dirs3[new_ino].size:= (dirs3[new_ino].size + 1)], err = ESUCCESS, ¬ isdir, ¬ isdir0, new_child_inode = new_dent_inode, new_dent = negdentry(str0), new_dent_inode = mkinode(entries[str], md1, true, # links(entries[str], dirs0), m3, m0), new_ino = new_parent_inode.ino, new_inode = mkinode(ino, md2, true, # links(ino, dirs0), m1, m), new_parent_inode = new_inode, old_child_inode = old_dent_inode, old_dent = mkdentry(str, entries[str]), old_dent_inode = mkinode(entries[str], md1, true, # links(entries[str], dirs0), m3, m0), old_ino = old_parent_inode.ino, old_inode = mkinode(ino1, md, true, # links(ino1, dirs0), m5, m2), old_parent_inode = old_inode, old_dent.dentry?, dom of < ino2, afs-cons(dirs0, files), ispath(q, ROOT_INO, ino1, dirs0, files), ispath(q0, ROOT_INO, ino, dirs0, files), of-cons(of, dirs0, files), pre-rename(old_parent_inode, old_dent, old_child_inode, new_parent_inode, new_dent, new_child_inode, dirs0, files), pw(user, md), pw(user, md1), pw(user, md2), px(user, md), px(user, md2), px-parent(user, q, ROOT_INO, dirs0, files), px-parent(user, q0, ROOT_INO, dirs0, files), ino ∈ dirs0, ino1 ∈ dirs0, entries[str] ∈ dirs0, str ∈ entries, old_dent.ino ∈ dirs4, dirs1[old_ino].size ≥ 1, ino = ino1 → md2 = md, links(ino1, dirs0) ≠ ∅ ∨ ino1 = ROOT_INO, links(ino, dirs0) ≠ ∅ ∨ ino = ROOT_INO ⊦ [new_dent := mkdentry(new_dent.name, old_dent.ino); old_dent := negdentry(old_dent.name); afs_inode_sync#(old_parent_inode; dirs, files); afs_inode_sync#(new_parent_inode; dirs, files); if isdir0 then {afs_inode_sync#(new_child_inode; dirs, files); new_child_inode := getinode(new_child_inode.ino, dirs, files)}; old_parent_inode := getinode(old_parent_inode.ino, dirs, files); new_parent_inode := getinode(new_parent_inode.ino, dirs, files); err := ESUCCESS; asynced := ?] (afs-cons(dirs, files) → ⟪skip⟫ of-cons(of, dirs, files)), entries[str] = ROOT_INO, str0 ∈ entries2, old_dent.ino ∈ dirs2, q + str ' ⊑ q0 + str0 ', isdir0 ∧ ¬ isdir

Heuristic symbolic execution applied rule assign right

And closed the goal!

Rule argument

Additional information

Used simplifier rules: ⊦ mkinode(m, md, boolvar, m0, m1, m2).ino = m; (s)% ⊦ mkdentry(str, m).name = str; (s)% ⊦ dirs[ino, ad][ino0] = (ino0 = ino ∧ ino ∈ dirs ⊃ ad;dirs[ino0]); (s)% ⊦ (ad.entries:= entries).size = ad.size; (s)% ⊦ dirs[ino, ad][ino, ad0] = dirs[ino, ad0]; (s)% ⊦ negdentry(str).name = str; (s)% ⊦ mkdentry(str, m).ino = m; (s)% ⊦ ino ∈ dirs[ino0, ad] ↔ ino ∈ dirs; (s)% ⊦ (ad.size:= m).nsubdirs = ad.nsubdirs; (s)% ⊦ (ad.entries:= entries).nsubdirs = ad.nsubdirs; (s)% ⊦ mkdentry(str, m) ≠ negdentry(str0); (s)% ⊦ ¬ negdentry(str).dentry?; (s)% ⊦ n ≥ m ↔ m ≤ n; (s)%⊦ pre-rename (old_parent_inode, old_dent, old_child_inode, new_parent_inode, new_dent, new_child_inode, dirs, files) ↔ ( valid-negdentry(new_parent_inode.ino, new_dent, dirs, files) ∨ valid-dentry(new_parent_inode.ino, new_dent, dirs, files) ∧ valid-wb-inode(new_child_inode, dirs, files) ∧ new_child_inode.ino = new_dent.ino ∧ ( valid-file-ino(new_dent.ino, dirs, files) ↔ valid-file-ino(old_dent.ino, dirs, files)) ∧ ( valid-dir-ino(new_dent.ino, dirs, files) → new_dent.ino ≠ ROOT_INO ∧ dir-empty(new_dent.ino, dirs, files))) ∧ valid-dentry(old_parent_inode.ino, old_dent, dirs, files) ∧ valid-dir-inode(old_parent_inode, dirs, files) ∧ valid-dir-inode(new_parent_inode, dirs, files) ∧ ( new_parent_inode.ino = old_parent_inode.ino → new_parent_inode.meta = old_parent_inode.meta) ∧ valid-wb-inode(old_child_inode, dirs, files) ∧ old_child_inode.ino = old_dent.ino; (s)%⊦ valid-negdentry(ino, dent, dirs, files) ↔ valid-parent-ino(ino, dirs, files) ∧ ¬ dent.name ∈ dirs[ino].entries ∧ dent.negdentry?; (s)%⊦ valid-parent-ino(ino, dirs, files) ↔ ino ∈ dirs ∧ (links(ino, dirs) ≠ ∅ ∨ ino = ROOT_INO); (s)% ⊦ negdentry(str).negdentry?; (s)%⊦ valid-dentry(ino, dent, dirs, files) ↔ valid-parent-ino(ino, dirs, files) ∧ valid-ino(dent.ino, dirs, files) ∧ dent.name ∈ dirs[ino].entries ∧ dent.ino = dirs[ino].entries[dent.name] ∧ dent.dentry?; (s)% ⊦ valid-ino(ino, dirs, files) ↔ ino ∈ dirs ∨ ino ∈ files; (s)% ⊦ mkdentry(str, m).dentry?; (s)%⊦ valid-dir-inode(inode, dirs, files) ↔ valid-dir-ino(inode.ino, dirs, files) ∧ inode.nlink = dirs[inode.ino].nlink ∧ inode.size = dirs[inode.ino].size ∧ inode.nsubdirs = dirs[inode.ino].nsubdirs ∧ inode.directory; (s)% ⊦ valid-dir-ino(ino, dirs, files) ↔ ino ∈ dirs; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).nlink = m0; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).size = m2; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).nsubdirs = m1; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).directory ↔ boolvar; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).meta = md; (s)%⊦ valid-wb-inode(inode, dirs, files) ↔ valid-dir-inode(inode, dirs, files) ∨ valid-file-inode(inode, dirs, files); (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)% ⊦ valid-file-ino(ino, dirs, files) ↔ ino ∈ files; (s)% ⊦ afs-cons(dirs, files) ∧ ino ∈ dirs → ¬ ino ∈ files; (s)