[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 46 from proof test (previous step)

buf = mk(mkarray(2)[0, a][1, b], 2, 0, 2) ⊦ ⟪get#(buf .first, buf .data; a1)⟫ ⟪buf0 := buf .first:= ((buf .first + 1) % buf .size) ; buf0 := buf0 .len:= (buf0 .len - 1)⟫ ⟪assert#(a1 = a) ; push#(c; buf0) ; pop#(; buf0, a1) ; assert#(a1 = b) ; pop#(; buf0, a1) ; assert#(a1 = c)⟫ true

Heuristic weak unfold applied rule call right

And obtained the following new goals

Proof step 45:
buf = mk(mkarray(2)[0, a][1, b], 2, 0, 2) ⊦ ⟪a0 := a1, ar := buf .data, i := buf .first⟫ ⟪if 0 ≤ i ∧ i < n→i(# ar) then a0 := ar[i→n(i)] else abort⟫ ⟪buf0 := buf .first:= ((buf .first + 1) % buf .size) ; buf0 := buf0 .len:= (buf0 .len - 1)⟫ ⟪assert#(a0 = a) ; push#(c; buf0) ; pop#(; buf0, a0) ; assert#(a0 = b) ; pop#(; buf0, a0) ; assert#(a0 = c)⟫ true

Rule argument

[fmapos-arg: pos: right 1]

Additional information

[[CONCRETESIMPRULES : ([CSIMPDECL : get# (i, ar; a) { if 0 ≤ i ∧ i < n→i(# ar) then a := ar[i→n(i)] else abort }])]]