0.00/0.13	YES
0.00/0.13	
0.00/0.13	Solver Timeout: 4
0.00/0.13	Global Timeout: 300
0.00/0.13	No parsing errors!
0.00/0.13	Init Location: 0
0.00/0.13	Transitions:
0.00/0.13	<l0, l7, true>
0.00/0.13	<l1, l2, (undef1 <= arg1) /\ (arg2 > ~(1)) /\ (arg1 > 0) /\ (undef1 > 0), par{arg1 -> undef1, arg2 -> (arg2 - 1), arg3 -> arg2, arg4 -> arg2}>
0.00/0.13	<l2, l2, (undef5 <= arg1) /\ (arg3 > 0) /\ (arg1 > 0) /\ (undef5 > 0), par{arg1 -> undef5, arg2 -> (arg2 - 1), arg3 -> arg2}>
0.00/0.13	<l2, l3, (arg3 < 1) /\ (arg4 > ~(1)) /\ (arg1 >= undef9) /\ (arg1 > 0) /\ (undef9 > 0), par{arg1 -> undef9, arg2 -> (arg4 - 1), arg3 -> arg4}>
0.00/0.13	<l3, l3, (undef13 <= arg1) /\ (arg3 > 0) /\ (arg1 > 0) /\ (undef13 > 0), par{arg1 -> undef13, arg2 -> (arg2 - 1), arg3 -> arg2}>
0.00/0.13	<l3, l4, (arg3 < 1) /\ (arg4 > ~(1)) /\ (arg1 > 0), par{arg1 -> (arg4 - 1), arg2 -> arg4, arg3 -> undef19, arg4 -> undef20}>
0.00/0.13	<l4, l5, (arg2 < 1), par{arg1 -> 2, arg2 -> undef22, arg3 -> undef23, arg4 -> undef24}>
0.00/0.13	<l4, l4, (arg2 > 0), par{arg1 -> (arg1 - 1), arg2 -> arg1, arg3 -> undef27, arg4 -> undef28}>
0.00/0.13	<l5, l6, (arg1 > ~(1)) /\ (undef29 > ~(1)) /\ (arg1 < 3), par{arg1 -> undef29, arg2 -> undef30, arg3 -> undef31, arg4 -> undef32}>
0.00/0.13	<l5, l5, (arg1 > ~(1)) /\ (arg1 < 3), par{arg1 -> (arg1 - 1), arg2 -> undef34, arg3 -> undef35, arg4 -> undef36}>
0.00/0.13	<l6, l6, ((undef37 + 1) <= arg1) /\ (arg1 > 0) /\ (undef37 > ~(1)), par{arg1 -> undef37, arg2 -> undef38, arg3 -> undef39, arg4 -> undef40}>
0.00/0.13	<l7, l1, true, par{arg1 -> undef41, arg2 -> undef42, arg3 -> undef43, arg4 -> undef44}>
0.00/0.13	
0.00/0.13	Fresh variables:
0.00/0.13	undef1, undef5, undef9, undef13, undef19, undef20, undef22, undef23, undef24, undef27, undef28, undef29, undef30, undef31, undef32, undef34, undef35, undef36, undef37, undef38, undef39, undef40, undef41, undef42, undef43, undef44, 
0.00/0.13	
0.00/0.13	Undef variables:
0.00/0.13	undef1, undef5, undef9, undef13, undef19, undef20, undef22, undef23, undef24, undef27, undef28, undef29, undef30, undef31, undef32, undef34, undef35, undef36, undef37, undef38, undef39, undef40, undef41, undef42, undef43, undef44, 
0.00/0.13	
0.00/0.13	Abstraction variables:
0.00/0.13	
0.00/0.13	Exit nodes:
0.00/0.13	
0.00/0.13	Accepting locations:
0.00/0.13	
0.00/0.13	Asserts:
0.00/0.13	
0.00/0.13	Preprocessed LLVMGraph
0.00/0.13	Init Location: 0
0.00/0.13	Transitions:
0.00/0.13	<l0, l2, (arg1 = undef1) /\ (arg2 = (undef42 - 1)) /\ (arg3 = undef42) /\ (arg4 = undef42) /\ (undef1 <= undef41) /\ (undef42 > ~(1)) /\ (undef41 > 0) /\ (undef1 > 0)>
0.00/0.13	<l2, l2, (undef5 <= arg1) /\ (arg3 > 0) /\ (arg1 > 0) /\ (undef5 > 0), par{arg1 -> undef5, arg2 -> (arg2 - 1), arg3 -> arg2}>
0.00/0.13	<l2, l3, (arg3 < 1) /\ (arg4 > ~(1)) /\ (arg1 >= undef9) /\ (arg1 > 0) /\ (undef9 > 0), par{arg1 -> undef9, arg2 -> (arg4 - 1), arg3 -> arg4}>
0.00/0.13	<l3, l3, (undef13 <= arg1) /\ (arg3 > 0) /\ (arg1 > 0) /\ (undef13 > 0), par{arg1 -> undef13, arg2 -> (arg2 - 1), arg3 -> arg2}>
0.00/0.13	<l3, l4, (arg3 < 1) /\ (arg4 > ~(1)) /\ (arg1 > 0), par{arg1 -> (arg4 - 1), arg2 -> arg4, arg3 -> undef19, arg4 -> undef20}>
0.00/0.13	<l4, l5, (arg2 < 1), par{arg1 -> 2, arg2 -> undef22, arg3 -> undef23, arg4 -> undef24}>
0.00/0.13	<l4, l4, (arg2 > 0), par{arg1 -> (arg1 - 1), arg2 -> arg1, arg3 -> undef27, arg4 -> undef28}>
0.00/0.13	<l5, l6, (arg1 > ~(1)) /\ (undef29 > ~(1)) /\ (arg1 < 3), par{arg1 -> undef29, arg2 -> undef30, arg3 -> undef31, arg4 -> undef32}>
0.00/0.13	<l5, l5, (arg1 > ~(1)) /\ (arg1 < 3), par{arg1 -> (arg1 - 1), arg2 -> undef34, arg3 -> undef35, arg4 -> undef36}>
0.00/0.13	<l6, l6, ((undef37 + 1) <= arg1) /\ (arg1 > 0) /\ (undef37 > ~(1)), par{arg1 -> undef37, arg2 -> undef38, arg3 -> undef39, arg4 -> undef40}>
0.00/0.13	
0.00/0.13	Fresh variables:
0.00/0.13	undef1, undef5, undef9, undef13, undef19, undef20, undef22, undef23, undef24, undef27, undef28, undef29, undef30, undef31, undef32, undef34, undef35, undef36, undef37, undef38, undef39, undef40, undef41, undef42, undef43, undef44, 
0.00/0.13	
0.00/0.13	Undef variables:
0.00/0.13	undef1, undef5, undef9, undef13, undef19, undef20, undef22, undef23, undef24, undef27, undef28, undef29, undef30, undef31, undef32, undef34, undef35, undef36, undef37, undef38, undef39, undef40, undef41, undef42, undef43, undef44, 
0.00/0.13	
0.00/0.13	Abstraction variables:
0.00/0.13	
0.00/0.13	Exit nodes:
0.00/0.13	
0.00/0.13	Accepting locations:
0.00/0.13	
0.00/0.13	Asserts:
0.00/0.13	
0.00/0.13	*************************************************************
0.00/0.13	*******************************************************************************************
0.00/0.13	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.00/0.13	*******************************************************************************************
0.00/0.13	
0.00/0.13	Init Location: 0
0.00/0.13	Graph 0:
0.00/0.13	Transitions:
0.00/0.13	Variables:
0.00/0.13	
0.00/0.13	Graph 1:
0.00/0.13	Transitions:
0.00/0.13	<l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ 1 <= undef5 /\ undef5 <= arg1, {arg1 -> undef5, arg2 -> -1 + arg2, arg3 -> arg2, rest remain the same}>
0.00/0.13	Variables:
0.00/0.13	arg1, arg2, arg3
0.00/0.13	
0.00/0.13	Graph 2:
0.00/0.13	Transitions:
0.00/0.13	<l3, l3, 1 <= arg1 /\ 1 <= arg3 /\ 1 <= undef13 /\ undef13 <= arg1, {arg1 -> undef13, arg2 -> -1 + arg2, arg3 -> arg2, rest remain the same}>
0.00/0.13	Variables:
0.00/0.13	arg1, arg2, arg3
0.00/0.13	
0.00/0.13	Graph 3:
0.00/0.13	Transitions:
0.00/0.13	<l4, l4, 1 <= arg2, {arg1 -> -1 + arg1, arg2 -> arg1, arg3 -> undef27, arg4 -> undef28, rest remain the same}>
0.00/0.13	Variables:
0.00/0.13	arg1, arg2, arg3, arg4
0.00/0.13	
0.00/0.13	Graph 4:
0.00/0.13	Transitions:
0.00/0.13	<l5, l5, 0 <= arg1 /\ arg1 <= 2, {arg1 -> -1 + arg1, arg2 -> undef34, arg3 -> undef35, arg4 -> undef36, rest remain the same}>
0.00/0.13	Variables:
0.00/0.13	arg1, arg2, arg3, arg4
0.00/0.13	
0.00/0.13	Graph 5:
0.00/0.13	Transitions:
0.00/0.13	<l6, l6, 1 <= arg1 /\ 1 + undef37 <= arg1 /\ 0 <= undef37, {arg1 -> undef37, arg2 -> undef38, arg3 -> undef39, arg4 -> undef40, rest remain the same}>
0.00/0.13	Variables:
0.00/0.13	arg1, arg2, arg3, arg4
0.00/0.13	
0.00/0.13	Precedence: 
0.00/0.13	Graph 0
0.00/0.13	
0.00/0.13	Graph 1
0.00/0.13	<l0, l2, 1 <= undef1 /\ 1 <= undef41 /\ undef1 <= undef41 /\ 0 <= undef42 /\ 1 + arg2 = undef42 /\ arg1 = undef1 /\ arg3 = undef42 /\ arg4 = undef42, {all remain the same}>
0.00/0.13	
0.00/0.13	Graph 2
0.00/0.13	<l2, l3, 1 <= arg1 /\ 1 <= undef9 /\ undef9 <= arg1 /\ arg3 <= 0 /\ 0 <= arg4, {arg1 -> undef9, arg2 -> -1 + arg4, arg3 -> arg4, rest remain the same}>
0.00/0.13	
0.00/0.13	Graph 3
0.00/0.13	<l3, l4, 1 <= arg1 /\ arg3 <= 0 /\ 0 <= arg4, {arg1 -> -1 + arg4, arg2 -> arg4, arg3 -> undef19, arg4 -> undef20, rest remain the same}>
0.00/0.13	
0.00/0.13	Graph 4
0.00/0.13	<l4, l5, arg2 <= 0, {arg1 -> 2, arg2 -> undef22, arg3 -> undef23, arg4 -> undef24, rest remain the same}>
0.00/0.13	
0.00/0.13	Graph 5
0.00/0.13	<l5, l6, 0 <= arg1 /\ 0 <= undef29 /\ arg1 <= 2, {arg1 -> undef29, arg2 -> undef30, arg3 -> undef31, arg4 -> undef32, rest remain the same}>
0.00/0.13	
0.00/0.13	Map Locations to Subgraph:
0.00/0.13	( 0 , 0 )
0.00/0.13	( 2 , 1 )
0.00/0.13	( 3 , 2 )
0.00/0.13	( 4 , 3 )
0.00/0.13	( 5 , 4 )
0.00/0.13	( 6 , 5 )
0.00/0.13	
0.00/0.13	*******************************************************************************************
0.00/0.13	********************************    CHECKING ASSERTIONS    ********************************
0.00/0.13	*******************************************************************************************
0.00/0.13	
0.00/0.13	Proving termination of subgraph 0
0.00/0.13	Proving termination of subgraph 1
0.00/0.13	Checking unfeasibility...
0.00/0.13	Time used: 0.003733
0.00/0.13	
0.00/0.13	Checking conditional termination of SCC {l2}...
0.00/0.13	
0.00/0.13	LOG: CALL solveLinear
0.00/0.13	
0.00/0.13	LOG: RETURN solveLinear - Elapsed time: 0.000816s
0.00/0.13	
0.00/0.13	LOG: CALL solveLinear
0.00/0.13	
0.00/0.13	LOG: RETURN solveLinear - Elapsed time: 0.003001s
0.00/0.13	Trying to remove transition: <l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ 1 <= undef5 /\ undef5 <= arg1, {arg1 -> undef5, arg2 -> -1 + arg2, arg3 -> arg2, rest remain the same}>
0.00/0.13	Solving with 1 template(s).
0.00/0.13	
0.00/0.13	LOG: CALL solveNonLinearGetFirstSolution
0.00/0.13	
0.00/0.13	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011011s
0.00/0.13	Time used: 0.010786
0.00/0.13	Solving with 1 template(s).
0.00/0.13	
0.00/0.13	LOG: CALL solveNonLinearGetFirstSolution
0.00/0.13	
0.00/0.13	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010407s
0.00/0.13	Time used: 0.009969
0.00/0.13	
0.00/0.13	LOG: SAT solveNonLinear - Elapsed time: 0.010407s
0.00/0.13	Cost: 0; Total time: 0.009969
0.00/0.13	Termination implied by a set of invariant(s):
0.00/0.13	Invariant at l2: arg3 <= 1 + arg1 + arg2
0.00/0.13	[ Invariant Graph ]
0.00/0.13	Strengthening and disabling transitions...
0.00/0.13	
0.00/0.13	LOG: CALL solverLinear in Graph for feasibility
0.00/0.13	
0.00/0.13	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.13	Strengthening transition (result): 
0.00/0.13	<l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ 1 <= undef5 /\ arg3 <= 1 + arg1 + arg2 /\ undef5 <= arg1, {arg1 -> undef5, arg2 -> -1 + arg2, arg3 -> arg2, rest remain the same}>
0.00/0.13	[ Termination Graph ]
0.00/0.13	Strengthening and disabling transitions...
0.00/0.13	
0.00/0.13	LOG: CALL solverLinear in Graph for feasibility
0.00/0.13	
0.00/0.13	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.13	Strengthening transition (result): 
0.00/0.13	<l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ 1 <= undef5 /\ arg3 <= 1 + arg1 + arg2 /\ undef5 <= arg1, {arg1 -> undef5, arg2 -> -1 + arg2, arg3 -> arg2, rest remain the same}>
0.00/0.13	Ranking function: arg1 + arg2
0.00/0.13	New Graphs: 
0.00/0.13	INVARIANTS: 
0.00/0.13	2: arg3 <= 1 + arg1 + arg2 , 
0.00/0.13	Quasi-INVARIANTS to narrow Graph: 
0.00/0.13	2: 
0.00/0.13	Proving termination of subgraph 2
0.00/0.13	Checking unfeasibility...
0.00/0.13	Time used: 0.003115
0.00/0.13	
0.00/0.13	Checking conditional termination of SCC {l3}...
0.00/0.13	
0.00/0.13	LOG: CALL solveLinear
0.00/0.13	
0.00/0.13	LOG: RETURN solveLinear - Elapsed time: 0.000864s
0.00/0.13	
0.00/0.13	LOG: CALL solveLinear
0.00/0.13	
0.00/0.13	LOG: RETURN solveLinear - Elapsed time: 0.002849s
0.00/0.13	Trying to remove transition: <l3, l3, 1 <= arg1 /\ 1 <= arg3 /\ 1 <= undef13 /\ undef13 <= arg1, {arg1 -> undef13, arg2 -> -1 + arg2, arg3 -> arg2, rest remain the same}>
0.00/0.13	Solving with 1 template(s).
0.00/0.13	
0.00/0.13	LOG: CALL solveNonLinearGetFirstSolution
0.00/0.13	
0.00/0.13	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009889s
0.00/0.13	Time used: 0.009723
0.00/0.13	Solving with 1 template(s).
0.00/0.13	
0.00/0.13	LOG: CALL solveNonLinearGetFirstSolution
0.00/0.13	
0.00/0.13	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011818s
0.00/0.13	Time used: 0.011386
0.00/0.13	
0.00/0.13	LOG: SAT solveNonLinear - Elapsed time: 0.011818s
0.00/0.13	Cost: 0; Total time: 0.011386
0.00/0.13	Termination implied by a set of invariant(s):
0.00/0.13	Invariant at l3: arg3 <= 1 + arg1 + arg2
0.00/0.13	[ Invariant Graph ]
0.00/0.13	Strengthening and disabling transitions...
0.00/0.13	
0.00/0.13	LOG: CALL solverLinear in Graph for feasibility
0.00/0.13	
0.00/0.13	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.13	Strengthening transition (result): 
0.00/0.13	<l3, l3, 1 <= arg1 /\ 1 <= arg3 /\ 1 <= undef13 /\ arg3 <= 1 + arg1 + arg2 /\ undef13 <= arg1, {arg1 -> undef13, arg2 -> -1 + arg2, arg3 -> arg2, rest remain the same}>
0.00/0.13	[ Termination Graph ]
0.00/0.13	Strengthening and disabling transitions...
0.00/0.13	
0.00/0.13	LOG: CALL solverLinear in Graph for feasibility
0.00/0.13	
0.00/0.13	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.13	Strengthening transition (result): 
0.00/0.13	<l3, l3, 1 <= arg1 /\ 1 <= arg3 /\ 1 <= undef13 /\ arg3 <= 1 + arg1 + arg2 /\ undef13 <= arg1, {arg1 -> undef13, arg2 -> -1 + arg2, arg3 -> arg2, rest remain the same}>
0.00/0.13	Ranking function: arg1 + arg2
0.00/0.13	New Graphs: 
0.00/0.13	INVARIANTS: 
0.00/0.13	3: arg3 <= 1 + arg1 + arg2 , 
0.00/0.13	Quasi-INVARIANTS to narrow Graph: 
0.00/0.13	3: 
0.00/0.13	Proving termination of subgraph 3
0.00/0.13	Checking unfeasibility...
0.00/0.13	Time used: 0.002582
0.00/0.13	
0.00/0.13	Checking conditional termination of SCC {l4}...
0.00/0.13	
0.00/0.13	LOG: CALL solveLinear
0.00/0.13	
0.00/0.13	LOG: RETURN solveLinear - Elapsed time: 0.000659s
0.00/0.13	
0.00/0.13	LOG: CALL solveLinear
0.00/0.13	
0.00/0.13	LOG: RETURN solveLinear - Elapsed time: 0.001905s
0.00/0.13	Trying to remove transition: <l4, l4, 1 <= arg2, {arg1 -> -1 + arg1, arg2 -> arg1, arg3 -> undef27, arg4 -> undef28, rest remain the same}>
0.00/0.13	Solving with 1 template(s).
0.00/0.13	
0.00/0.13	LOG: CALL solveNonLinearGetFirstSolution
0.00/0.13	
0.00/0.13	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008655s
0.00/0.13	Time used: 0.008525
0.00/0.13	Solving with 1 template(s).
0.00/0.13	
0.00/0.13	LOG: CALL solveNonLinearGetFirstSolution
0.00/0.13	
0.00/0.13	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009694s
0.00/0.13	Time used: 0.009231
0.00/0.13	
0.00/0.13	LOG: SAT solveNonLinear - Elapsed time: 0.009694s
0.00/0.13	Cost: 0; Total time: 0.009231
0.00/0.13	Termination implied by a set of invariant(s):
0.00/0.13	Invariant at l4: arg2 <= 1 + arg1
0.00/0.13	[ Invariant Graph ]
0.00/0.13	Strengthening and disabling transitions...
0.00/0.13	
0.00/0.13	LOG: CALL solverLinear in Graph for feasibility
0.00/0.13	
0.00/0.13	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.13	Strengthening transition (result): 
0.00/0.13	<l4, l4, 1 <= arg2 /\ arg2 <= 1 + arg1, {arg1 -> -1 + arg1, arg2 -> arg1, arg3 -> undef27, arg4 -> undef28, rest remain the same}>
0.00/0.13	[ Termination Graph ]
0.00/0.13	Strengthening and disabling transitions...
0.00/0.13	
0.00/0.13	LOG: CALL solverLinear in Graph for feasibility
0.00/0.13	
0.00/0.13	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.13	Strengthening transition (result): 
0.00/0.13	<l4, l4, 1 <= arg2 /\ arg2 <= 1 + arg1, {arg1 -> -1 + arg1, arg2 -> arg1, arg3 -> undef27, arg4 -> undef28, rest remain the same}>
0.00/0.13	Ranking function: arg1
0.00/0.13	New Graphs: 
0.00/0.13	INVARIANTS: 
0.00/0.13	4: arg2 <= 1 + arg1 , 
0.00/0.13	Quasi-INVARIANTS to narrow Graph: 
0.00/0.13	4: 
0.00/0.13	Proving termination of subgraph 4
0.00/0.13	Checking unfeasibility...
0.00/0.13	Time used: 0.004691
0.00/0.13	
0.00/0.13	Checking conditional termination of SCC {l5}...
0.00/0.13	
0.00/0.13	LOG: CALL solveLinear
0.00/0.13	
0.00/0.13	LOG: RETURN solveLinear - Elapsed time: 0.000999s
0.00/0.13	Ranking function: arg1
0.00/0.13	New Graphs: 
0.00/0.13	Proving termination of subgraph 5
0.00/0.13	Checking unfeasibility...
0.00/0.13	Time used: 0.002598
0.00/0.13	
0.00/0.13	Checking conditional termination of SCC {l6}...
0.00/0.13	
0.00/0.13	LOG: CALL solveLinear
0.00/0.13	
0.00/0.13	LOG: RETURN solveLinear - Elapsed time: 0.001140s
0.00/0.13	Ranking function: -1 + arg1
0.00/0.13	New Graphs: 
0.00/0.13	Program Terminates
0.00/0.13	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
0.00/0.13	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
0.00/0.13	EOF