36.27/36.33	NO
36.27/36.33	
36.27/36.34	Solver Timeout: 4
36.27/36.34	Global Timeout: 300
36.27/36.34	No parsing errors!
36.27/36.34	Init Location: 0
36.27/36.34	Transitions:
36.27/36.34	<l0, l13, true>
36.27/36.34	<l1, l2, (undef5 = undef5) /\ (undef8 = (0 + undef5)), par{nondet_7^0 -> undef5, temp6_11^0 -> undef8, x_10^0 -> (0 + undef8)}>
36.27/36.34	<l3, l4, (undef15 = undef15) /\ (undef16 = (0 + undef15)) /\ ((0 + undef16) <= 0) /\ (0 <= (0 + undef16)) /\ (undef10 = undef10), par{Result_6^0 -> undef10, nondet_8^0 -> undef15, temp5_9^0 -> undef16}>
36.27/36.34	<l3, l5, (undef24 = undef24), par{nondet_8^0 -> undef24, temp5_9^0 -> (0 + undef24)}>
36.27/36.34	<l5, l6, (undef29 = __disjvr_0^0) /\ (__disjvr_0^0 = undef29), par{__disjvr_0^0 -> undef29}>
36.27/36.34	<l6, l7, (0 <= (~(1) + x_10^0)), par{x_10^0 -> (1 + x_10^0)}>
36.27/36.34	<l7, l4, (undef51 = undef51) /\ (undef52 = (0 + undef51)) /\ ((0 + undef52) <= 0) /\ (0 <= (0 + undef52)) /\ (undef46 = undef46), par{Result_6^0 -> undef46, nondet_8^0 -> undef51, temp5_9^0 -> undef52}>
36.27/36.34	<l7, l8, (undef60 = undef60), par{nondet_8^0 -> undef60, temp5_9^0 -> (0 + undef60)}>
36.27/36.34	<l8, l9, (undef66 = __disjvr_1^0) /\ (__disjvr_1^0 = undef66), par{__disjvr_1^0 -> undef66}>
36.27/36.34	<l9, l10, (0 <= (~(1) + x_10^0)), par{x_10^0 -> (1 + x_10^0)}>
36.27/36.34	<l10, l7, true>
36.27/36.34	<l2, l4, (undef96 = undef96) /\ (undef97 = (0 + undef96)) /\ ((0 + undef97) <= 0) /\ (0 <= (0 + undef97)) /\ (undef91 = undef91), par{Result_6^0 -> undef91, nondet_8^0 -> undef96, temp5_9^0 -> undef97}>
36.27/36.34	<l2, l11, (undef105 = undef105), par{nondet_8^0 -> undef105, temp5_9^0 -> (0 + undef105)}>
36.27/36.34	<l11, l12, (undef112 = __disjvr_2^0) /\ (__disjvr_2^0 = undef112), par{__disjvr_2^0 -> undef112}>
36.27/36.34	<l12, l7, (0 <= (~(1) + x_10^0)), par{x_10^0 -> (1 + x_10^0)}>
36.27/36.34	<l13, l1, true>
36.27/36.34	
36.27/36.34	Fresh variables:
36.27/36.34	undef5, undef8, undef10, undef15, undef16, undef24, undef29, undef46, undef51, undef52, undef60, undef66, undef91, undef96, undef97, undef105, undef112, 
36.27/36.34	
36.27/36.34	Undef variables:
36.27/36.34	undef5, undef8, undef10, undef15, undef16, undef24, undef29, undef46, undef51, undef52, undef60, undef66, undef91, undef96, undef97, undef105, undef112, 
36.27/36.34	
36.27/36.34	Abstraction variables:
36.27/36.34	
36.27/36.34	Exit nodes:
36.27/36.34	
36.27/36.34	Accepting locations:
36.27/36.34	
36.27/36.34	Asserts:
36.27/36.34	
36.27/36.34	Preprocessed LLVMGraph
36.27/36.34	Init Location: 0
36.27/36.34	Transitions:
36.27/36.34	<l0, l4, (undef5 = undef5) /\ (undef8 = (0 + undef5)) /\ (undef96 = undef96) /\ (undef97 = (0 + undef96)) /\ ((0 + undef97) <= 0) /\ (0 <= (0 + undef97)) /\ (undef91 = undef91), par{x_10^0 -> (0 + undef8)}>
36.27/36.34	<l0, l7, (undef5 = undef5) /\ (undef8 = (0 + undef5)) /\ (undef105 = undef105) /\ (undef112 = __disjvr_2^0) /\ (__disjvr_2^0 = undef112) /\ (0 <= (~(1) + (0 + undef8))), par{__disjvr_2^0 -> undef112, x_10^0 -> (1 + (0 + undef8))}>
36.27/36.34	<l7, l4, (undef51 = undef51) /\ (undef52 = (0 + undef51)) /\ ((0 + undef52) <= 0) /\ (0 <= (0 + undef52)) /\ (undef46 = undef46)>
36.27/36.34	<l7, l7, (undef60 = undef60) /\ (undef66 = __disjvr_1^0) /\ (__disjvr_1^0 = undef66) /\ (0 <= (~(1) + x_10^0)), par{__disjvr_1^0 -> undef66, x_10^0 -> (1 + x_10^0)}>
36.27/36.34	
36.27/36.34	Fresh variables:
36.27/36.34	undef5, undef8, undef10, undef15, undef16, undef24, undef29, undef46, undef51, undef52, undef60, undef66, undef91, undef96, undef97, undef105, undef112, 
36.27/36.34	
36.27/36.34	Undef variables:
36.27/36.34	undef5, undef8, undef10, undef15, undef16, undef24, undef29, undef46, undef51, undef52, undef60, undef66, undef91, undef96, undef97, undef105, undef112, 
36.27/36.34	
36.27/36.34	Abstraction variables:
36.27/36.34	
36.27/36.34	Exit nodes:
36.27/36.34	
36.27/36.34	Accepting locations:
36.27/36.34	
36.27/36.34	Asserts:
36.27/36.34	
36.27/36.34	*************************************************************
36.27/36.34	*******************************************************************************************
36.27/36.34	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
36.27/36.34	*******************************************************************************************
36.27/36.34	
36.27/36.34	Init Location: 0
36.27/36.34	Graph 0:
36.27/36.34	Transitions:
36.27/36.34	Variables:
36.27/36.34	
36.27/36.34	Graph 1:
36.27/36.34	Transitions:
36.27/36.34	<l7, l7, 1 <= x_10^0 /\ __disjvr_1^0 = undef66, {__disjvr_1^0 -> undef66, x_10^0 -> 1 + x_10^0, rest remain the same}>
36.27/36.34	Variables:
36.27/36.34	__disjvr_1^0, x_10^0
36.27/36.34	
36.27/36.34	Graph 2:
36.27/36.34	Transitions:
36.27/36.34	Variables:
36.27/36.34	
36.27/36.34	Precedence: 
36.27/36.34	Graph 0
36.27/36.34	
36.27/36.34	Graph 1
36.27/36.34	<l0, l7, 1 <= undef8 /\ __disjvr_2^0 = undef112 /\ undef5 = undef8, {__disjvr_2^0 -> undef112, x_10^0 -> 1 + undef8, rest remain the same}>
36.27/36.34	
36.27/36.34	Graph 2
36.27/36.34	<l0, l4, undef5 = undef8 /\ undef96 = undef97 /\ undef97 = 0, {x_10^0 -> undef8, rest remain the same}>
36.27/36.34	<l7, l4, undef51 = undef52 /\ undef52 = 0, {all remain the same}>
36.27/36.34	
36.27/36.34	Map Locations to Subgraph:
36.27/36.34	( 0 , 0 )
36.27/36.34	( 4 , 2 )
36.27/36.34	( 7 , 1 )
36.27/36.34	
36.27/36.34	*******************************************************************************************
36.27/36.34	********************************    CHECKING ASSERTIONS    ********************************
36.27/36.34	*******************************************************************************************
36.27/36.34	
36.27/36.34	Proving termination of subgraph 0
36.27/36.34	Proving termination of subgraph 1
36.27/36.34	Checking unfeasibility...
36.27/36.34	Time used: 0.002317
36.27/36.34	
36.27/36.34	Checking conditional termination of SCC {l7}...
36.27/36.34	
36.27/36.34	LOG: CALL solveLinear
36.27/36.34	
36.27/36.34	LOG: RETURN solveLinear - Elapsed time: 0.000609s
36.27/36.34	
36.27/36.34	LOG: CALL solveLinear
36.27/36.34	
36.27/36.34	LOG: RETURN solveLinear - Elapsed time: 0.001868s
36.27/36.34	Trying to remove transition: <l7, l7, 1 <= x_10^0 /\ __disjvr_1^0 = undef66, {__disjvr_1^0 -> undef66, x_10^0 -> 1 + x_10^0, rest remain the same}>
36.27/36.34	Solving with 1 template(s).
36.27/36.34	
36.27/36.34	LOG: CALL solveNonLinearGetFirstSolution
36.27/36.34	
36.27/36.34	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004891s
36.27/36.34	Time used: 0.004733
36.27/36.34	Solving with 1 template(s).
36.27/36.34	
36.27/36.34	LOG: CALL solveNonLinearGetFirstSolution
36.27/36.34	
36.27/36.34	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.004818s
36.27/36.34	Time used: 4.00399
36.27/36.34	Solving with 2 template(s).
36.27/36.34	
36.27/36.34	LOG: CALL solveNonLinearGetFirstSolution
36.27/36.34	
36.27/36.34	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.007096s
36.27/36.34	Time used: 4.00086
36.27/36.34	Solving with 3 template(s).
36.27/36.34	
36.27/36.34	LOG: CALL solveNonLinearGetFirstSolution
36.27/36.34	
36.27/36.34	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.004087s
36.27/36.34	Time used: 1.0004
36.27/36.34	Solving with 1 template(s).
36.27/36.34	
36.27/36.34	LOG: CALL solveNonLinearGetFirstSolution
36.27/36.34	
36.27/36.34	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010070s
36.27/36.34	Time used: 0.00713
36.27/36.34	Improving Solution with cost 1 ...
36.27/36.34	
36.27/36.34	LOG: CALL solveNonLinearGetNextSolution
36.27/36.34	
36.27/36.34	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.013242s
36.27/36.34	Time used: 0.013202
36.27/36.34	
36.27/36.34	LOG: SAT solveNonLinear - Elapsed time: 0.023312s
36.27/36.34	Cost: 1; Total time: 0.020332
36.27/36.34	Quasi-ranking function: 50000 - x_10^0
36.27/36.34	New Graphs: 
36.27/36.34	Transitions:
36.27/36.34	<l7, l7, 50001 <= x_10^0 /\ __disjvr_1^0 = undef66, {__disjvr_1^0 -> undef66, x_10^0 -> 1 + x_10^0, rest remain the same}>
36.27/36.34	Variables:
36.27/36.34	__disjvr_1^0, x_10^0
36.27/36.34	Checking conditional termination of SCC {l7}...
36.27/36.34	
36.27/36.34	LOG: CALL solveLinear
36.27/36.34	
36.27/36.34	LOG: RETURN solveLinear - Elapsed time: 0.000536s
36.27/36.34	
36.27/36.34	LOG: CALL solveLinear
36.27/36.34	
36.27/36.34	LOG: RETURN solveLinear - Elapsed time: 0.001845s
36.27/36.34	Trying to remove transition: <l7, l7, 50001 <= x_10^0 /\ __disjvr_1^0 = undef66, {__disjvr_1^0 -> undef66, x_10^0 -> 1 + x_10^0, rest remain the same}>
36.27/36.34	Solving with 1 template(s).
36.27/36.34	
36.27/36.34	LOG: CALL solveNonLinearGetFirstSolution
36.27/36.34	
36.27/36.34	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004815s
36.27/36.34	Time used: 0.004669
36.27/36.34	Solving with 1 template(s).
36.27/36.34	
36.27/36.34	LOG: CALL solveNonLinearGetFirstSolution
36.27/36.34	
36.27/36.34	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002656s
36.27/36.34	Time used: 4.00148
36.27/36.34	Solving with 2 template(s).
36.27/36.34	
36.27/36.34	LOG: CALL solveNonLinearGetFirstSolution
36.27/36.34	
36.27/36.34	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005331s
36.27/36.34	Time used: 4.00071
36.27/36.34	Solving with 3 template(s).
36.27/36.34	
36.27/36.34	LOG: CALL solveNonLinearGetFirstSolution
36.27/36.34	
36.27/36.34	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.004185s
36.27/36.34	Time used: 1.00037
36.27/36.34	Solving with 1 template(s).
36.27/36.34	
36.27/36.34	LOG: CALL solveNonLinearGetFirstSolution
36.27/36.34	
36.27/36.34	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010549s
36.27/36.34	Time used: 0.007083
36.27/36.34	Improving Solution with cost 1 ...
36.27/36.34	
36.27/36.34	LOG: CALL solveNonLinearGetNextSolution
36.27/36.34	
36.27/36.34	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.015346s
36.27/36.34	Time used: 0.015339
36.27/36.34	
36.27/36.34	LOG: SAT solveNonLinear - Elapsed time: 0.025895s
36.27/36.34	Cost: 1; Total time: 0.022422
36.27/36.34	Quasi-ranking function: 50000 + __disjvr_1^0 - x_10^0
36.27/36.34	New Graphs: 
36.27/36.34	Transitions:
36.27/36.34	<l7, l7, 50001 + __disjvr_1^0 <= x_10^0 /\ 50001 <= x_10^0 /\ __disjvr_1^0 = undef66, {__disjvr_1^0 -> undef66, x_10^0 -> 1 + x_10^0, rest remain the same}>
36.27/36.34	Variables:
36.27/36.34	__disjvr_1^0, x_10^0
36.27/36.34	Checking conditional termination of SCC {l7}...
36.27/36.34	
36.27/36.34	LOG: CALL solveLinear
36.27/36.34	
36.27/36.34	LOG: RETURN solveLinear - Elapsed time: 0.000673s
36.27/36.34	
36.27/36.34	LOG: CALL solveLinear
36.27/36.34	
36.27/36.34	LOG: RETURN solveLinear - Elapsed time: 0.002591s
36.27/36.34	Trying to remove transition: <l7, l7, 50001 + __disjvr_1^0 <= x_10^0 /\ 50001 <= x_10^0 /\ __disjvr_1^0 = undef66, {__disjvr_1^0 -> undef66, x_10^0 -> 1 + x_10^0, rest remain the same}>
36.27/36.34	Solving with 1 template(s).
36.27/36.34	
36.27/36.34	LOG: CALL solveNonLinearGetFirstSolution
36.27/36.34	
36.27/36.34	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005350s
36.27/36.34	Time used: 0.005167
36.27/36.34	Solving with 1 template(s).
36.27/36.34	
36.27/36.34	LOG: CALL solveNonLinearGetFirstSolution
36.27/36.34	
36.27/36.34	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.003328s
36.27/36.34	Time used: 4.00276
36.27/36.34	Solving with 2 template(s).
36.27/36.34	
36.27/36.34	LOG: CALL solveNonLinearGetFirstSolution
36.27/36.34	
36.27/36.34	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.022770s
36.27/36.34	Time used: 4.01676
36.27/36.34	Solving with 3 template(s).
36.27/36.34	
36.27/36.34	LOG: CALL solveNonLinearGetFirstSolution
36.27/36.34	
36.27/36.34	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.004935s
36.27/36.34	Time used: 1.00098
36.27/36.34	Solving with 1 template(s).
36.27/36.34	
36.27/36.34	LOG: CALL solveNonLinearGetFirstSolution
36.27/36.34	
36.27/36.34	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011798s
36.27/36.34	Time used: 0.008561
36.27/36.34	Improving Solution with cost 1 ...
36.27/36.34	
36.27/36.34	LOG: CALL solveNonLinearGetNextSolution
36.27/36.34	
36.27/36.34	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.017323s
36.27/36.34	Time used: 0.017304
36.27/36.34	
36.27/36.34	LOG: SAT solveNonLinear - Elapsed time: 0.029121s
36.27/36.34	Cost: 1; Total time: 0.025865
36.27/36.34	Termination implied by a set of invariant(s):
36.27/36.34	Invariant at l7: 1 <= x_10^0
36.27/36.34	[ Invariant Graph ]
36.27/36.34	Strengthening and disabling transitions...
36.27/36.34	
36.27/36.34	LOG: CALL solverLinear in Graph for feasibility
36.27/36.34	
36.27/36.34	LOG: RETURN solveLinear in Graph for feasibility
36.27/36.34	Strengthening transition (result): 
36.27/36.34	<l7, l7, 1 <= x_10^0 /\ __disjvr_1^0 = undef66, {__disjvr_1^0 -> undef66, x_10^0 -> 1 + x_10^0, rest remain the same}>
36.27/36.34	[ Termination Graph ]
36.27/36.34	Strengthening and disabling transitions...
36.27/36.34	
36.27/36.34	LOG: CALL solverLinear in Graph for feasibility
36.27/36.34	
36.27/36.34	LOG: RETURN solveLinear in Graph for feasibility
36.27/36.34	Strengthening transition (result): 
36.27/36.34	<l7, l7, 50001 + __disjvr_1^0 <= x_10^0 /\ 50001 <= x_10^0 /\ __disjvr_1^0 = undef66, {__disjvr_1^0 -> undef66, x_10^0 -> 1 + x_10^0, rest remain the same}>
36.27/36.34	Quasi-ranking function: 50000 - __disjvr_1^0 - x_10^0
36.27/36.34	New Graphs: 
36.27/36.34	Transitions:
36.27/36.34	<l7, l7, 50001 + __disjvr_1^0 <= x_10^0 /\ 50001 <= __disjvr_1^0 + x_10^0 /\ 50001 <= x_10^0 /\ __disjvr_1^0 = undef66, {__disjvr_1^0 -> undef66, x_10^0 -> 1 + x_10^0, rest remain the same}>
36.27/36.34	Variables:
36.27/36.34	__disjvr_1^0, x_10^0
36.27/36.34	Checking conditional termination of SCC {l7}...
36.27/36.34	
36.27/36.34	LOG: CALL solveLinear
36.27/36.34	
36.27/36.34	LOG: RETURN solveLinear - Elapsed time: 0.000754s
36.27/36.34	
36.27/36.34	LOG: CALL solveLinear
36.27/36.34	
36.27/36.34	LOG: RETURN solveLinear - Elapsed time: 0.002976s
36.27/36.34	Trying to remove transition: <l7, l7, 50001 + __disjvr_1^0 <= x_10^0 /\ 50001 <= __disjvr_1^0 + x_10^0 /\ 50001 <= x_10^0 /\ __disjvr_1^0 = undef66, {__disjvr_1^0 -> undef66, x_10^0 -> 1 + x_10^0, rest remain the same}>
36.27/36.34	Solving with 1 template(s).
36.27/36.34	
36.27/36.34	LOG: CALL solveNonLinearGetFirstSolution
36.27/36.34	
36.27/36.34	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006389s
36.27/36.34	Time used: 0.006206
36.27/36.34	Solving with 1 template(s).
36.27/36.34	
36.27/36.34	LOG: CALL solveNonLinearGetFirstSolution
36.27/36.34	
36.27/36.34	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002339s
36.27/36.34	Time used: 4.00177
36.27/36.34	Solving with 2 template(s).
36.27/36.34	
36.27/36.34	LOG: CALL solveNonLinearGetFirstSolution
36.27/36.34	
36.27/36.34	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.006135s
36.27/36.34	Time used: 4.00108
36.27/36.34	Solving with 3 template(s).
36.27/36.34	
36.27/36.34	LOG: CALL solveNonLinearGetFirstSolution
36.27/36.34	
36.27/36.34	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.004903s
36.27/36.34	Time used: 1.00098
36.27/36.34	Solving with 1 template(s).
36.27/36.34	
36.27/36.34	LOG: CALL solveNonLinearGetFirstSolution
36.27/36.34	
36.27/36.34	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012423s
36.27/36.34	Time used: 0.009099
36.27/36.34	Termination failed. Trying to show unreachability...
36.27/36.34	Proving unreachability of entry: <l0, l7, 1 <= undef8 /\ __disjvr_2^0 = undef112 /\ undef5 = undef8, {__disjvr_2^0 -> undef112, x_10^0 -> 1 + undef8, rest remain the same}>
36.27/36.34	
36.27/36.34	LOG: CALL check - Post:1 <= 0 - Process 1
36.27/36.34	* Exit transition: <l0, l7, 1 <= undef8 /\ __disjvr_2^0 = undef112 /\ undef5 = undef8, {__disjvr_2^0 -> undef112, x_10^0 -> 1 + undef8, rest remain the same}>
36.27/36.34	* Postcondition  : 1 <= 0
36.27/36.34	
36.27/36.34	LOG: CALL solveLinear
36.27/36.34	
36.27/36.34	LOG: RETURN solveLinear - Elapsed time: 0.001344s
36.27/36.34	> Postcondition is not implied!
36.27/36.34	
36.27/36.34	LOG: RETURN check - Elapsed time: 0.001448s
36.27/36.34	Cannot prove unreachability
36.27/36.34	
36.27/36.34	Proving non-termination of subgraph 1
36.27/36.34	Transitions:
36.27/36.34	<l7, l7, 1 <= x_10^0 /\ __disjvr_1^0 = undef66, {__disjvr_1^0 -> undef66, x_10^0 -> 1 + x_10^0, rest remain the same}>
36.27/36.34	Variables:
36.27/36.34	__disjvr_1^0, x_10^0
36.27/36.34	
36.27/36.34	Checking that every undef value has an assignment...
36.27/36.34	
36.27/36.34	LOG: CALL solveLinear
36.27/36.34	
36.27/36.34	LOG: RETURN solveLinear - Elapsed time: 0.001016s
36.27/36.34	Checking conditional non-termination of SCC {l7}...
36.27/36.34	EXIT TRANSITIONS:
36.27/36.34	<l7, end, x_10^0 <= 0, {all remain the same}>
36.27/36.34	
36.27/36.34	Solving with 1 template(s).
36.27/36.34	
36.27/36.34	LOG: CALL solveNonLinearGetFirstSolution
36.27/36.34	
36.27/36.34	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.014997s
36.27/36.34	Time used: 0.014886
36.27/36.34	
36.27/36.34	LOG: SAT solveNonLinear - Elapsed time: 0.014997s
36.27/36.34	Cost: 0; Total time: 0.014886
36.27/36.34	Minimizing number of undef constraints...
36.27/36.34	
36.27/36.34	LOG: CALL solveNonLinear
36.27/36.34	
36.27/36.34	LOG: RETURN solveNonLinear - Elapsed time: 0.003762s
36.27/36.34	Number of undef constraints reduced!
36.27/36.34	
36.27/36.34	Non-termination implied by a set of quasi-invariant(s):
36.27/36.34	Quasi-invariant at l7: 1 <= x_10^0
36.27/36.34	
36.27/36.34	Strengthening and disabling EXIT transitions...
36.27/36.34	Closed exits from l7: 1
36.27/36.34	
36.27/36.34	Strengthening and disabling transitions...
36.27/36.34	
36.27/36.34	LOG: CALL solverLinear in Graph for feasibility
36.27/36.34	
36.27/36.34	LOG: RETURN solveLinear in Graph for feasibility
36.27/36.34	Strengthening transition (result): 
36.27/36.34	<l7, l7, 1 <= x_10^0 /\ __disjvr_1^0 = undef66, {__disjvr_1^0 -> undef66, x_10^0 -> 1 + x_10^0, rest remain the same}>
36.27/36.34	
36.27/36.34	Calling reachability with...
36.27/36.34	Transition: <l7, end, true, {all remain the same}>
36.27/36.34	Conditions: 1 <= x_10^0, 
36.27/36.34	OPEN EXITS: 
36.27/36.34	<l7, end, 1 <= x_10^0, {all remain the same}>
36.27/36.34	
36.27/36.34	--- Reachability graph ---
36.27/36.34	> Graph without transitions.
36.27/36.34	
36.27/36.34	Calling reachability with...
36.27/36.34	Transition: <l0, l7, 1 <= undef8 /\ __disjvr_2^0 = undef112 /\ undef5 = undef8, {__disjvr_2^0 -> undef112, x_10^0 -> 1 + undef8, rest remain the same}>
36.27/36.34	Conditions: 1 <= x_10^0, 
36.27/36.34	OPEN EXITS: 
36.27/36.34	<l0, l7, 1 <= undef8 /\ __disjvr_2^0 = undef112 /\ undef5 = undef8, {__disjvr_2^0 -> undef112, x_10^0 -> 1 + undef8, rest remain the same}>
36.27/36.34	
36.27/36.34	> Conditions are reachable!
36.27/36.34	
36.27/36.34	Program does NOT terminate
36.27/36.34	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
36.27/36.34	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
36.27/36.34	EOF