Start: l0
Program_Vars: X₀, X₁, X₂, X₃
Temp_Vars: E, F
Locations: l0, l1, l2
Transitions:
t₀: l0(X₀, X₁, X₂, X₃) → l1(E, E, 0, X₃) :|: E ≤ 0
t₁: l0(X₀, X₁, X₂, X₃) → l1(E, E, 0, X₃) :|: 1024 ≤ E
t₂: l0(X₀, X₁, X₂, X₃) → l1(E, E, 0, F) :|: E ≤ 1023 ∧ 1 ≤ E
t₃: l1(X₀, X₁, X₂, X₃) → l1(X₀, X₁, X₂+1, X₃) :|: X₂+1 ≤ E
t₄: l1(X₀, X₁, X₂, X₃) → l2(X₀, X₁, X₂, X₃) :|: E ≤ X₂
Eliminate variables {F,X₀,X₁,X₃} that do not contribute to the problem
Found invariant 0 ≤ X₂ for location l2
Found invariant 0 ≤ X₂ for location l1
Start: l0
Program_Vars: X₂
Temp_Vars: E
Locations: l0, l1, l2
Transitions:
t₉: l0(X₂) → l1(0) :|: E ≤ 0
t₁₀: l0(X₂) → l1(0) :|: 1024 ≤ E
t₁₁: l0(X₂) → l1(0) :|: E ≤ 1023 ∧ 1 ≤ E
t₁₂: l1(X₂) → l1(X₂+1) :|: X₂+1 ≤ E ∧ 0 ≤ X₂
t₁₃: l1(X₂) → l2(X₂) :|: E ≤ X₂ ∧ 0 ≤ X₂
Found invariant 0 ≤ X₂ for location l2
Found invariant X₂ ≤ 0 ∧ 0 ≤ X₂ for location l1
Found invariant 1 ≤ X₂ for location n_l1___1
Overall timebound:inf {Infinity}
t₉: 1 {O(1)}
t₁₀: 1 {O(1)}
t₁₁: 1 {O(1)}
t₁₂: inf {Infinity}
t₁₃: 1 {O(1)}
Overall costbound: inf {Infinity}
t₉: 1 {O(1)}
t₁₀: 1 {O(1)}
t₁₁: 1 {O(1)}
t₁₂: inf {Infinity}
t₁₃: 1 {O(1)}
t₉, X₂: 0 {O(1)}
t₁₀, X₂: 0 {O(1)}
t₁₁, X₂: 0 {O(1)}