Start: l0
Program_Vars: X₀, X₁, X₂, X₃
Temp_Vars:
Locations: l0, l1, l2, l3, l4, l5
Transitions:
t₀: l0(X₀, X₁, X₂, X₃) → l2(X₀, X₁, X₂, X₃)
t₂: l1(X₀, X₁, X₂, X₃) → l3(X₀, X₁, X₂, X₃) :|: 0 < X₀
t₃: l1(X₀, X₁, X₂, X₃) → l4(X₀, X₁, X₂, X₃) :|: X₀ ≤ 0
t₁: l2(X₀, X₁, X₂, X₃) → l1(X₂, X₃, X₂, X₃)
t₄: l3(X₀, X₁, X₂, X₃) → l1(X₀+X₁, -X₁-1, X₂, X₃)
t₅: l4(X₀, X₁, X₂, X₃) → l5(X₀, X₁, X₂, X₃)
Found invariant X₀ ≤ 0 for location l5
Found invariant X₀ ≤ 0 for location l4
Found invariant 1 ≤ X₀ for location l3
Start: l0
Program_Vars: X₀, X₁, X₂, X₃
Temp_Vars:
Locations: l0, l1, l2, l3, l4, l5
Transitions:
t₀: l0(X₀, X₁, X₂, X₃) → l2(X₀, X₁, X₂, X₃)
t₂: l1(X₀, X₁, X₂, X₃) → l3(X₀, X₁, X₂, X₃) :|: 0 < X₀
t₃: l1(X₀, X₁, X₂, X₃) → l4(X₀, X₁, X₂, X₃) :|: X₀ ≤ 0
t₁: l2(X₀, X₁, X₂, X₃) → l1(X₂, X₃, X₂, X₃)
t₄: l3(X₀, X₁, X₂, X₃) → l1(X₀+X₁, -X₁-1, X₂, X₃) :|: 1 ≤ X₀
t₅: l4(X₀, X₁, X₂, X₃) → l5(X₀, X₁, X₂, X₃) :|: X₀ ≤ 0
new bound:
24⋅X₂+8⋅X₃+9 {O(n)}
new bound:
24⋅X₂+8⋅X₃+17 {O(n)}
Overall timebound:16⋅X₃+48⋅X₂+30 {O(n)}
t₀: 1 {O(1)}
t₁: 1 {O(1)}
t₂: 24⋅X₂+8⋅X₃+9 {O(n)}
t₃: 1 {O(1)}
t₄: 24⋅X₂+8⋅X₃+17 {O(n)}
t₅: 1 {O(1)}
Overall costbound: 16⋅X₃+48⋅X₂+30 {O(n)}
t₀: 1 {O(1)}
t₁: 1 {O(1)}
t₂: 24⋅X₂+8⋅X₃+9 {O(n)}
t₃: 1 {O(1)}
t₄: 24⋅X₂+8⋅X₃+17 {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₀: X₂ {O(n)}
t₁, X₁: X₃ {O(n)}
t₁, X₂: X₂ {O(n)}
t₁, X₃: X₃ {O(n)}
t₂, X₀: 408⋅X₂⋅X₃+576⋅X₂⋅X₂+72⋅X₃⋅X₃+298⋅X₃+841⋅X₂+306 {O(n^2)}
t₂, X₁: 24⋅X₂+9⋅X₃+17 {O(n)}
t₂, X₂: X₂ {O(n)}
t₂, X₃: X₃ {O(n)}
t₃, X₀: 408⋅X₂⋅X₃+576⋅X₂⋅X₂+72⋅X₃⋅X₃+298⋅X₃+842⋅X₂+306 {O(n^2)}
t₃, X₁: 10⋅X₃+24⋅X₂+17 {O(n)}
t₃, X₂: 2⋅X₂ {O(n)}
t₃, X₃: 2⋅X₃ {O(n)}
t₄, X₀: 408⋅X₂⋅X₃+576⋅X₂⋅X₂+72⋅X₃⋅X₃+298⋅X₃+841⋅X₂+306 {O(n^2)}
t₄, X₁: 24⋅X₂+9⋅X₃+17 {O(n)}
t₄, X₂: X₂ {O(n)}
t₄, X₃: X₃ {O(n)}
t₅, X₀: 408⋅X₂⋅X₃+576⋅X₂⋅X₂+72⋅X₃⋅X₃+298⋅X₃+842⋅X₂+306 {O(n^2)}
t₅, X₁: 10⋅X₃+24⋅X₂+17 {O(n)}
t₅, X₂: 2⋅X₂ {O(n)}
t₅, X₃: 2⋅X₃ {O(n)}