NO

Initial ITS

Start location: [1]
Program variables: a b
   0: [1] -> [2] : a'=1, T, cost: 1
   1: [2] -> [3] : b'=2, T, cost: 1
   2: [3] -> [4] : -5+b+a < 0, cost: 1
   7: [3] -> [8] : -5+b+a >= 0, cost: 1
   3: [4] -> [5] : a'=-b+a, T, cost: 1
   4: [5] -> [6] : b'=b+a, T, cost: 1
   5: [6] -> [7] : a'=b-a, T, cost: 1
   6: [7] -> [3] : T, cost: 1

Chained Linear Paths

Start location: [1]
Program variables: a b
   8: [1] -> [3] : a'=1, b'=2, T, cost: 1
   7: [3] -> [8] : -5+b+a >= 0, cost: 1
  12: [3] -> [3] : a'=b, b'=a, -5+b+a < 0, cost: 1

	Eliminating location [2] by chaining:

	Applied chaining

	First rule:
	[1] -> [2] : a'=1, T, cost: 1
	Second rule:
	[2] -> [3] : b'=2, T, cost: 1
	New rule:
	[1] -> [3] : a'=1, b'=2, T, cost: 1
	
	Applied deletion

	Removed the following rules: 0 1
	
	Eliminating location [4] by chaining:

	Applied chaining

	First rule:
	[3] -> [4] : -5+b+a < 0, cost: 1
	Second rule:
	[4] -> [5] : a'=-b+a, T, cost: 1
	New rule:
	[3] -> [5] : a'=-b+a, -5+b+a < 0, cost: 1
	
	Applied deletion

	Removed the following rules: 2 3
	
	Eliminating location [5] by chaining:

	Applied chaining

	First rule:
	[3] -> [5] : a'=-b+a, -5+b+a < 0, cost: 1
	Second rule:
	[5] -> [6] : b'=b+a, T, cost: 1
	New rule:
	[3] -> [6] : a'=-b+a, b'=a, -5+b+a < 0, cost: 1
	
	Applied deletion

	Removed the following rules: 4 9
	
	Eliminating location [6] by chaining:

	Applied chaining

	First rule:
	[3] -> [6] : a'=-b+a, b'=a, -5+b+a < 0, cost: 1
	Second rule:
	[6] -> [7] : a'=b-a, T, cost: 1
	New rule:
	[3] -> [7] : a'=b, b'=a, -5+b+a < 0, cost: 1
	
	Applied deletion

	Removed the following rules: 5 10
	
	Eliminating location [7] by chaining:

	Applied chaining

	First rule:
	[3] -> [7] : a'=b, b'=a, -5+b+a < 0, cost: 1
	Second rule:
	[7] -> [3] : T, cost: 1
	New rule:
	[3] -> [3] : a'=b, b'=a, -5+b+a < 0, cost: 1
	
	Applied deletion

	Removed the following rules: 6 11

Unrolled Loops

Start location: [1]
Program variables: a b
   8: [1] -> [3] : a'=1, b'=2, T, cost: 1
   7: [3] -> [8] : -5+b+a >= 0, cost: 1
  12: [3] -> [3] : a'=b, b'=a, -5+b+a < 0, cost: 1
  13: [3] -> [3] : -5+b+a < 0, cost: 1

	Unrolling

	Original rule:
	[3] -> [3] : a'=b, b'=a, -5+b+a < 0, cost: 1
	New rule:
	[3] -> [3] : a'=a, b'=b, -5+b+a < 0, cost: 1
	
	Removed Trivial Updates

	Original rule:
	[3] -> [3] : a'=a, b'=b, -5+b+a < 0, cost: 1
	New rule:
	[3] -> [3] : -5+b+a < 0, cost: 1

Step with 8

	Trace

	8[T]
	
	Blocked

	[{}, {}]

Step with 12

	Trace

	8[T], 12[(-5+b+a < 0)]
	
	Blocked

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

Nonterm

Start location: [1]
Program variables: a b
   8: [1] -> [3] : a'=1, b'=2, T, cost: 1
   7: [3] -> [8] : -5+b+a >= 0, cost: 1
  12: [3] -> [3] : a'=b, b'=a, -5+b+a < 0, cost: 1
  13: [3] -> [3] : -5+b+a < 0, cost: 1
  14: [3] -> LoAT_sink : (5-b-a > 0 /\ -1+n >= 0), cost: NONTERM
  15: [3] -> [3] : (5-b-a > 0), cost: 1

	unrolling

	Original rule:
	[3] -> [3] : a'=b, b'=a, (-5+b+a < 0), cost: 1
	New rule:
	[3] -> [3] : a'=a, b'=b, -5+b+a < 0, cost: 1
	
	Certificate of Non-Termination

	Original rule:
	[3] -> [3] : a'=a, b'=b, -5+b+a < 0, cost: 1
	New rule:
	[3] -> LoAT_sink : (5-b-a > 0 /\ -1+n >= 0), cost: NONTERM

		5-b-a > 0 [0]: monotonic increase yields 5-b-a > 0
		
		Replacement map: {5-b-a > 0 -> 5-b-a > 0}

	Loop Acceleration

	Original rule:
	[3] -> [3] : a'=a, b'=b, -5+b+a < 0, cost: 1
	New rule:
	[3] -> [3] : a'=a, b'=b, (5-b-a > 0 /\ -1+n >= 0), cost: 1

		5-b-a > 0 [0]: monotonic increase yields 5-b-a > 0
		
		Replacement map: {5-b-a > 0 -> 5-b-a > 0}

	Eliminated Temporary Variables via Transitive Closure

	Original rule:
	[3] -> [3] : a'=a, b'=b, (5-b-a > 0 /\ -1+n >= 0), cost: 1
	New rule:
	[3] -> [3] : a'=a, b'=b, (5-b-a > 0), cost: 1
	
	Removed Trivial Updates

	Original rule:
	[3] -> [3] : a'=a, b'=b, (5-b-a > 0), cost: 1
	New rule:
	[3] -> [3] : (5-b-a > 0), cost: 1

Step with 14

	Trace

	8[T], 14[(5-b-a > 0 /\ -1+n >= 0)]
	
	Blocked

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

Refute

	Counterexample

	[ a=1 b=2 ] 8 [ a=a b=b ] 14
	
NO

Build SHA: a05f16bf13df659c382799650051f91bf6828c7b