0.00/0.25	YES
0.00/0.25	
0.00/0.25	Solver Timeout: 4
0.00/0.25	Global Timeout: 300
0.00/0.25	No parsing errors!
0.00/0.25	Init Location: 0
0.00/0.25	Transitions:
0.00/0.25	<l0, l6, true>
0.00/0.25	<l1, l2, (undef1 <= arg1) /\ (arg2 > ~(1)) /\ (arg1 > 0) /\ (undef1 > 0), par{arg1 -> undef1, arg2 -> 0, arg3 -> (arg2 - 1), arg4 -> arg2}>
0.00/0.25	<l2, l2, (arg3 > arg2) /\ (arg2 < arg4) /\ (arg4 > ~(1)) /\ (undef5 <= arg1) /\ (arg1 > 0) /\ (undef5 > 0), par{arg1 -> undef5, arg2 -> (arg2 + 1), arg3 -> (arg4 - 1)}>
0.00/0.25	<l2, l3, (arg3 <= arg2) /\ (arg4 > ~(1)) /\ (arg1 >= undef9) /\ (arg1 > 0) /\ (undef9 > 0), par{arg1 -> undef9, arg2 -> 0, arg3 -> (arg4 - 1)}>
0.00/0.25	<l3, l4, (arg2 > ~(1)) /\ (arg3 > arg2) /\ (undef14 <= arg1) /\ (arg1 > 0) /\ (undef14 > 0), par{arg1 -> arg2, arg2 -> undef14, arg3 -> (arg2 + 1)}>
0.00/0.25	<l4, l3, (arg4 > ~(1)) /\ (arg4 <= arg3) /\ (undef17 <= arg2) /\ (arg2 > 0) /\ (undef17 > 0), par{arg1 -> undef17, arg2 -> (arg1 + 1), arg3 -> (arg4 - 1)}>
0.00/0.25	<l3, l5, (arg3 <= arg2) /\ (arg4 > ~(1)) /\ (undef21 <= arg1) /\ (arg1 > 0) /\ (undef21 > 0), par{arg1 -> undef21, arg2 -> 0, arg3 -> (arg4 - 1)}>
0.00/0.25	<l5, l5, (arg4 > ~(1)) /\ (arg3 > arg2) /\ (undef25 <= arg1) /\ (arg1 > 0) /\ (undef25 > 0), par{arg1 -> undef25, arg2 -> (arg2 + 1), arg3 -> (arg4 - 1)}>
0.00/0.25	<l4, l4, (arg4 > arg3) /\ (arg4 > arg1) /\ (undef33 >= undef34) /\ (undef30 <= arg2) /\ (arg2 > 0) /\ (undef30 > 0), par{arg2 -> undef30, arg3 -> (arg3 + 1)}>
0.00/0.25	<l4, l4, (arg4 > arg3) /\ (arg4 > arg1) /\ (undef39 < undef40) /\ (undef36 <= arg2) /\ (arg2 > 0) /\ (undef36 > 0), par{arg2 -> undef36, arg3 -> (arg3 + 1)}>
0.00/0.25	<l6, l1, true, par{arg1 -> undef41, arg2 -> undef42, arg3 -> undef43, arg4 -> undef44}>
0.00/0.25	
0.00/0.25	Fresh variables:
0.00/0.25	undef1, undef5, undef9, undef14, undef17, undef21, undef25, undef30, undef33, undef34, undef36, undef39, undef40, undef41, undef42, undef43, undef44, 
0.00/0.25	
0.00/0.25	Undef variables:
0.00/0.25	undef1, undef5, undef9, undef14, undef17, undef21, undef25, undef30, undef33, undef34, undef36, undef39, undef40, undef41, undef42, undef43, undef44, 
0.00/0.25	
0.00/0.25	Abstraction variables:
0.00/0.25	
0.00/0.25	Exit nodes:
0.00/0.25	
0.00/0.25	Accepting locations:
0.00/0.25	
0.00/0.25	Asserts:
0.00/0.25	
0.00/0.25	Preprocessed LLVMGraph
0.00/0.25	Init Location: 0
0.00/0.25	Transitions:
0.00/0.25	<l0, l2, (arg1 = undef1) /\ (arg2 = 0) /\ (arg3 = (undef42 - 1)) /\ (arg4 = undef42) /\ (undef1 <= undef41) /\ (undef42 > ~(1)) /\ (undef41 > 0) /\ (undef1 > 0)>
0.00/0.25	<l2, l2, (arg3 > arg2) /\ (arg2 < arg4) /\ (arg4 > ~(1)) /\ (undef5 <= arg1) /\ (arg1 > 0) /\ (undef5 > 0), par{arg1 -> undef5, arg2 -> (arg2 + 1), arg3 -> (arg4 - 1)}>
0.00/0.25	<l2, l4, (arg3 <= arg2) /\ (arg4 > ~(1)) /\ (arg1 >= undef9) /\ (arg1 > 0) /\ (undef9 > 0) /\ (0 > ~(1)) /\ ((arg4 - 1) > 0) /\ (undef14 <= undef9) /\ (undef9 > 0) /\ (undef14 > 0), par{arg1 -> 0, arg2 -> undef14, arg3 -> (0 + 1)}>
0.00/0.25	<l2, l5, (arg3 <= arg2) /\ (arg4 > ~(1)) /\ (arg1 >= undef9) /\ (arg1 > 0) /\ (undef9 > 0) /\ ((arg4 - 1) <= 0) /\ (arg4 > ~(1)) /\ (undef21 <= undef9) /\ (undef9 > 0) /\ (undef21 > 0), par{arg1 -> undef21, arg2 -> 0, arg3 -> (arg4 - 1)}>
0.00/0.25	<l4, l4, (arg4 > ~(1)) /\ (arg4 <= arg3) /\ (undef17 <= arg2) /\ (arg2 > 0) /\ (undef17 > 0) /\ ((arg1 + 1) > ~(1)) /\ ((arg4 - 1) > (arg1 + 1)) /\ (undef14 <= undef17) /\ (undef17 > 0) /\ (undef14 > 0), par{arg1 -> (arg1 + 1), arg2 -> undef14, arg3 -> ((arg1 + 1) + 1)}>
0.00/0.25	<l4, l5, (arg4 > ~(1)) /\ (arg4 <= arg3) /\ (undef17 <= arg2) /\ (arg2 > 0) /\ (undef17 > 0) /\ ((arg4 - 1) <= (arg1 + 1)) /\ (arg4 > ~(1)) /\ (undef21 <= undef17) /\ (undef17 > 0) /\ (undef21 > 0), par{arg1 -> undef21, arg2 -> 0, arg3 -> (arg4 - 1)}>
0.00/0.25	<l4, l4, (arg4 > arg3) /\ (arg4 > arg1) /\ (undef33 >= undef34) /\ (undef30 <= arg2) /\ (arg2 > 0) /\ (undef30 > 0), par{arg2 -> undef30, arg3 -> (arg3 + 1)}>
0.00/0.25	<l4, l4, (arg4 > arg3) /\ (arg4 > arg1) /\ (undef39 < undef40) /\ (undef36 <= arg2) /\ (arg2 > 0) /\ (undef36 > 0), par{arg2 -> undef36, arg3 -> (arg3 + 1)}>
0.00/0.25	<l5, l5, (arg4 > ~(1)) /\ (arg3 > arg2) /\ (undef25 <= arg1) /\ (arg1 > 0) /\ (undef25 > 0), par{arg1 -> undef25, arg2 -> (arg2 + 1), arg3 -> (arg4 - 1)}>
0.00/0.25	
0.00/0.25	Fresh variables:
0.00/0.25	undef1, undef5, undef9, undef14, undef17, undef21, undef25, undef30, undef33, undef34, undef36, undef39, undef40, undef41, undef42, undef43, undef44, 
0.00/0.25	
0.00/0.25	Undef variables:
0.00/0.25	undef1, undef5, undef9, undef14, undef17, undef21, undef25, undef30, undef33, undef34, undef36, undef39, undef40, undef41, undef42, undef43, undef44, 
0.00/0.25	
0.00/0.25	Abstraction variables:
0.00/0.25	
0.00/0.25	Exit nodes:
0.00/0.25	
0.00/0.25	Accepting locations:
0.00/0.25	
0.00/0.25	Asserts:
0.00/0.25	
0.00/0.25	*************************************************************
0.00/0.25	*******************************************************************************************
0.00/0.25	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.00/0.25	*******************************************************************************************
0.00/0.25	
0.00/0.25	Init Location: 0
0.00/0.25	Graph 0:
0.00/0.25	Transitions:
0.00/0.25	Variables:
0.00/0.25	
0.00/0.25	Graph 1:
0.00/0.25	Transitions:
0.00/0.25	<l2, l2, 1 <= arg1 /\ 1 + arg2 <= arg3 /\ 1 + arg2 <= arg4 /\ 1 <= undef5 /\ undef5 <= arg1 /\ 0 <= arg4, {arg1 -> undef5, arg2 -> 1 + arg2, arg3 -> -1 + arg4, rest remain the same}>
0.00/0.25	Variables:
0.00/0.25	arg1, arg2, arg3, arg4
0.00/0.25	
0.00/0.25	Graph 2:
0.00/0.25	Transitions:
0.00/0.25	<l4, l4, 1 <= arg2 /\ 1 <= undef14 /\ 1 <= undef17 /\ 0 <= 1 + arg1 /\ undef17 <= arg2 /\ arg4 <= arg3 /\ 0 <= arg4 /\ undef14 <= undef17 /\ 3 + arg1 <= arg4, {arg1 -> 1 + arg1, arg2 -> undef14, arg3 -> 2 + arg1, rest remain the same}>
0.00/0.25	<l4, l4, 1 + arg1 <= arg4 /\ 1 <= arg2 /\ 1 + arg3 <= arg4 /\ 1 <= undef30 /\ undef30 <= arg2 /\ undef34 <= undef33, {arg2 -> undef30, arg3 -> 1 + arg3, rest remain the same}>
0.00/0.25	<l4, l4, 1 + arg1 <= arg4 /\ 1 <= arg2 /\ 1 + arg3 <= arg4 /\ 1 <= undef36 /\ 1 + undef39 <= undef40 /\ undef36 <= arg2, {arg2 -> undef36, arg3 -> 1 + arg3, rest remain the same}>
0.00/0.25	Variables:
0.00/0.25	arg1, arg2, arg3, arg4
0.00/0.25	
0.00/0.25	Graph 3:
0.00/0.25	Transitions:
0.00/0.25	<l5, l5, 1 <= arg1 /\ 1 + arg2 <= arg3 /\ 1 <= undef25 /\ undef25 <= arg1 /\ 0 <= arg4, {arg1 -> undef25, arg2 -> 1 + arg2, arg3 -> -1 + arg4, rest remain the same}>
0.00/0.25	Variables:
0.00/0.25	arg1, arg2, arg3, arg4
0.00/0.25	
0.00/0.25	Precedence: 
0.00/0.25	Graph 0
0.00/0.25	
0.00/0.25	Graph 1
0.00/0.25	<l0, l2, 1 <= undef1 /\ 1 <= undef41 /\ undef1 <= undef41 /\ 0 <= undef42 /\ 1 + arg3 = undef42 /\ arg1 = undef1 /\ arg2 = 0 /\ arg4 = undef42, {all remain the same}>
0.00/0.25	
0.00/0.25	Graph 2
0.00/0.25	<l2, l4, 1 <= arg1 /\ 1 <= undef9 /\ 1 <= undef14 /\ undef9 <= arg1 /\ arg3 <= arg2 /\ undef14 <= undef9 /\ 2 <= arg4, {arg1 -> 0, arg2 -> undef14, arg3 -> 1, rest remain the same}>
0.00/0.25	
0.00/0.25	Graph 3
0.00/0.25	<l2, l5, 1 <= arg1 /\ 1 <= undef9 /\ 1 <= undef21 /\ arg4 <= 1 /\ undef9 <= arg1 /\ arg3 <= arg2 /\ 0 <= arg4 /\ undef21 <= undef9, {arg1 -> undef21, arg2 -> 0, arg3 -> -1 + arg4, rest remain the same}>
0.00/0.25	<l4, l5, 1 <= arg2 /\ 1 <= undef17 /\ 1 <= undef21 /\ undef17 <= arg2 /\ arg4 <= arg3 /\ 0 <= arg4 /\ undef21 <= undef17 /\ arg4 <= 2 + arg1, {arg1 -> undef21, arg2 -> 0, arg3 -> -1 + arg4, rest remain the same}>
0.00/0.25	
0.00/0.25	Map Locations to Subgraph:
0.00/0.25	( 0 , 0 )
0.00/0.25	( 2 , 1 )
0.00/0.25	( 4 , 2 )
0.00/0.25	( 5 , 3 )
0.00/0.25	
0.00/0.25	*******************************************************************************************
0.00/0.25	********************************    CHECKING ASSERTIONS    ********************************
0.00/0.25	*******************************************************************************************
0.00/0.25	
0.00/0.25	Proving termination of subgraph 0
0.00/0.25	Proving termination of subgraph 1
0.00/0.25	Checking unfeasibility...
0.00/0.25	Time used: 0.004434
0.00/0.25	
0.00/0.25	Checking conditional termination of SCC {l2}...
0.00/0.25	
0.00/0.25	LOG: CALL solveLinear
0.00/0.25	
0.00/0.25	LOG: RETURN solveLinear - Elapsed time: 0.001306s
0.00/0.25	Ranking function: -1 - arg2 + arg4
0.00/0.25	New Graphs: 
0.00/0.25	Proving termination of subgraph 2
0.00/0.25	Checking unfeasibility...
0.00/0.25	Time used: 0.160465
0.00/0.25	
0.00/0.25	Checking conditional termination of SCC {l4}...
0.00/0.25	
0.00/0.25	LOG: CALL solveLinear
0.00/0.25	
0.00/0.25	LOG: RETURN solveLinear - Elapsed time: 0.004682s
0.00/0.25	Ranking function: (~(15) / 2) + (~(5) / 2)*arg1 + (5 / 2)*arg4
0.00/0.25	New Graphs: 
0.00/0.25	Transitions:
0.00/0.25	<l4, l4, 1 + arg1 <= arg4 /\ 1 <= arg2 /\ 1 + arg3 <= arg4 /\ 1 <= undef30 /\ undef30 <= arg2 /\ undef34 <= undef33, {arg2 -> undef30, arg3 -> 1 + arg3, rest remain the same}>
0.00/0.25	<l4, l4, 1 + arg1 <= arg4 /\ 1 <= arg2 /\ 1 + arg3 <= arg4 /\ 1 <= undef36 /\ 1 + undef39 <= undef40 /\ undef36 <= arg2, {arg2 -> undef36, arg3 -> 1 + arg3, rest remain the same}>
0.00/0.25	Variables:
0.00/0.25	arg1, arg2, arg3, arg4
0.00/0.25	Checking conditional termination of SCC {l4}...
0.00/0.25	
0.00/0.25	LOG: CALL solveLinear
0.00/0.25	
0.00/0.25	LOG: RETURN solveLinear - Elapsed time: 0.002275s
0.00/0.25	Ranking function: -1 - arg3 + arg4
0.00/0.25	New Graphs: 
0.00/0.25	Proving termination of subgraph 3
0.00/0.25	Checking unfeasibility...
0.00/0.25	Time used: 0.00443
0.00/0.25	
0.00/0.25	Checking conditional termination of SCC {l5}...
0.00/0.25	
0.00/0.25	LOG: CALL solveLinear
0.00/0.25	
0.00/0.25	LOG: RETURN solveLinear - Elapsed time: 0.001046s
0.00/0.25	
0.00/0.25	LOG: CALL solveLinear
0.00/0.25	
0.00/0.25	LOG: RETURN solveLinear - Elapsed time: 0.003937s
0.00/0.25	Trying to remove transition: <l5, l5, 1 <= arg1 /\ 1 + arg2 <= arg3 /\ 1 <= undef25 /\ undef25 <= arg1 /\ 0 <= arg4, {arg1 -> undef25, arg2 -> 1 + arg2, arg3 -> -1 + arg4, rest remain the same}>
0.00/0.25	Solving with 1 template(s).
0.00/0.25	
0.00/0.25	LOG: CALL solveNonLinearGetFirstSolution
0.00/0.25	
0.00/0.25	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012372s
0.00/0.25	Time used: 0.012117
0.00/0.25	Solving with 1 template(s).
0.00/0.25	
0.00/0.25	LOG: CALL solveNonLinearGetFirstSolution
0.00/0.25	
0.00/0.25	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012614s
0.00/0.25	Time used: 0.012084
0.00/0.25	
0.00/0.25	LOG: SAT solveNonLinear - Elapsed time: 0.012614s
0.00/0.25	Cost: 0; Total time: 0.012084
0.00/0.25	Termination implied by a set of invariant(s):
0.00/0.25	Invariant at l5: arg3 <= arg4
0.00/0.25	[ Invariant Graph ]
0.00/0.25	Strengthening and disabling transitions...
0.00/0.25	
0.00/0.25	LOG: CALL solverLinear in Graph for feasibility
0.00/0.25	
0.00/0.25	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.25	Strengthening transition (result): 
0.00/0.26	<l5, l5, 1 <= arg1 /\ 1 + arg2 <= arg3 /\ 1 <= undef25 /\ undef25 <= arg1 /\ arg3 <= arg4 /\ 0 <= arg4, {arg1 -> undef25, arg2 -> 1 + arg2, arg3 -> -1 + arg4, rest remain the same}>
0.00/0.26	[ Termination Graph ]
0.00/0.26	Strengthening and disabling transitions...
0.00/0.26	
0.00/0.26	LOG: CALL solverLinear in Graph for feasibility
0.00/0.26	
0.00/0.26	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.26	Strengthening transition (result): 
0.00/0.26	<l5, l5, 1 <= arg1 /\ 1 + arg2 <= arg3 /\ 1 <= undef25 /\ undef25 <= arg1 /\ arg3 <= arg4 /\ 0 <= arg4, {arg1 -> undef25, arg2 -> 1 + arg2, arg3 -> -1 + arg4, rest remain the same}>
0.00/0.26	Ranking function: -arg2 + arg4
0.00/0.26	New Graphs: 
0.00/0.26	INVARIANTS: 
0.00/0.26	5: arg3 <= arg4 , 
0.00/0.26	Quasi-INVARIANTS to narrow Graph: 
0.00/0.26	5: 
0.00/0.26	Program Terminates
0.00/0.26	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
0.00/0.26	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
0.00/0.26	EOF