0.00/0.09	YES
0.00/0.09	
0.00/0.09	Solver Timeout: 4
0.00/0.09	Global Timeout: 300
0.00/0.09	No parsing errors!
0.00/0.09	Init Location: 0
0.00/0.09	Transitions:
0.00/0.09	<l0, l11, true>
0.00/0.09	<l1, l2, true>
0.00/0.09	<l3, l1, ((0 + coef_len6^0) <= (0 + acc_length11^0))>
0.00/0.09	<l3, l1, ((1 + acc_length11^0) <= (0 + coef_len6^0)), par{acc_length11^0 -> (1 + acc_length11^0)}>
0.00/0.09	<l2, l4, true, par{i8^0 -> (1 + i8^0)}>
0.00/0.09	<l5, l3, true>
0.00/0.09	<l5, l2, true, par{acc_length11^0 -> (~(1) + acc_length11^0)}>
0.00/0.09	<l5, l3, true>
0.00/0.09	<l4, l6, true>
0.00/0.09	<l7, l5, ((0 + acc_length11^0) <= (0 + j9^0))>
0.00/0.09	<l7, l8, ((1 + j9^0) <= (0 + acc_length11^0)) /\ (undef103 = undef103), par{acc12^0 -> undef103, j9^0 -> (1 + j9^0)}>
0.00/0.09	<l8, l7, true>
0.00/0.09	<l6, l9, ((0 + in_len4^0) <= (0 + i8^0))>
0.00/0.09	<l6, l8, ((1 + i8^0) <= (0 + in_len4^0)) /\ (undef136 = undef136), par{acc12^0 -> undef136, j9^0 -> 1}>
0.00/0.09	<l10, l4, (undef149 = undef149), par{acc_length11^0 -> (0 + undef149), coef_len210^0 -> undef149, coef_len6^0 -> (0 + __const_35^0), i8^0 -> 0, in_len4^0 -> (0 + __const_10^0), scale7^0 -> (0 + __const_285^0)}>
0.00/0.09	<l11, l10, true>
0.00/0.09	
0.00/0.09	Fresh variables:
0.00/0.09	undef103, undef136, undef149, 
0.00/0.09	
0.00/0.09	Undef variables:
0.00/0.09	undef103, undef136, undef149, 
0.00/0.09	
0.00/0.09	Abstraction variables:
0.00/0.09	
0.00/0.09	Exit nodes:
0.00/0.09	
0.00/0.09	Accepting locations:
0.00/0.09	
0.00/0.09	Asserts:
0.00/0.09	
0.00/0.09	Preprocessed LLVMGraph
0.00/0.09	Init Location: 0
0.00/0.09	Transitions:
0.00/0.09	<l0, l9, (acc_length11^0 = (0 + undef149)) /\ (coef_len6^0 = (0 + coef_len6^0)) /\ (i8^0 = 0) /\ (in_len4^0 = (0 + in_len4^0)) /\ (undef149 = undef149) /\ ((0 + (0 + in_len4^0)) <= (0 + 0))>
0.00/0.09	<l0, l8, (acc_length11^0 = (0 + undef149)) /\ (coef_len6^0 = (0 + coef_len6^0)) /\ (i8^0 = 0) /\ (in_len4^0 = (0 + in_len4^0)) /\ (undef149 = undef149) /\ ((1 + 0) <= (0 + (0 + in_len4^0))) /\ (undef136 = undef136), par{j9^0 -> 1}>
0.00/0.09	<l8, l9, ((0 + acc_length11^0) <= (0 + j9^0)) /\ ((0 + coef_len6^0) <= (0 + acc_length11^0)) /\ ((0 + in_len4^0) <= (0 + (1 + i8^0))), par{i8^0 -> (1 + i8^0)}>
0.00/0.09	<l8, l8, ((0 + acc_length11^0) <= (0 + j9^0)) /\ ((0 + coef_len6^0) <= (0 + acc_length11^0)) /\ ((1 + (1 + i8^0)) <= (0 + in_len4^0)) /\ (undef136 = undef136), par{i8^0 -> (1 + i8^0), j9^0 -> 1}>
0.00/0.09	<l8, l9, ((0 + acc_length11^0) <= (0 + j9^0)) /\ ((1 + acc_length11^0) <= (0 + coef_len6^0)) /\ ((0 + in_len4^0) <= (0 + (1 + i8^0))), par{acc_length11^0 -> (1 + acc_length11^0), i8^0 -> (1 + i8^0)}>
0.00/0.09	<l8, l8, ((0 + acc_length11^0) <= (0 + j9^0)) /\ ((1 + acc_length11^0) <= (0 + coef_len6^0)) /\ ((1 + (1 + i8^0)) <= (0 + in_len4^0)) /\ (undef136 = undef136), par{acc_length11^0 -> (1 + acc_length11^0), i8^0 -> (1 + i8^0), j9^0 -> 1}>
0.00/0.09	<l8, l9, ((0 + acc_length11^0) <= (0 + j9^0)) /\ ((0 + in_len4^0) <= (0 + (1 + i8^0))), par{acc_length11^0 -> (~(1) + acc_length11^0), i8^0 -> (1 + i8^0)}>
0.00/0.09	<l8, l8, ((0 + acc_length11^0) <= (0 + j9^0)) /\ ((1 + (1 + i8^0)) <= (0 + in_len4^0)) /\ (undef136 = undef136), par{acc_length11^0 -> (~(1) + acc_length11^0), i8^0 -> (1 + i8^0), j9^0 -> 1}>
0.00/0.09	<l8, l9, ((0 + acc_length11^0) <= (0 + j9^0)) /\ ((0 + coef_len6^0) <= (0 + acc_length11^0)) /\ ((0 + in_len4^0) <= (0 + (1 + i8^0))), par{i8^0 -> (1 + i8^0)}>
0.00/0.09	<l8, l8, ((0 + acc_length11^0) <= (0 + j9^0)) /\ ((0 + coef_len6^0) <= (0 + acc_length11^0)) /\ ((1 + (1 + i8^0)) <= (0 + in_len4^0)) /\ (undef136 = undef136), par{i8^0 -> (1 + i8^0), j9^0 -> 1}>
0.00/0.09	<l8, l9, ((0 + acc_length11^0) <= (0 + j9^0)) /\ ((1 + acc_length11^0) <= (0 + coef_len6^0)) /\ ((0 + in_len4^0) <= (0 + (1 + i8^0))), par{acc_length11^0 -> (1 + acc_length11^0), i8^0 -> (1 + i8^0)}>
0.00/0.09	<l8, l8, ((0 + acc_length11^0) <= (0 + j9^0)) /\ ((1 + acc_length11^0) <= (0 + coef_len6^0)) /\ ((1 + (1 + i8^0)) <= (0 + in_len4^0)) /\ (undef136 = undef136), par{acc_length11^0 -> (1 + acc_length11^0), i8^0 -> (1 + i8^0), j9^0 -> 1}>
0.00/0.09	<l8, l8, ((1 + j9^0) <= (0 + acc_length11^0)) /\ (undef103 = undef103), par{j9^0 -> (1 + j9^0)}>
0.00/0.09	
0.00/0.09	Fresh variables:
0.00/0.09	undef103, undef136, undef149, 
0.00/0.09	
0.00/0.09	Undef variables:
0.00/0.09	undef103, undef136, undef149, 
0.00/0.09	
0.00/0.09	Abstraction variables:
0.00/0.09	
0.00/0.09	Exit nodes:
0.00/0.09	
0.00/0.09	Accepting locations:
0.00/0.09	
0.00/0.09	Asserts:
0.00/0.09	
0.00/0.09	*************************************************************
0.00/0.09	*******************************************************************************************
0.00/0.09	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.00/0.09	*******************************************************************************************
0.00/0.09	
0.00/0.09	Init Location: 0
0.00/0.09	Graph 0:
0.00/0.09	Transitions:
0.00/0.09	Variables:
0.00/0.09	
0.00/0.09	Graph 1:
0.00/0.09	Transitions:
0.00/0.09	<l8, l8, acc_length11^0 <= j9^0 /\ coef_len6^0 <= acc_length11^0 /\ 2 + i8^0 <= in_len4^0, {i8^0 -> 1 + i8^0, j9^0 -> 1, rest remain the same}>
0.00/0.09	<l8, l8, acc_length11^0 <= j9^0 /\ 1 + acc_length11^0 <= coef_len6^0 /\ 2 + i8^0 <= in_len4^0, {acc_length11^0 -> 1 + acc_length11^0, i8^0 -> 1 + i8^0, j9^0 -> 1, rest remain the same}>
0.00/0.09	<l8, l8, acc_length11^0 <= j9^0 /\ 2 + i8^0 <= in_len4^0, {acc_length11^0 -> -1 + acc_length11^0, i8^0 -> 1 + i8^0, j9^0 -> 1, rest remain the same}>
0.00/0.09	<l8, l8, acc_length11^0 <= j9^0 /\ coef_len6^0 <= acc_length11^0 /\ 2 + i8^0 <= in_len4^0, {i8^0 -> 1 + i8^0, j9^0 -> 1, rest remain the same}>
0.00/0.09	<l8, l8, acc_length11^0 <= j9^0 /\ 1 + acc_length11^0 <= coef_len6^0 /\ 2 + i8^0 <= in_len4^0, {acc_length11^0 -> 1 + acc_length11^0, i8^0 -> 1 + i8^0, j9^0 -> 1, rest remain the same}>
0.00/0.09	<l8, l8, 1 + j9^0 <= acc_length11^0, {j9^0 -> 1 + j9^0, rest remain the same}>
0.00/0.09	Variables:
0.00/0.09	acc_length11^0, coef_len6^0, i8^0, in_len4^0, j9^0
0.00/0.09	
0.00/0.09	Graph 2:
0.00/0.09	Transitions:
0.00/0.09	Variables:
0.00/0.09	
0.00/0.09	Precedence: 
0.00/0.09	Graph 0
0.00/0.09	
0.00/0.09	Graph 1
0.00/0.09	<l0, l8, 1 <= in_len4^0 /\ acc_length11^0 = undef149 /\ i8^0 = 0, {j9^0 -> 1, rest remain the same}>
0.00/0.09	
0.00/0.09	Graph 2
0.00/0.09	<l0, l9, in_len4^0 <= 0 /\ acc_length11^0 = undef149 /\ i8^0 = 0, {all remain the same}>
0.00/0.09	<l8, l9, acc_length11^0 <= j9^0 /\ coef_len6^0 <= acc_length11^0 /\ in_len4^0 <= 1 + i8^0, {i8^0 -> 1 + i8^0, rest remain the same}>
0.00/0.09	<l8, l9, acc_length11^0 <= j9^0 /\ 1 + acc_length11^0 <= coef_len6^0 /\ in_len4^0 <= 1 + i8^0, {acc_length11^0 -> 1 + acc_length11^0, i8^0 -> 1 + i8^0, rest remain the same}>
0.00/0.09	<l8, l9, acc_length11^0 <= j9^0 /\ in_len4^0 <= 1 + i8^0, {acc_length11^0 -> -1 + acc_length11^0, i8^0 -> 1 + i8^0, rest remain the same}>
0.00/0.09	<l8, l9, acc_length11^0 <= j9^0 /\ coef_len6^0 <= acc_length11^0 /\ in_len4^0 <= 1 + i8^0, {i8^0 -> 1 + i8^0, rest remain the same}>
0.00/0.09	<l8, l9, acc_length11^0 <= j9^0 /\ 1 + acc_length11^0 <= coef_len6^0 /\ in_len4^0 <= 1 + i8^0, {acc_length11^0 -> 1 + acc_length11^0, i8^0 -> 1 + i8^0, rest remain the same}>
0.00/0.09	
0.00/0.09	Map Locations to Subgraph:
0.00/0.09	( 0 , 0 )
0.00/0.09	( 8 , 1 )
0.00/0.09	( 9 , 2 )
0.00/0.09	
0.00/0.09	*******************************************************************************************
0.00/0.09	********************************    CHECKING ASSERTIONS    ********************************
0.00/0.09	*******************************************************************************************
0.00/0.09	
0.00/0.09	Proving termination of subgraph 0
0.00/0.09	Proving termination of subgraph 1
0.00/0.09	Checking unfeasibility...
0.00/0.09	Time used: 0.030587
0.00/0.09	
0.00/0.09	Checking conditional termination of SCC {l8}...
0.00/0.09	
0.00/0.09	LOG: CALL solveLinear
0.00/0.09	
0.00/0.09	LOG: RETURN solveLinear - Elapsed time: 0.006288s
0.00/0.09	Ranking function: -3 + acc_length11^0 - coef_len6^0 + (~(3) / 2)*i8^0 + (3 / 2)*in_len4^0
0.00/0.09	New Graphs: 
0.00/0.09	Transitions:
0.00/0.09	<l8, l8, acc_length11^0 <= j9^0 /\ 1 + acc_length11^0 <= coef_len6^0 /\ 2 + i8^0 <= in_len4^0, {acc_length11^0 -> 1 + acc_length11^0, i8^0 -> 1 + i8^0, j9^0 -> 1, rest remain the same}>
0.00/0.09	<l8, l8, acc_length11^0 <= j9^0 /\ 2 + i8^0 <= in_len4^0, {acc_length11^0 -> -1 + acc_length11^0, i8^0 -> 1 + i8^0, j9^0 -> 1, rest remain the same}>
0.00/0.09	<l8, l8, acc_length11^0 <= j9^0 /\ 1 + acc_length11^0 <= coef_len6^0 /\ 2 + i8^0 <= in_len4^0, {acc_length11^0 -> 1 + acc_length11^0, i8^0 -> 1 + i8^0, j9^0 -> 1, rest remain the same}>
0.00/0.09	<l8, l8, 1 + j9^0 <= acc_length11^0, {j9^0 -> 1 + j9^0, rest remain the same}>
0.00/0.09	Variables:
0.00/0.09	acc_length11^0, coef_len6^0, i8^0, in_len4^0, j9^0
0.00/0.09	Checking conditional termination of SCC {l8}...
0.00/0.09	
0.00/0.09	LOG: CALL solveLinear
0.00/0.09	
0.00/0.09	LOG: RETURN solveLinear - Elapsed time: 0.002603s
0.00/0.09	Ranking function: -2 - i8^0 + in_len4^0
0.00/0.09	New Graphs: 
0.00/0.09	Transitions:
0.00/0.09	<l8, l8, 1 + j9^0 <= acc_length11^0, {j9^0 -> 1 + j9^0, rest remain the same}>
0.00/0.09	Variables:
0.00/0.09	acc_length11^0, j9^0
0.00/0.09	Checking conditional termination of SCC {l8}...
0.00/0.09	
0.00/0.09	LOG: CALL solveLinear
0.00/0.09	
0.00/0.09	LOG: RETURN solveLinear - Elapsed time: 0.000877s
0.00/0.09	Ranking function: -1 + acc_length11^0 - j9^0
0.00/0.09	New Graphs: 
0.00/0.09	Proving termination of subgraph 2
0.00/0.09	Analyzing SCC {l9}...
0.00/0.09	No cycles found.
0.00/0.09	
0.00/0.09	Program Terminates
0.00/0.09	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
0.00/0.09	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
0.00/0.09	EOF