[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 215 from proof refine-rename-file-dentry (previous step)

# links(entries1[str], cache_dirs) = m19 + 1, (m3 = m15 ⊃ mkdir(m5, md0, m9, m11, entries2[str, entries[str0]]);mkdir(m5, md8, m9, m11, entries2[str, entries[str0]])) = mkdir(m10, md1, m14, m20, entries0), (m3 = m15 ⊃ mkdir(m1, md6, # links(m15, cache_dirs), m6, entries -- str0);mkdir(m0, md9, # links(m3, cache_dirs), m7, entries1)) = mkdir(m5, md8, m9, m11, entries2), (m15 = m3 ⊃ mkdir(m5, md10, m9, m11, entries2[str, entries[str0]]);mkdir(m1, md0, # links(m15, cache_dirs), m6, entries -- str0)) = mkdir(m, md, m16, m17, entries3), cache_files[entries[str0]] = mkfile(m4, md5, # links(entries[str0], cache_dirs), content2), cache_dirs[m3] = mkdir(m0, md9, # links(m3, cache_dirs), m7, entries1), ((cache_files ⊕ cache_pcache) ⊕ cache_icache)[entries[str0]] = mkfile(m8, md4, # links(entries[str0], cache_dirs), content0), ((cache_files ⊕ cache_pcache) ⊕ cache_icache)[entries1[str]] = mkfile(m12, md3, m19 + 1, content), cache_dirs[m15] = mkdir(m1 + 1, md6, # links(m15, cache_dirs), m6, entries), cache_files[entries1[str]] = mkfile(m2, md7, m19 + 1, content1), afs_files = (cache_files ⊕ cache_pcache) ⊕ cache_icache, cache_dirs0 = cache_dirs, new_child_inode0 = mkinode(entries1[str], md11, false, m19 + 1, 0, m18), new_dent0 = mkdentry(str, entries1[str]), new_parent_inode0 = mkinode(m3, md10, true, # links(m3, cache_dirs), m7, m0), old_child_inode0 = mkinode(entries[str0], md2, false, # links(entries[str0], cache_dirs), 0, m13), old_dent0 = mkdentry(str0, entries[str0]), old_parent_inode0 = mkinode(m15, md0, true, # links(m15, cache_dirs), m6, m1 + 1), afs-cons(cache_dirs, cache_files), afs-cons(cache_dirs, (cache_files ⊕ cache_pcache) ⊕ cache_icache), afs-cons (cache_dirs [m15, (m15 = m3 ⊃ mkdir(m5, md8, m9, m11, entries2[str, entries[str0]]);mkdir(m1, md6, # links(m15, cache_dirs), m6, entries -- str0)).meta:= md0 ] [m3, mkdir(m10, md10, m14, m20, entries0) ], cache_files[entries1[str], mkfile(m18, md11, m19, content1)]), dcache-cons ((cache_dcache -- dentrykey(m15, str0))[dentrykey(m3, str), mkdentry(str, entries[str0])], cache_dirs [m15, (m15 = m3 ⊃ mkdir(m5, md8, m9, m11, entries2[str, entries[str0]]);mkdir(m1, md6, # links(m15, cache_dirs), m6, entries -- str0)).meta:= md0 ] [m3, mkdir(m10, md10, m14, m20, entries0) ], cache_files[entries1[str], mkfile(m18, md11, m19, content1)]), dcache-cons(cache_dcache, cache_dirs, cache_files), icache-cons (cache_icache[m15, mkientry(false, mkinode(m15, md, true, m16, m17, m))][m3, mkientry(false, mkinode(m3, md10, true, m14, m20, m10))] [entries1[str], mkientry(false, mkinode(entries1[str], md11, false, m19, 0, m18)) ], cache_dirs [m15, (m15 = m3 ⊃ mkdir(m5, md8, m9, m11, entries2[str, entries[str0]]);mkdir(m1, md6, # links(m15, cache_dirs), m6, entries -- str0)).meta:= md0 ] [m3, mkdir(m10, md10, m14, m20, entries0) ], cache_files[entries1[str], mkfile(m18, md11, m19, content1)]), icache-cons(cache_icache, cache_dirs, cache_files), pcache-cons (cache_pcache, cache_dirs [m15, (m15 = m3 ⊃ mkdir(m5, md8, m9, m11, entries2[str, entries[str0]]);mkdir(m1, md6, # links(m15, cache_dirs), m6, entries -- str0)).meta:= md0 ] [m3, mkdir(m10, md10, m14, m20, entries0) ], cache_files[entries1[str], mkfile(m18, md11, m19, content1)]), pcache-cons(cache_pcache, cache_dirs, cache_files), synced (cache_dirs [m15, (m15 = m3 ⊃ mkdir(m5, md8, m9, m11, entries2[str, entries[str0]]);mkdir(m1, md6, # links(m15, cache_dirs), m6, entries -- str0)).meta:= md0 ] [m3, mkdir(m10, md10, m14, m20, entries0) ], cache_icache[m15, mkientry(false, mkinode(m15, md, true, m16, m17, m))][m3, mkientry(false, mkinode(m3, md10, true, m14, m20, m10))] [entries1[str], mkientry(false, mkinode(entries1[str], md11, false, m19, 0, m18)) ], cache_pcache), synced(cache_dirs, cache_icache, cache_pcache), str ∈ entries1, m3 ∈ cache_dirs, entries[str0] ∈ cache_files, m15 ∈ cache_dirs, entries1[str] ∈ cache_files, str0 ∈ entries, ¬ entries[str0] ∈ cache_dirs, ¬ entries1[str] ∈ cache_dirs, cache_sync → synced (cache_files[entries1[str], mkfile(m18, md11, m19, content1)], cache_icache[m15, mkientry(false, mkinode(m15, md, true, m16, m17, m))][m3, mkientry(false, mkinode(m3, md10, true, m14, m20, m10))] [entries1[str], mkientry(false, mkinode(entries1[str], md11, false, m19, 0, m18)) ], cache_pcache), cache_sync → synced(cache_files, cache_icache, cache_pcache), m3 = m15 → md10 = md0, links(m3, cache_dirs) ≠ ∅ ∨ m3 = ROOT_INO, links(m15, cache_dirs) ≠ ∅ ∨ m15 = ROOT_INO ⊦ ⟨afs_rename# (; old_parent_inode0, new_parent_inode0, old_child_inode0, new_child_inode0, old_dent0, new_dent0, err0, cache_dirs, afs_files; afs_asynced)⟩ ( (m15 ∈ cache_dirs0 ⊃ mkinode (m15, (m15 = m3 ⊃ mkdir(m5, md10, m9, m11, entries2[str, entries[str0]]);mkdir(m1, md0, # links(m15, cache_dirs0), m6, entries -- str0)) .meta, true, (m15 = m3 ⊃ mkdir(m5, md10, m9, m11, entries2[str, entries[str0]]);mkdir(m1, md0, # links(m15, cache_dirs0), m6, entries -- str0)) .nlink, (m15 = m3 ⊃ mkdir(m5, md10, m9, m11, entries2[str, entries[str0]]);mkdir(m1, md0, # links(m15, cache_dirs0), m6, entries -- str0)) .nsubdirs, (m15 = m3 ⊃ mkdir(m5, md10, m9, m11, entries2[str, entries[str0]]);mkdir(m1, md0, # links(m15, cache_dirs0), m6, entries -- str0)) .size) ;mkinode (m15, (m15 = entries1[str] ⊃ mkfile(m18, md11, m19, content1);cache_files[m15]).meta, false, (m15 = entries1[str] ⊃ mkfile(m18, md11, m19, content1);cache_files[m15]).nlink, 0, (m15 = entries1[str] ⊃ mkfile(m18, md11, m19, content1);cache_files[m15]).size) ) = old_parent_inode0 ∧ (m3 ∈ cache_dirs0 ⊃ mkinode(m3, md10, true, m14, m20, m10) ;mkinode (m3, (m3 = entries1[str] ⊃ mkfile(m18, md11, m19, content1);cache_files[m3]).meta, false, (m3 = entries1[str] ⊃ mkfile(m18, md11, m19, content1);cache_files[m3]).nlink, 0, (m3 = entries1[str] ⊃ mkfile(m18, md11, m19, content1);cache_files[m3]).size) ) = new_parent_inode0 ∧ mkinode(entries[str0], md2, false, # links(entries[str0], cache_dirs0), 0, m13) = old_child_inode0 ∧ (entries1[str] ∈ cache_dirs0 ⊃ mkinode (entries1[str], (entries1[str] = m3 ⊃ (entries1[str] = m15 ⊃ mkdir(m5, md0, m9, m11, entries2[str, entries[str0]]) ;mkdir(m5, md8, m9, m11, entries2[str, entries[str0]]) ) .meta:= md10 ;(entries1[str] = m15 ⊃ mkdir(m1, md0, # links(entries1[str], cache_dirs0), m6, entries -- str0);cache_dirs0[entries1[str]]) ) .meta, true, (entries1[str] = m3 ⊃ (entries1[str] = m15 ⊃ mkdir(m5, md0, m9, m11, entries2[str, entries[str0]]) ;mkdir(m5, md8, m9, m11, entries2[str, entries[str0]]) ) .meta:= md10 ;(entries1[str] = m15 ⊃ mkdir(m1, md0, # links(entries1[str], cache_dirs0), m6, entries -- str0);cache_dirs0[entries1[str]]) ) .nlink, (entries1[str] = m3 ⊃ (entries1[str] = m15 ⊃ mkdir(m5, md0, m9, m11, entries2[str, entries[str0]]) ;mkdir(m5, md8, m9, m11, entries2[str, entries[str0]]) ) .meta:= md10 ;(entries1[str] = m15 ⊃ mkdir(m1, md0, # links(entries1[str], cache_dirs0), m6, entries -- str0);cache_dirs0[entries1[str]]) ) .nsubdirs, (entries1[str] = m3 ⊃ (entries1[str] = m15 ⊃ mkdir(m5, md0, m9, m11, entries2[str, entries[str0]]) ;mkdir(m5, md8, m9, m11, entries2[str, entries[str0]]) ) .meta:= md10 ;(entries1[str] = m15 ⊃ mkdir(m1, md0, # links(entries1[str], cache_dirs0), m6, entries -- str0);cache_dirs0[entries1[str]]) ) .size) ;mkinode(entries1[str], md11, false, m19, 0, m18) ) = new_child_inode0 ∧ negdentry(str0) = old_dent0 ∧ mkdentry(str, entries[str0]) = new_dent0 ∧ ESUCCESS = err0 ∧ cache_dirs = cache_dirs0 [m15, (m15 = m3 ⊃ mkdir(m5, md8, m9, m11, entries2[str, entries[str0]]) ;mkdir(m1, md6, # links(m15, cache_dirs0), m6, entries -- str0) ) .meta:= md0 ] [m3, (m3 = m15 ⊃ mkdir(m5, md0, m9, m11, entries2[str, entries[str0]]);mkdir(m5, md8, m9, m11, entries2[str, entries[str0]])).meta:= md10 ] ∧ afs_files = (cache_files[entries1[str], mkfile(m18, md11, m19, content1)] ⊕ cache_pcache) ⊕ cache_icache[m15, mkientry(false, mkinode(m15, md, true, m16, m17, m))][m3, mkientry(false, mkinode(m3, md10, true, m14, m20, m10))] [entries1[str], mkientry(false, mkinode(entries1[str], md11, false, m19, 0, m18)) ] ∧ (afs_asynced ↔ asynced0)), m15 = m3 ∧ mkdentry(str, entries1[str]) = mkdentry(str0, entries[str0])

Heuristic unfold applied rule call right

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Used simplifier rules: afs_rename# (; OLD_PARENT_INODE, NEW_PARENT_INODE, OLD_CHILD_INODE, NEW_CHILD_INODE, OLD_DENT, NEW_DENT, ERR, DIRS, FILES ; ASYNCED ) {if pre-rename (OLD_PARENT_INODE, OLD_DENT, OLD_CHILD_INODE, NEW_PARENT_INODE, NEW_DENT, NEW_CHILD_INODE, DIRS, FILES) then { let OLD_INO = OLD_PARENT_INODE.ino, NEW_INO = NEW_PARENT_INODE.ino, OVERWRITE = NEW_DENT.dentry? in let IDENTITY = OLD_INO = NEW_INO ∧ NEW_DENT = OLD_DENT in {DIRS[OLD_INO].entries := DIRS[OLD_INO].entries -- OLD_DENT.name; if ¬ IDENTITY then {DIRS[OLD_INO].size := DIRS[OLD_INO].size - 1; if OLD_DENT.ino ∈ DIRS then DIRS[OLD_INO].nsubdirs := DIRS[OLD_INO].nsubdirs - 1}; DIRS[NEW_INO].entries[NEW_DENT.name] := OLD_DENT.ino; if OVERWRITE ∧ ¬ IDENTITY then let INO = NEW_DENT.ino in afs_drop_nlink#(INO; DIRS, FILES); if ¬ OVERWRITE then {DIRS[NEW_INO].size := DIRS[NEW_INO].size + 1; if OLD_DENT.ino ∈ DIRS then DIRS[NEW_INO].nsubdirs := DIRS[NEW_INO].nsubdirs + 1}; 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 OVERWRITE 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} or fail#(; ; ERR); ASYNCED := ?} else abort };