[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 118 from proof replayone-prog (previous step)

boolvar ↔ boolvar0, fs[adr] = datanode(datakey(ino, n), buf), key = fs[adr].key, ri = ri1[key, adr], ri0 = ri1, inodekey(ino) ∈ ri1, adr ∈ fs ⊦ ⟪if fs[adr].trunc? then aubifs_core_index_truncate#(fs[adr].key, fs[adr].size, fi, ro, fo, fs, log, boolvar0; ri)⟫ (ri = replay-one(adr, fs[adr], ri0)), adr ∈ ri1

Heuristic symbolic execution applied rule if negative right

And obtained the following new goals

Proof step 119:
boolvar ↔ boolvar0, fs[adr] = datanode(datakey(ino, n), buf), key = fs[adr].key, ri = ri1[key, adr], ri0 = ri1, adr ∈ fs, inodekey(ino) ∈ ri1 ⊦ ⟪skip⟫ (ri = replay-one(adr, fs[adr], ri0)), adr ∈ ri1

Rule argument

Additional information

Used simplifier rules: ⊦ ¬ datanode(key, buf).trunc?; (s)