Start: l0
Program_Vars: X₀, X₁
Temp_Vars: C, D, E
Locations: l0, l1
Transitions:
t₂: l0(X₀, X₁) → l1(X₀, X₁)
t₀: l1(X₀, X₁) → l1(D, X₁) :|: 0 ≤ X₀ ∧ 0 ≤ X₁ ∧ X₀+1 ≤ X₁ ∧ 2⋅C ≤ X₀+X₁ ∧ X₀+X₁+1 ≤ 3⋅C ∧ C+1 ≤ D ∧ 2⋅E ≤ X₀+X₁ ∧ X₀+X₁+1 ≤ 3⋅E ∧ D ≤ E+1
t₁: l1(X₀, X₁) → l1(X₀, D) :|: 0 ≤ X₀ ∧ 0 ≤ X₁ ∧ X₀+1 ≤ X₁ ∧ 2⋅C ≤ X₀+X₁ ∧ X₀+X₁+1 ≤ 3⋅C ∧ C ≤ D ∧ 2⋅E ≤ X₀+X₁ ∧ X₀+X₁+1 ≤ 3⋅E ∧ D ≤ E
Start: l0
Program_Vars: X₀, X₁
Temp_Vars: C, D, E
Locations: l0, l1
Transitions:
t₂: l0(X₀, X₁) → l1(X₀, X₁)
t₀: l1(X₀, X₁) → l1(D, X₁) :|: 0 ≤ X₀ ∧ 0 ≤ X₁ ∧ X₀+1 ≤ X₁ ∧ 2⋅C ≤ X₀+X₁ ∧ X₀+X₁+1 ≤ 3⋅C ∧ C+1 ≤ D ∧ 2⋅E ≤ X₀+X₁ ∧ X₀+X₁+1 ≤ 3⋅E ∧ D ≤ E+1
t₁: l1(X₀, X₁) → l1(X₀, D) :|: 0 ≤ X₀ ∧ 0 ≤ X₁ ∧ X₀+1 ≤ X₁ ∧ 2⋅C ≤ X₀+X₁ ∧ X₀+X₁+1 ≤ 3⋅C ∧ C ≤ D ∧ 2⋅E ≤ X₀+X₁ ∧ X₀+X₁+1 ≤ 3⋅E ∧ D ≤ E
Found invariant 1 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 2 ≤ X₀ for location n_l1___4
Found invariant 4 ≤ X₁ ∧ 8 ≤ X₀+X₁ ∧ 4 ≤ X₀ for location n_l1___2
Found invariant 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 0 ≤ X₀ for location n_l1___3
Found invariant 2 ≤ X₁ ∧ 4 ≤ X₀+X₁ ∧ 2 ≤ X₀ for location n_l1___1
Overall timebound:inf {Infinity}
t₂: 1 {O(1)}
t₀: inf {Infinity}
t₁: inf {Infinity}
Overall costbound: inf {Infinity}
t₂: 1 {O(1)}
t₀: inf {Infinity}
t₁: inf {Infinity}
t₂, X₀: X₀ {O(n)}
t₂, X₁: X₁ {O(n)}
t₀, X₁: 2⋅X₁ {O(n)}
t₁, X₁: 2⋅X₁ {O(n)}