Initial Problem

Start: l0
Program_Vars: X₀, X₁, X₂
Temp_Vars:
Locations: l0, l1, l2, l3, l4, l5
Transitions:
t₀: l0(X₀, X₁, X₂) → l3(X₀, X₁, X₂)
t₅: l1(X₀, X₁, X₂) → l4(X₀-1, X₂, X₁+1)
t₆: l2(X₀, X₁, X₂) → l5(X₀, X₁, X₂)
t₁: l3(X₀, X₁, X₂) → l4(X₁, X₀, X₂)
t₂: l4(X₀, X₁, X₂) → l1(X₀, X₁, X₂) :|: X₁ ≤ 100 ∧ X₂ ≤ X₀
t₃: l4(X₀, X₁, X₂) → l2(X₀, X₁, X₂) :|: 101 ≤ X₁
t₄: l4(X₀, X₁, X₂) → l2(X₀, X₁, X₂) :|: X₀+1 ≤ X₂

Preprocessing

Found invariant X₂ ≤ X₀ ∧ X₁ ≤ 100 for location l1

Problem after Preprocessing

Start: l0
Program_Vars: X₀, X₁, X₂
Temp_Vars:
Locations: l0, l1, l2, l3, l4, l5
Transitions:
t₀: l0(X₀, X₁, X₂) → l3(X₀, X₁, X₂)
t₅: l1(X₀, X₁, X₂) → l4(X₀-1, X₂, X₁+1) :|: X₂ ≤ X₀ ∧ X₁ ≤ 100
t₆: l2(X₀, X₁, X₂) → l5(X₀, X₁, X₂)
t₁: l3(X₀, X₁, X₂) → l4(X₁, X₀, X₂)
t₂: l4(X₀, X₁, X₂) → l1(X₀, X₁, X₂) :|: X₁ ≤ 100 ∧ X₂ ≤ X₀
t₃: l4(X₀, X₁, X₂) → l2(X₀, X₁, X₂) :|: 101 ≤ X₁
t₄: l4(X₀, X₁, X₂) → l2(X₀, X₁, X₂) :|: X₀+1 ≤ X₂

Analysing control-flow refined program

Found invariant X₂ ≤ 101 ∧ X₁ ≤ 1+X₀ for location n_l4___2

Found invariant X₂ ≤ X₀ ∧ X₁ ≤ 100 for location n_l1___3

Found invariant X₂ ≤ 101 ∧ X₁+X₂ ≤ 201 ∧ X₂ ≤ X₀ ∧ X₁ ≤ 100 ∧ X₁ ≤ 1+X₀ for location n_l1___1

CFR did not improve the program. Rolling back

All Bounds

Timebounds

Overall timebound:inf {Infinity}
t₀: 1 {O(1)}
t₅: inf {Infinity}
t₆: 1 {O(1)}
t₁: 1 {O(1)}
t₂: inf {Infinity}
t₃: 1 {O(1)}
t₄: 1 {O(1)}

Costbounds

Overall costbound: inf {Infinity}
t₀: 1 {O(1)}
t₅: inf {Infinity}
t₆: 1 {O(1)}
t₁: 1 {O(1)}
t₂: inf {Infinity}
t₃: 1 {O(1)}
t₄: 1 {O(1)}

Sizebounds

t₀, X₀: X₀ {O(n)}
t₀, X₁: X₁ {O(n)}
t₀, X₂: X₂ {O(n)}
t₁, X₀: X₁ {O(n)}
t₁, X₁: X₀ {O(n)}
t₁, X₂: X₂ {O(n)}