Start: l0
Program_Vars: X₀, X₁
Temp_Vars:
Locations: l0, l1, l2
Transitions:
t₀: l0(X₀, X₁) → l1(X₀, X₁)
t₁: l1(X₀, X₁) → l1(X₀-1, X₁+1) :|: 1 ≤ X₀
t₂: l1(X₀, X₁) → l2(X₀, X₁) :|: X₀ ≤ 0
t₃: l2(X₀, X₁) → l2(X₀, X₁-1) :|: 1 ≤ X₁
Found invariant X₀ ≤ 0 for location l2
Start: l0
Program_Vars: X₀, X₁
Temp_Vars:
Locations: l0, l1, l2
Transitions:
t₀: l0(X₀, X₁) → l1(X₀, X₁)
t₁: l1(X₀, X₁) → l1(X₀-1, X₁+1) :|: 1 ≤ X₀
t₂: l1(X₀, X₁) → l2(X₀, X₁) :|: X₀ ≤ 0
t₃: l2(X₀, X₁) → l2(X₀, X₁-1) :|: 1 ≤ X₁ ∧ X₀ ≤ 0
Found invariant X₀ ≤ 0 for location l2
Termination: true
Formula:
relevant size-bounds w.r.t. t₀:
X₀: X₀ {O(n)}
Runtime-bound of t₀: 1 {O(1)}
Results in: 2⋅X₀+4 {O(n)}
Found invariant X₀ ≤ 0 for location l2
Termination: true
Formula:
relevant size-bounds w.r.t. t₂:
X₁: 2⋅X₀+2⋅X₁+4 {O(n)}
Runtime-bound of t₂: 1 {O(1)}
Results in: 4⋅X₀+4⋅X₁+12 {O(n)}
Overall timebound:4⋅X₁+6⋅X₀+18 {O(n)}
t₀: 1 {O(1)}
t₁: 2⋅X₀+4 {O(n)}
t₂: 1 {O(1)}
t₃: 4⋅X₀+4⋅X₁+12 {O(n)}
Overall costbound: 4⋅X₁+6⋅X₀+18 {O(n)}
t₀: 1 {O(1)}
t₁: 2⋅X₀+4 {O(n)}
t₂: 1 {O(1)}
t₃: 4⋅X₀+4⋅X₁+12 {O(n)}
t₀, X₀: X₀ {O(n)}
t₀, X₁: X₁ {O(n)}
t₁, X₀: X₀ {O(n)}
t₁, X₁: 2⋅X₀+X₁+4 {O(n)}
t₂, X₀: 2⋅X₀ {O(n)}
t₂, X₁: 2⋅X₀+2⋅X₁+4 {O(n)}
t₃, X₀: 2⋅X₀ {O(n)}
t₃, X₁: 2⋅X₀+2⋅X₁+4 {O(n)}