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