NO

Initial ITS
Start location: __init
   0: f53_0_main_Load -> f53_0_main_Load : arg2'=arg2P0, arg1'=arg1P0, (arg2 > 0 /\ -100+arg2+arg1 < 0 /\ arg1 > 0 /\ arg2-arg1P0 == 0 /\ -arg2P0+arg1 == 0), cost: 1
   1: f1_0_main_ConstantStackPush -> f53_0_main_Load : arg2'=arg2P1, arg1'=arg1P1, (17-arg1P1 == 0 /\ 13-arg2P1 == 0), cost: 1
   2: __init -> f1_0_main_ConstantStackPush : arg2'=arg2P2, arg1'=arg1P2, TRUE, cost: 1


Applied preprocessing
Original rule:
f53_0_main_Load -> f53_0_main_Load : arg2'=arg2P0, arg1'=arg1P0, (arg2 > 0 /\ -100+arg2+arg1 < 0 /\ arg1 > 0 /\ arg2-arg1P0 == 0 /\ -arg2P0+arg1 == 0), cost: 1
New rule:
f53_0_main_Load -> f53_0_main_Load : arg2'=arg1, arg1'=arg2, (arg2 > 0 /\ arg1 > 0 /\ 100-arg2-arg1 > 0), cost: 1

Applied preprocessing
Original rule:
f1_0_main_ConstantStackPush -> f53_0_main_Load : arg2'=arg2P1, arg1'=arg1P1, (17-arg1P1 == 0 /\ 13-arg2P1 == 0), cost: 1
New rule:
f1_0_main_ConstantStackPush -> f53_0_main_Load : arg2'=13, arg1'=17, TRUE, cost: 1

Simplified rules
Start location: __init
   3: f53_0_main_Load -> f53_0_main_Load : arg2'=arg1, arg1'=arg2, (arg2 > 0 /\ arg1 > 0 /\ 100-arg2-arg1 > 0), cost: 1
   4: f1_0_main_ConstantStackPush -> f53_0_main_Load : arg2'=13, arg1'=17, TRUE, cost: 1
   2: __init -> f1_0_main_ConstantStackPush : arg2'=arg2P2, arg1'=arg1P2, TRUE, cost: 1


Applied unrolling
Original rule:
f53_0_main_Load -> f53_0_main_Load : arg2'=arg1, arg1'=arg2, (arg2 > 0 /\ arg1 > 0 /\ 100-arg2-arg1 > 0), cost: 1
New rule:
f53_0_main_Load -> f53_0_main_Load : arg2'=arg2, arg1'=arg1, (arg2 > 0 /\ arg1 > 0 /\ 100-arg2-arg1 > 0), cost: 2

Applied nonterm
Original rule:
f53_0_main_Load -> f53_0_main_Load : arg2'=arg2, arg1'=arg1, (arg2 > 0 /\ arg1 > 0 /\ 100-arg2-arg1 > 0), cost: 2
New rule:
f53_0_main_Load -> [3] : (arg2 > 0 /\ arg1 > 0 /\ 100-arg2-arg1 > 0 /\ n >= 0), cost: NONTERM
Sub-proof via acceration calculus written to file:///tmp/tmpnam_cgmiaI.txt

Applied deletion
Removed the following rules: 3

Accelerated simple loops
Start location: __init
   5: f53_0_main_Load -> [3] : (arg2 > 0 /\ arg1 > 0 /\ 100-arg2-arg1 > 0 /\ n >= 0), cost: NONTERM
   4: f1_0_main_ConstantStackPush -> f53_0_main_Load : arg2'=13, arg1'=17, TRUE, cost: 1
   2: __init -> f1_0_main_ConstantStackPush : arg2'=arg2P2, arg1'=arg1P2, TRUE, cost: 1


Applied chaining
First rule:
f1_0_main_ConstantStackPush -> f53_0_main_Load : arg2'=13, arg1'=17, TRUE, cost: 1
Second rule:
f53_0_main_Load -> [3] : (arg2 > 0 /\ arg1 > 0 /\ 100-arg2-arg1 > 0 /\ n >= 0), cost: NONTERM
New rule:
f1_0_main_ConstantStackPush -> [3] : (13 > 0 /\ 17 > 0 /\ 70 > 0), cost: NONTERM

Applied deletion
Removed the following rules: 5

Chained accelerated rules with incoming rules
Start location: __init
   4: f1_0_main_ConstantStackPush -> f53_0_main_Load : arg2'=13, arg1'=17, TRUE, cost: 1
   6: f1_0_main_ConstantStackPush -> [3] : (13 > 0 /\ 17 > 0 /\ 70 > 0), cost: NONTERM
   2: __init -> f1_0_main_ConstantStackPush : arg2'=arg2P2, arg1'=arg1P2, TRUE, cost: 1


Removed unreachable locations and irrelevant leafs
Start location: __init
   6: f1_0_main_ConstantStackPush -> [3] : (13 > 0 /\ 17 > 0 /\ 70 > 0), cost: NONTERM
   2: __init -> f1_0_main_ConstantStackPush : arg2'=arg2P2, arg1'=arg1P2, TRUE, cost: 1


Eliminating location f1_0_main_ConstantStackPush by chaining:

Applied chaining
First rule:
__init -> f1_0_main_ConstantStackPush : arg2'=arg2P2, arg1'=arg1P2, TRUE, cost: 1
Second rule:
f1_0_main_ConstantStackPush -> [3] : (13 > 0 /\ 17 > 0 /\ 70 > 0), cost: NONTERM
New rule:
__init -> [3] : (13 > 0 /\ 17 > 0 /\ 70 > 0), cost: NONTERM

Applied deletion
Removed the following rules: 2 6

Eliminated locations on linear paths
Start location: __init
   7: __init -> [3] : (13 > 0 /\ 17 > 0 /\ 70 > 0), cost: NONTERM


Computing asymptotic complexity
Proved nontermination of rule 7 via SMT.

Proved the following lower bound
Complexity:  Nonterm
Cpx degree: Nonterm

Solved cost: NONTERM
Rule cost:   NONTERM
Rule guard:  (13 > 0 /\ 17 > 0 /\ 70 > 0)