Start: l0
Program_Vars: X₀, X₁, X₂
Temp_Vars: D
Locations: l0, l1, l2
Transitions:
t₁: l0(X₀, X₁, X₂) → l1(X₀, X₁, X₂) :|: 1 ≤ X₁
t₃: l0(X₀, X₁, X₂) → l2(X₀, X₁, D) :|: X₁ ≤ 0
t₀: l1(X₀, X₁, X₂) → l1(X₀-X₁, 1+X₁, X₂) :|: 1 ≤ X₀
t₂: l1(X₀, X₁, X₂) → l2(X₀, X₁, D) :|: X₀ ≤ 0
Eliminate variables {D,X₂} that do not contribute to the problem
Found invariant 1 ≤ X₁ for location l1
Start: l0
Program_Vars: X₀, X₁
Temp_Vars:
Locations: l0, l1, l2
Transitions:
t₈: l0(X₀, X₁) → l1(X₀, X₁) :|: 1 ≤ X₁
t₉: l0(X₀, X₁) → l2(X₀, X₁) :|: X₁ ≤ 0
t₁₀: l1(X₀, X₁) → l1(X₀-X₁, 1+X₁) :|: 1 ≤ X₀ ∧ 1 ≤ X₁
t₁₁: l1(X₀, X₁) → l2(X₀, X₁) :|: X₀ ≤ 0 ∧ 1 ≤ X₁
Found invariant 1 ≤ X₁ for location l1
Termination: true
Formula:
relevant size-bounds w.r.t. t₈:
X₀: X₀ {O(n)}
Runtime-bound of t₈: 1 {O(1)}
Results in: 4⋅X₀+7 {O(n)}
Overall timebound:4⋅X₀+10 {O(n)}
t₈: 1 {O(1)}
t₉: 1 {O(1)}
t₁₀: 4⋅X₀+7 {O(n)}
t₁₁: 1 {O(1)}
Overall costbound: 4⋅X₀+10 {O(n)}
t₈: 1 {O(1)}
t₉: 1 {O(1)}
t₁₀: 4⋅X₀+7 {O(n)}
t₁₁: 1 {O(1)}
t₈, X₀: X₀ {O(n)}
t₈, X₁: X₁ {O(n)}
t₉, X₀: X₀ {O(n)}
t₉, X₁: X₁ {O(n)}
t₁₀, X₀: 2⋅X₁+5⋅X₀+7 {O(n)}
t₁₀, X₁: 4⋅X₀+X₁+7 {O(n)}
t₁₁, X₀: 2⋅X₁+6⋅X₀+7 {O(n)}
t₁₁, X₁: 2⋅X₁+4⋅X₀+7 {O(n)}