Start: l0
Program_Vars: X₀, X₁, X₂
Temp_Vars:
Locations: l0, l1, l2, l3, l4, l5
Transitions:
t₀: l0(X₀, X₁, X₂) → l2(X₀, X₁, X₂)
t₂: l1(X₀, X₁, X₂) → l3(X₀, X₁, X₂) :|: 0 ≤ X₀
t₃: l1(X₀, X₁, X₂) → l4(X₀, X₁, X₂) :|: X₀ < 0
t₁: l2(X₀, X₁, X₂) → l1(1, X₁, X₂)
t₄: l3(X₀, X₁, X₂) → l1(2⋅X₀, X₁, X₂)
t₅: l4(X₀, X₁, X₂) → l5(X₀, X₁, X₂)
Eliminate variables {X₁,X₂} that do not contribute to the problem
Found invariant 1 ≤ 0 for location l5
Found invariant 1 ≤ X₀ for location l1
Found invariant 1 ≤ 0 for location l4
Found invariant 1 ≤ X₀ for location l3
Cut unsatisfiable transition t₁₄: l1→l4
Cut unsatisfiable transition t₁₇: l4→l5
Cut unreachable locations [l4; l5] from the program graph
Start: l0
Program_Vars: X₀
Temp_Vars:
Locations: l0, l1, l2, l3
Transitions:
t₁₂: l0(X₀) → l2(X₀)
t₁₃: l1(X₀) → l3(X₀) :|: 0 ≤ X₀ ∧ 1 ≤ X₀
t₁₅: l2(X₀) → l1(1)
t₁₆: l3(X₀) → l1(2⋅X₀) :|: 1 ≤ X₀
Found invariant 1 ≤ X₀ for location l1
Found invariant 1 ≤ X₀ for location l3
Found invariant X₀ ≤ 1 ∧ 1 ≤ X₀ for location n_l3___3
Found invariant 2 ≤ X₀ for location n_l1___2
Found invariant X₀ ≤ 1 ∧ 1 ≤ X₀ for location l1
Found invariant 2 ≤ X₀ for location n_l3___1
Found invariant X₀ ≤ 1 ∧ 1 ≤ X₀ for location n_l3___3
Found invariant 2 ≤ X₀ for location n_l1___2
Found invariant X₀ ≤ 1 ∧ 1 ≤ X₀ for location l1
Found invariant 2 ≤ X₀ for location n_l3___1
Overall timebound:inf {Infinity}
t₁₂: 1 {O(1)}
t₁₃: inf {Infinity}
t₁₅: 1 {O(1)}
t₁₆: inf {Infinity}
Overall costbound: inf {Infinity}
t₁₂: 1 {O(1)}
t₁₃: inf {Infinity}
t₁₅: 1 {O(1)}
t₁₆: inf {Infinity}
t₁₂, X₀: X₀ {O(n)}
t₁₅, X₀: 1 {O(1)}