NO

Initial ITS

Start location: __init
Program variables: arg1 arg2
   0: f1_0_main_Load -> f66_0_loop_LE : arg1'=arg1p1, arg2'=arg2p1, (-arg1p1+arg2 == 0 /\ 1+arg2 > 0 /\ arg1 > 0), cost: 1
   1: f66_0_loop_LE -> f66_0_loop_LE : arg1'=arg1p2, arg2'=arg2p2, (-31+arg1 < 0 /\ -10+arg1 > 0 /\ -1+arg1-arg1p2 == 0 /\ -25+arg1 < 0), cost: 1
   2: f66_0_loop_LE -> f66_0_loop_LE : arg1'=arg1p3, arg2'=arg2p3, (-31+arg1 < 0 /\ -1-arg1p3+arg1 == 0 /\ -25+arg1 > 0), cost: 1
   3: f66_0_loop_LE -> f66_0_loop_LE : arg1'=arg1p4, arg2'=arg2p4, (25-arg1 == 0 /\ 29-arg1p4 == 0), cost: 1
   4: f66_0_loop_LE -> f66_0_loop_LE : arg1'=arg1p5, arg2'=arg2p5, (20-arg1p5 == 0 /\ -30+arg1 > 0), cost: 1
   5: __init -> f1_0_main_Load : arg1'=arg1p6, arg2'=arg2p6, T, cost: 1

Chained Linear Paths

Start location: __init
Program variables: arg1 arg2
   1: f66_0_loop_LE -> f66_0_loop_LE : arg1'=arg1p2, arg2'=arg2p2, (-31+arg1 < 0 /\ -10+arg1 > 0 /\ -1+arg1-arg1p2 == 0 /\ -25+arg1 < 0), cost: 1
   2: f66_0_loop_LE -> f66_0_loop_LE : arg1'=arg1p3, arg2'=arg2p3, (-31+arg1 < 0 /\ -1-arg1p3+arg1 == 0 /\ -25+arg1 > 0), cost: 1
   3: f66_0_loop_LE -> f66_0_loop_LE : arg1'=arg1p4, arg2'=arg2p4, (25-arg1 == 0 /\ 29-arg1p4 == 0), cost: 1
   4: f66_0_loop_LE -> f66_0_loop_LE : arg1'=arg1p5, arg2'=arg2p5, (20-arg1p5 == 0 /\ -30+arg1 > 0), cost: 1
   6: __init -> f66_0_loop_LE : arg1'=arg1p1, arg2'=arg2p1, (arg1p6 > 0 /\ -arg1p1+arg2p6 == 0 /\ 1+arg2p6 > 0), cost: 1

	Eliminating location f1_0_main_Load by chaining:

	Applied chaining

	First rule:
	__init -> f1_0_main_Load : arg1'=arg1p6, arg2'=arg2p6, T, cost: 1
	Second rule:
	f1_0_main_Load -> f66_0_loop_LE : arg1'=arg1p1, arg2'=arg2p1, (-arg1p1+arg2 == 0 /\ 1+arg2 > 0 /\ arg1 > 0), cost: 1
	New rule:
	__init -> f66_0_loop_LE : arg1'=arg1p1, arg2'=arg2p1, (arg1p6 > 0 /\ -arg1p1+arg2p6 == 0 /\ 1+arg2p6 > 0), cost: 1
	
	Applied deletion

	Removed the following rules: 0 5

Simplified Transitions

Start location: __init
Program variables: arg1 arg2
   7: f66_0_loop_LE -> f66_0_loop_LE : arg1'=-1+arg1, arg2'=arg2p2, (-31+arg1 < 0 /\ -10+arg1 > 0 /\ -25+arg1 < 0), cost: 1
   8: f66_0_loop_LE -> f66_0_loop_LE : arg1'=-1+arg1, arg2'=arg2p3, (-31+arg1 < 0 /\ -25+arg1 > 0), cost: 1
   9: f66_0_loop_LE -> f66_0_loop_LE : arg1'=29, arg2'=arg2p4, 25-arg1 == 0, cost: 1
  10: f66_0_loop_LE -> f66_0_loop_LE : arg1'=20, arg2'=arg2p5, -30+arg1 > 0, cost: 1
  11: __init -> f66_0_loop_LE : arg1'=arg2p6, arg2'=arg2p1, (1+arg2p6 > 0), cost: 1

	Propagated Equalities

	Original rule:
	f66_0_loop_LE -> f66_0_loop_LE : arg1'=arg1p2, arg2'=arg2p2, (-31+arg1 < 0 /\ -10+arg1 > 0 /\ -1+arg1-arg1p2 == 0 /\ -25+arg1 < 0), cost: 1
	New rule:
	f66_0_loop_LE -> f66_0_loop_LE : arg1'=-1+arg1, arg2'=arg2p2, (0 == 0 /\ -31+arg1 < 0 /\ -10+arg1 > 0 /\ -25+arg1 < 0), cost: 1
	
		propagated equality arg1p2 = -1+arg1
		
	Simplified Guard

	Original rule:
	f66_0_loop_LE -> f66_0_loop_LE : arg1'=-1+arg1, arg2'=arg2p2, (0 == 0 /\ -31+arg1 < 0 /\ -10+arg1 > 0 /\ -25+arg1 < 0), cost: 1
	New rule:
	f66_0_loop_LE -> f66_0_loop_LE : arg1'=-1+arg1, arg2'=arg2p2, (-31+arg1 < 0 /\ -10+arg1 > 0 /\ -25+arg1 < 0), cost: 1
	
	Propagated Equalities

	Original rule:
	f66_0_loop_LE -> f66_0_loop_LE : arg1'=arg1p3, arg2'=arg2p3, (-31+arg1 < 0 /\ -1-arg1p3+arg1 == 0 /\ -25+arg1 > 0), cost: 1
	New rule:
	f66_0_loop_LE -> f66_0_loop_LE : arg1'=-1+arg1, arg2'=arg2p3, (0 == 0 /\ -31+arg1 < 0 /\ -25+arg1 > 0), cost: 1
	
		propagated equality arg1p3 = -1+arg1
		
	Simplified Guard

	Original rule:
	f66_0_loop_LE -> f66_0_loop_LE : arg1'=-1+arg1, arg2'=arg2p3, (0 == 0 /\ -31+arg1 < 0 /\ -25+arg1 > 0), cost: 1
	New rule:
	f66_0_loop_LE -> f66_0_loop_LE : arg1'=-1+arg1, arg2'=arg2p3, (-31+arg1 < 0 /\ -25+arg1 > 0), cost: 1
	
	Propagated Equalities

	Original rule:
	f66_0_loop_LE -> f66_0_loop_LE : arg1'=arg1p4, arg2'=arg2p4, (25-arg1 == 0 /\ 29-arg1p4 == 0), cost: 1
	New rule:
	f66_0_loop_LE -> f66_0_loop_LE : arg1'=29, arg2'=arg2p4, (0 == 0 /\ 25-arg1 == 0), cost: 1
	
		propagated equality arg1p4 = 29
		
	Simplified Guard

	Original rule:
	f66_0_loop_LE -> f66_0_loop_LE : arg1'=29, arg2'=arg2p4, (0 == 0 /\ 25-arg1 == 0), cost: 1
	New rule:
	f66_0_loop_LE -> f66_0_loop_LE : arg1'=29, arg2'=arg2p4, 25-arg1 == 0, cost: 1
	
	Propagated Equalities

	Original rule:
	f66_0_loop_LE -> f66_0_loop_LE : arg1'=arg1p5, arg2'=arg2p5, (20-arg1p5 == 0 /\ -30+arg1 > 0), cost: 1
	New rule:
	f66_0_loop_LE -> f66_0_loop_LE : arg1'=20, arg2'=arg2p5, (0 == 0 /\ -30+arg1 > 0), cost: 1
	
		propagated equality arg1p5 = 20
		
	Simplified Guard

	Original rule:
	f66_0_loop_LE -> f66_0_loop_LE : arg1'=20, arg2'=arg2p5, (0 == 0 /\ -30+arg1 > 0), cost: 1
	New rule:
	f66_0_loop_LE -> f66_0_loop_LE : arg1'=20, arg2'=arg2p5, -30+arg1 > 0, cost: 1
	
	Propagated Equalities

	Original rule:
	__init -> f66_0_loop_LE : arg1'=arg1p1, arg2'=arg2p1, (arg1p6 > 0 /\ -arg1p1+arg2p6 == 0 /\ 1+arg2p6 > 0), cost: 1
	New rule:
	__init -> f66_0_loop_LE : arg1'=arg2p6, arg2'=arg2p1, (0 == 0 /\ arg1p6 > 0 /\ 1+arg2p6 > 0), cost: 1
	
		propagated equality arg1p1 = arg2p6
		
	Simplified Guard

	Original rule:
	__init -> f66_0_loop_LE : arg1'=arg2p6, arg2'=arg2p1, (0 == 0 /\ arg1p6 > 0 /\ 1+arg2p6 > 0), cost: 1
	New rule:
	__init -> f66_0_loop_LE : arg1'=arg2p6, arg2'=arg2p1, (arg1p6 > 0 /\ 1+arg2p6 > 0), cost: 1
	
	Eliminated Temporary Variables via Transitive Closure

	Original rule:
	__init -> f66_0_loop_LE : arg1'=arg2p6, arg2'=arg2p1, (arg1p6 > 0 /\ 1+arg2p6 > 0), cost: 1
	New rule:
	__init -> f66_0_loop_LE : arg1'=arg2p6, arg2'=arg2p1, (1+arg2p6 > 0), cost: 1

Step with 11

	Trace

	11[(1+arg2p6 > 0)]
	
	Blocked

	[{}, {}]

Step with 7

	Trace

	11[(1+arg2p6 > 0)], 7[(-31+arg1 < 0 /\ -10+arg1 > 0 /\ -25+arg1 < 0)]
	
	Blocked

	[{}, {}, {}]

Accelerate

Start location: __init
Program variables: arg1 arg2
   7: f66_0_loop_LE -> f66_0_loop_LE : arg1'=-1+arg1, arg2'=arg2p2, (-31+arg1 < 0 /\ -10+arg1 > 0 /\ -25+arg1 < 0), cost: 1
   8: f66_0_loop_LE -> f66_0_loop_LE : arg1'=-1+arg1, arg2'=arg2p3, (-31+arg1 < 0 /\ -25+arg1 > 0), cost: 1
   9: f66_0_loop_LE -> f66_0_loop_LE : arg1'=29, arg2'=arg2p4, 25-arg1 == 0, cost: 1
  10: f66_0_loop_LE -> f66_0_loop_LE : arg1'=20, arg2'=arg2p5, -30+arg1 > 0, cost: 1
  12: f66_0_loop_LE -> f66_0_loop_LE : arg1'=-n+arg1, arg2'=arg2p2, (25-arg1 > 0 /\ -1+n >= 0 /\ 31-arg1 > 0 /\ -9-n+arg1 > 0), cost: 1
  11: __init -> f66_0_loop_LE : arg1'=arg2p6, arg2'=arg2p1, (1+arg2p6 > 0), cost: 1

	Loop Acceleration

	Original rule:
	f66_0_loop_LE -> f66_0_loop_LE : arg1'=-1+arg1, arg2'=arg2p2, (-31+arg1 < 0 /\ -10+arg1 > 0 /\ -25+arg1 < 0), cost: 1
	New rule:
	f66_0_loop_LE -> f66_0_loop_LE : arg1'=-n+arg1, arg2'=arg2p2, (25-arg1 > 0 /\ -1+n >= 0 /\ 31-arg1 > 0 /\ -9-n+arg1 > 0), cost: 1

		-10+arg1 > 0 [0]: montonic decrease yields -9-n+arg1 > 0
		
		-10+arg1 > 0 [1]: eventual increase yields (1 <= 0 /\ -10+arg1 > 0)
		
		25-arg1 > 0 [0]: monotonic increase yields 25-arg1 > 0
		
		31-arg1 > 0 [0]: monotonic increase yields 31-arg1 > 0, dependencies: 25-arg1 > 0
		
		Replacement map: {-10+arg1 > 0 -> -9-n+arg1 > 0, 25-arg1 > 0 -> 25-arg1 > 0, 31-arg1 > 0 -> 31-arg1 > 0}

	Trace

	11[(1+arg2p6 > 0)], 12[(25-arg1 > 0 /\ -1+n >= 0 /\ 31-arg1 > 0 /\ -9-n+arg1 > 0)]
	
	Blocked

	[{}, {}, {7[T], 12[T]}]

Backtrack

	Trace

	11[(1+arg2p6 > 0)]
	
	Blocked

	[{}, {12[T]}]

Step with 7

	Trace

	11[(1+arg2p6 > 0)], 7[(-31+arg1 < 0 /\ -10+arg1 > 0 /\ -25+arg1 < 0)]
	
	Blocked

	[{}, {12[T]}, {}]

Covered

	Trace

	11[(1+arg2p6 > 0)]
	
	Blocked

	[{}, {7[T], 12[T]}]

Step with 8

	Trace

	11[(1+arg2p6 > 0)], 8[(-31+arg1 < 0 /\ -25+arg1 > 0)]
	
	Blocked

	[{}, {7[T], 12[T]}, {}]

Accelerate

Start location: __init
Program variables: arg1 arg2
   7: f66_0_loop_LE -> f66_0_loop_LE : arg1'=-1+arg1, arg2'=arg2p2, (-31+arg1 < 0 /\ -10+arg1 > 0 /\ -25+arg1 < 0), cost: 1
   8: f66_0_loop_LE -> f66_0_loop_LE : arg1'=-1+arg1, arg2'=arg2p3, (-31+arg1 < 0 /\ -25+arg1 > 0), cost: 1
   9: f66_0_loop_LE -> f66_0_loop_LE : arg1'=29, arg2'=arg2p4, 25-arg1 == 0, cost: 1
  10: f66_0_loop_LE -> f66_0_loop_LE : arg1'=20, arg2'=arg2p5, -30+arg1 > 0, cost: 1
  12: f66_0_loop_LE -> f66_0_loop_LE : arg1'=-n+arg1, arg2'=arg2p2, (25-arg1 > 0 /\ -1+n >= 0 /\ 31-arg1 > 0 /\ -9-n+arg1 > 0), cost: 1
  13: f66_0_loop_LE -> f66_0_loop_LE : arg1'=arg1-n2, arg2'=arg2p3, (-1+n2 >= 0 /\ 31-arg1 > 0 /\ -24+arg1-n2 > 0), cost: 1
  11: __init -> f66_0_loop_LE : arg1'=arg2p6, arg2'=arg2p1, (1+arg2p6 > 0), cost: 1

	Loop Acceleration

	Original rule:
	f66_0_loop_LE -> f66_0_loop_LE : arg1'=-1+arg1, arg2'=arg2p3, (-31+arg1 < 0 /\ -25+arg1 > 0), cost: 1
	New rule:
	f66_0_loop_LE -> f66_0_loop_LE : arg1'=arg1-n2, arg2'=arg2p3, (-1+n2 >= 0 /\ 31-arg1 > 0 /\ -24+arg1-n2 > 0), cost: 1

		31-arg1 > 0 [0]: monotonic increase yields 31-arg1 > 0
		
		-25+arg1 > 0 [0]: montonic decrease yields -24+arg1-n2 > 0
		
		-25+arg1 > 0 [1]: eventual increase yields (1 <= 0 /\ -25+arg1 > 0)
		
		Replacement map: {31-arg1 > 0 -> 31-arg1 > 0, -25+arg1 > 0 -> -24+arg1-n2 > 0}

	Trace

	11[(1+arg2p6 > 0)], 13[(-1+n2 >= 0 /\ 31-arg1 > 0 /\ -24+arg1-n2 > 0)]
	
	Blocked

	[{}, {7[T], 12[T]}, {8[T], 13[T]}]

Step with 9

	Trace

	11[(1+arg2p6 > 0)], 13[(-1+n2 >= 0 /\ 31-arg1 > 0 /\ -24+arg1-n2 > 0)], 9[(25-arg1 == 0)]
	
	Blocked

	[{}, {7[T], 12[T]}, {7[T], 8[T], 13[T]}, {}]

Acceleration Failed

marked recursive suffix as redundant

Nonterm

Start location: __init
Program variables: arg1 arg2
   7: f66_0_loop_LE -> f66_0_loop_LE : arg1'=-1+arg1, arg2'=arg2p2, (-31+arg1 < 0 /\ -10+arg1 > 0 /\ -25+arg1 < 0), cost: 1
   8: f66_0_loop_LE -> f66_0_loop_LE : arg1'=-1+arg1, arg2'=arg2p3, (-31+arg1 < 0 /\ -25+arg1 > 0), cost: 1
   9: f66_0_loop_LE -> f66_0_loop_LE : arg1'=29, arg2'=arg2p4, 25-arg1 == 0, cost: 1
  10: f66_0_loop_LE -> f66_0_loop_LE : arg1'=20, arg2'=arg2p5, -30+arg1 > 0, cost: 1
  12: f66_0_loop_LE -> f66_0_loop_LE : arg1'=-n+arg1, arg2'=arg2p2, (25-arg1 > 0 /\ -1+n >= 0 /\ 31-arg1 > 0 /\ -9-n+arg1 > 0), cost: 1
  13: f66_0_loop_LE -> f66_0_loop_LE : arg1'=arg1-n2, arg2'=arg2p3, (-1+n2 >= 0 /\ 31-arg1 > 0 /\ -24+arg1-n2 > 0), cost: 1
  14: f66_0_loop_LE -> LoAT_sink : (-1+n3 >= 0 /\ 31-arg1 > 0 /\ -26+arg1 >= 0), cost: NONTERM
  11: __init -> f66_0_loop_LE : arg1'=arg2p6, arg2'=arg2p1, (1+arg2p6 > 0), cost: 1

	Certificate of Non-Termination

	Original rule:
	f66_0_loop_LE -> f66_0_loop_LE : arg1'=29, arg2'=arg2p4, (31-arg1 > 0 /\ -26+arg1 >= 0), cost: 1
	New rule:
	f66_0_loop_LE -> LoAT_sink : (-1+n3 >= 0 /\ 31-arg1 > 0 /\ -26+arg1 >= 0), cost: NONTERM

		31-arg1 > 0 [0]: monotonic increase yields 31-arg1 > 0
		
		-26+arg1 >= 0 [0]: monotonic increase yields -26+arg1 >= 0
		
		Replacement map: {31-arg1 > 0 -> 31-arg1 > 0, -26+arg1 >= 0 -> -26+arg1 >= 0}

Step with 14

	Trace

	11[(1+arg2p6 > 0)], 14[(-1+n3 >= 0 /\ 31-arg1 > 0 /\ -26+arg1 >= 0)]
	
	Blocked

	[{}, {7[T], 12[T]}, {14[T]}]

Refute

	Counterexample

	[ arg1=26 arg2=0 ] 11 [ arg1=arg1 arg2=arg2 ] 14
	
NO

Build SHA: a05f16bf13df659c382799650051f91bf6828c7b