36.82/36.96	NO
36.82/36.96	
36.82/36.96	Solver Timeout: 4
36.82/36.96	Global Timeout: 300
36.82/36.96	No parsing errors!
36.82/36.96	Init Location: 0
36.82/36.96	Transitions:
36.82/36.96	<l0, l19, true>
36.82/36.96	<l1, l2, ((2 + (~(1) * x_6^0)) <= 0) /\ (0 <= (2 + (~(1) * w_5^0))), par{w_5^0 -> (1 + w_5^0), x_6^0 -> (1 + x_6^0)}>
36.82/36.96	<l2, l3, ((1 + x_6^0) <= 2)>
36.82/36.96	<l2, l3, (3 <= (0 + x_6^0))>
36.82/36.96	<l3, l4, ((1 + w_5^0) <= 2)>
36.82/36.96	<l3, l4, (3 <= (0 + w_5^0))>
36.82/36.96	<l4, l1, true>
36.82/36.96	<l1, l5, ((2 + (~(1) * x_6^0)) <= 0) /\ (0 <= (2 + (~(1) * w_5^0))), par{w_5^0 -> (1 + w_5^0), x_6^0 -> (1 + x_6^0)}>
36.82/36.96	<l5, l6, ((1 + x_6^0) <= 2)>
36.82/36.96	<l5, l6, (3 <= (0 + x_6^0))>
36.82/36.96	<l6, l7, ((0 + w_5^0) <= 2) /\ (2 <= (0 + w_5^0)), par{w_5^0 -> 1}>
36.82/36.96	<l7, l1, true>
36.82/36.96	<l1, l8, (0 <= (1 + (~(1) * x_6^0))), par{w_5^0 -> (1 + w_5^0), x_6^0 -> (1 + x_6^0)}>
36.82/36.96	<l8, l9, ((1 + x_6^0) <= 2)>
36.82/36.96	<l8, l9, (3 <= (0 + x_6^0))>
36.82/36.96	<l9, l10, ((1 + w_5^0) <= 2)>
36.82/36.96	<l9, l10, (3 <= (0 + w_5^0))>
36.82/36.96	<l10, l1, true>
36.82/36.96	<l1, l11, (0 <= (1 + (~(1) * x_6^0))), par{w_5^0 -> (1 + w_5^0), x_6^0 -> (1 + x_6^0)}>
36.82/36.96	<l11, l12, ((1 + x_6^0) <= 2)>
36.82/36.96	<l11, l12, (3 <= (0 + x_6^0))>
36.82/36.96	<l12, l13, ((0 + w_5^0) <= 2) /\ (2 <= (0 + w_5^0)), par{w_5^0 -> 1}>
36.82/36.96	<l13, l1, true>
36.82/36.96	<l1, l14, (0 <= (1 + (~(1) * x_6^0))) /\ (undef69 = (1 + x_6^0)) /\ ((0 + undef69) <= 2) /\ (2 <= (0 + undef69)), par{w_5^0 -> (1 + w_5^0), x_6^0 -> undef69}>
36.82/36.96	<l14, l15, ((1 + w_5^0) <= 2)>
36.82/36.96	<l14, l15, (3 <= (0 + w_5^0))>
36.82/36.96	<l15, l1, true>
36.82/36.96	<l1, l16, (0 <= (1 + (~(1) * x_6^0))) /\ (undef81 = (1 + x_6^0)) /\ (undef82 = (1 + w_5^0)) /\ ((0 + undef81) <= 2) /\ (2 <= (0 + undef81)) /\ ((0 + undef82) <= 2) /\ (2 <= (0 + undef82)), par{w_5^0 -> 1, x_6^0 -> undef81}>
36.82/36.96	<l16, l1, true>
36.82/36.96	<l1, l17, ((2 + (~(1) * x_6^0)) <= 0) /\ ((3 + (~(1) * w_5^0)) <= 0) /\ (undef86 = undef86), par{Result_4^0 -> undef86}>
36.82/36.96	<l18, l1, true>
36.82/36.96	<l19, l18, true>
36.82/36.96	
36.82/36.96	Fresh variables:
36.82/36.96	undef69, undef81, undef82, undef86, 
36.82/36.96	
36.82/36.96	Undef variables:
36.82/36.96	undef69, undef81, undef82, undef86, 
36.82/36.96	
36.82/36.96	Abstraction variables:
36.82/36.96	
36.82/36.96	Exit nodes:
36.82/36.96	
36.82/36.96	Accepting locations:
36.82/36.96	
36.82/36.96	Asserts:
36.82/36.96	
36.82/36.96	Preprocessed LLVMGraph
36.82/36.96	Init Location: 0
36.82/36.96	Transitions:
36.82/36.96	<l0, l1, true>
36.82/36.96	<l1, l1, ((2 + (~(1) * x_6^0)) <= 0) /\ (0 <= (2 + (~(1) * w_5^0))) /\ (3 <= (0 + (1 + x_6^0))) /\ ((1 + (1 + w_5^0)) <= 2), par{w_5^0 -> (1 + w_5^0), x_6^0 -> (1 + x_6^0)}>
36.82/36.96	<l1, l1, ((2 + (~(1) * x_6^0)) <= 0) /\ (0 <= (2 + (~(1) * w_5^0))) /\ (3 <= (0 + (1 + x_6^0))) /\ (3 <= (0 + (1 + w_5^0))), par{w_5^0 -> (1 + w_5^0), x_6^0 -> (1 + x_6^0)}>
36.82/36.96	<l1, l1, ((2 + (~(1) * x_6^0)) <= 0) /\ (0 <= (2 + (~(1) * w_5^0))) /\ (3 <= (0 + (1 + x_6^0))) /\ ((0 + (1 + w_5^0)) <= 2) /\ (2 <= (0 + (1 + w_5^0))), par{w_5^0 -> 1, x_6^0 -> (1 + x_6^0)}>
36.82/36.96	<l1, l1, (0 <= (1 + (~(1) * x_6^0))) /\ ((1 + (1 + x_6^0)) <= 2) /\ ((1 + (1 + w_5^0)) <= 2), par{w_5^0 -> (1 + w_5^0), x_6^0 -> (1 + x_6^0)}>
36.82/36.96	<l1, l1, (0 <= (1 + (~(1) * x_6^0))) /\ ((1 + (1 + x_6^0)) <= 2) /\ (3 <= (0 + (1 + w_5^0))), par{w_5^0 -> (1 + w_5^0), x_6^0 -> (1 + x_6^0)}>
36.82/36.96	<l1, l1, (0 <= (1 + (~(1) * x_6^0))) /\ ((1 + (1 + x_6^0)) <= 2) /\ ((0 + (1 + w_5^0)) <= 2) /\ (2 <= (0 + (1 + w_5^0))), par{w_5^0 -> 1, x_6^0 -> (1 + x_6^0)}>
36.82/36.96	<l1, l1, (0 <= (1 + (~(1) * x_6^0))) /\ (undef69 = (1 + x_6^0)) /\ ((0 + undef69) <= 2) /\ (2 <= (0 + undef69)) /\ ((1 + (1 + w_5^0)) <= 2), par{w_5^0 -> (1 + w_5^0), x_6^0 -> undef69}>
36.82/36.96	<l1, l1, (0 <= (1 + (~(1) * x_6^0))) /\ (undef69 = (1 + x_6^0)) /\ ((0 + undef69) <= 2) /\ (2 <= (0 + undef69)) /\ (3 <= (0 + (1 + w_5^0))), par{w_5^0 -> (1 + w_5^0), x_6^0 -> undef69}>
36.82/36.96	<l1, l1, (0 <= (1 + (~(1) * x_6^0))) /\ (undef81 = (1 + x_6^0)) /\ (undef82 = (1 + w_5^0)) /\ ((0 + undef81) <= 2) /\ (2 <= (0 + undef81)) /\ ((0 + undef82) <= 2) /\ (2 <= (0 + undef82)), par{w_5^0 -> 1, x_6^0 -> undef81}>
36.82/36.96	<l1, l17, ((2 + (~(1) * x_6^0)) <= 0) /\ ((3 + (~(1) * w_5^0)) <= 0) /\ (undef86 = undef86)>
36.82/36.96	
36.82/36.96	Fresh variables:
36.82/36.96	undef69, undef81, undef82, undef86, 
36.82/36.96	
36.82/36.96	Undef variables:
36.82/36.96	undef69, undef81, undef82, undef86, 
36.82/36.96	
36.82/36.96	Abstraction variables:
36.82/36.96	
36.82/36.96	Exit nodes:
36.82/36.96	
36.82/36.96	Accepting locations:
36.82/36.96	
36.82/36.96	Asserts:
36.82/36.96	
36.82/36.96	*************************************************************
36.82/36.96	*******************************************************************************************
36.82/36.96	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
36.82/36.96	*******************************************************************************************
36.82/36.96	
36.82/36.96	Init Location: 0
36.82/36.96	Graph 0:
36.82/36.96	Transitions:
36.82/36.96	Variables:
36.82/36.96	
36.82/36.96	Graph 1:
36.82/36.96	Transitions:
36.82/36.96	<l1, l1, 2 <= x_6^0 /\ w_5^0 <= 0, {w_5^0 -> 1 + w_5^0, x_6^0 -> 1 + x_6^0, rest remain the same}>
36.82/36.96	<l1, l1, 2 <= x_6^0 /\ w_5^0 = 2, {w_5^0 -> 1 + w_5^0, x_6^0 -> 1 + x_6^0, rest remain the same}>
36.82/36.96	<l1, l1, 2 <= x_6^0 /\ w_5^0 = 1, {w_5^0 -> 1, x_6^0 -> 1 + x_6^0, rest remain the same}>
36.82/36.96	<l1, l1, w_5^0 <= 0 /\ x_6^0 <= 0, {w_5^0 -> 1 + w_5^0, x_6^0 -> 1 + x_6^0, rest remain the same}>
36.82/36.96	<l1, l1, 2 <= w_5^0 /\ x_6^0 <= 0, {w_5^0 -> 1 + w_5^0, x_6^0 -> 1 + x_6^0, rest remain the same}>
36.82/36.96	<l1, l1, x_6^0 <= 0 /\ w_5^0 = 1, {w_5^0 -> 1, x_6^0 -> 1 + x_6^0, rest remain the same}>
36.82/36.96	<l1, l1, x_6^0 <= 1 /\ w_5^0 <= 0 /\ 1 + x_6^0 = undef69 /\ undef69 = 2, {w_5^0 -> 1 + w_5^0, x_6^0 -> undef69, rest remain the same}>
36.82/36.96	<l1, l1, 2 <= w_5^0 /\ x_6^0 <= 1 /\ 1 + x_6^0 = undef69 /\ undef69 = 2, {w_5^0 -> 1 + w_5^0, x_6^0 -> undef69, rest remain the same}>
36.82/36.96	<l1, l1, x_6^0 <= 1 /\ 1 + w_5^0 = undef82 /\ 1 + x_6^0 = undef81 /\ undef81 = 2 /\ undef82 = 2, {w_5^0 -> 1, x_6^0 -> undef81, rest remain the same}>
36.82/36.96	Variables:
36.82/36.96	w_5^0, x_6^0
36.82/36.96	
36.82/36.96	Graph 2:
36.82/36.96	Transitions:
36.82/36.96	Variables:
36.82/36.96	
36.82/36.96	Precedence: 
36.82/36.96	Graph 0
36.82/36.96	
36.82/36.96	Graph 1
36.82/36.96	<l0, l1, true, {all remain the same}>
36.82/36.96	
36.82/36.96	Graph 2
36.82/36.96	<l1, l17, 2 <= x_6^0 /\ 3 <= w_5^0, {all remain the same}>
36.82/36.96	
36.82/36.96	Map Locations to Subgraph:
36.82/36.96	( 0 , 0 )
36.82/36.96	( 1 , 1 )
36.82/36.96	( 17 , 2 )
36.82/36.96	
36.82/36.96	*******************************************************************************************
36.82/36.96	********************************    CHECKING ASSERTIONS    ********************************
36.82/36.96	*******************************************************************************************
36.82/36.96	
36.82/36.96	Proving termination of subgraph 0
36.82/36.96	Proving termination of subgraph 1
36.82/36.96	Checking unfeasibility...
36.82/36.96	Time used: 0.022428
36.82/36.96	
36.82/36.96	Checking conditional termination of SCC {l1}...
36.82/36.96	
36.82/36.96	LOG: CALL solveLinear
36.82/36.96	
36.82/36.96	LOG: RETURN solveLinear - Elapsed time: 0.005143s
36.82/36.96	Ranking function: -7*w_5^0
36.82/36.96	New Graphs: 
36.82/36.96	Transitions:
36.82/36.96	<l1, l1, 2 <= x_6^0 /\ w_5^0 = 2, {w_5^0 -> 1 + w_5^0, x_6^0 -> 1 + x_6^0, rest remain the same}>
36.82/36.96	<l1, l1, 2 <= x_6^0 /\ w_5^0 = 1, {w_5^0 -> 1, x_6^0 -> 1 + x_6^0, rest remain the same}>
36.82/36.96	<l1, l1, 2 <= w_5^0 /\ x_6^0 <= 0, {w_5^0 -> 1 + w_5^0, x_6^0 -> 1 + x_6^0, rest remain the same}>
36.82/36.96	<l1, l1, x_6^0 <= 0 /\ w_5^0 = 1, {w_5^0 -> 1, x_6^0 -> 1 + x_6^0, rest remain the same}>
36.82/36.96	<l1, l1, 2 <= w_5^0 /\ x_6^0 <= 1 /\ 1 + x_6^0 = undef69 /\ undef69 = 2, {w_5^0 -> 1 + w_5^0, x_6^0 -> undef69, rest remain the same}>
36.82/36.96	<l1, l1, x_6^0 <= 1 /\ 1 + w_5^0 = undef82 /\ 1 + x_6^0 = undef81 /\ undef81 = 2 /\ undef82 = 2, {w_5^0 -> 1, x_6^0 -> undef81, rest remain the same}>
36.82/36.96	Variables:
36.82/36.96	w_5^0, x_6^0
36.82/36.96	Checking conditional termination of SCC {l1}...
36.82/36.96	
36.82/36.96	LOG: CALL solveLinear
36.82/36.96	
36.82/36.96	LOG: RETURN solveLinear - Elapsed time: 0.002881s
36.82/36.96	Ranking function: -4 + 2*w_5^0 - 6*x_6^0
36.82/36.96	New Graphs: 
36.82/36.96	Transitions:
36.82/36.96	<l1, l1, 2 <= x_6^0 /\ w_5^0 = 2, {w_5^0 -> 1 + w_5^0, x_6^0 -> 1 + x_6^0, rest remain the same}>
36.82/36.96	<l1, l1, 2 <= x_6^0 /\ w_5^0 = 1, {w_5^0 -> 1, x_6^0 -> 1 + x_6^0, rest remain the same}>
36.82/36.96	<l1, l1, x_6^0 <= 0 /\ w_5^0 = 1, {w_5^0 -> 1, x_6^0 -> 1 + x_6^0, rest remain the same}>
36.82/36.96	<l1, l1, 2 <= w_5^0 /\ x_6^0 <= 1 /\ 1 + x_6^0 = undef69 /\ undef69 = 2, {w_5^0 -> 1 + w_5^0, x_6^0 -> undef69, rest remain the same}>
36.82/36.96	<l1, l1, x_6^0 <= 1 /\ 1 + w_5^0 = undef82 /\ 1 + x_6^0 = undef81 /\ undef81 = 2 /\ undef82 = 2, {w_5^0 -> 1, x_6^0 -> undef81, rest remain the same}>
36.82/36.96	Variables:
36.82/36.96	w_5^0, x_6^0
36.82/36.96	Checking conditional termination of SCC {l1}...
36.82/36.96	
36.82/36.96	LOG: CALL solveLinear
36.82/36.96	
36.82/36.96	LOG: RETURN solveLinear - Elapsed time: 0.002519s
36.82/36.96	Ranking function: 4 - 2*w_5^0
36.82/36.96	New Graphs: 
36.82/36.96	Transitions:
36.82/36.96	<l1, l1, 2 <= x_6^0 /\ w_5^0 = 1, {w_5^0 -> 1, x_6^0 -> 1 + x_6^0, rest remain the same}>
36.82/36.96	<l1, l1, x_6^0 <= 0 /\ w_5^0 = 1, {w_5^0 -> 1, x_6^0 -> 1 + x_6^0, rest remain the same}>
36.82/36.96	<l1, l1, 2 <= w_5^0 /\ x_6^0 <= 1 /\ 1 + x_6^0 = undef69 /\ undef69 = 2, {w_5^0 -> 1 + w_5^0, x_6^0 -> undef69, rest remain the same}>
36.82/36.96	<l1, l1, x_6^0 <= 1 /\ 1 + w_5^0 = undef82 /\ 1 + x_6^0 = undef81 /\ undef81 = 2 /\ undef82 = 2, {w_5^0 -> 1, x_6^0 -> undef81, rest remain the same}>
36.82/36.96	Variables:
36.82/36.96	w_5^0, x_6^0
36.82/36.96	Checking conditional termination of SCC {l1}...
36.82/36.96	
36.82/36.96	LOG: CALL solveLinear
36.82/36.96	
36.82/36.96	LOG: RETURN solveLinear - Elapsed time: 0.002197s
36.82/36.96	Ranking function: 2 - 2*w_5^0 - 7*x_6^0
36.82/36.96	New Graphs: 
36.82/36.96	Transitions:
36.82/36.96	<l1, l1, 2 <= x_6^0 /\ w_5^0 = 1, {w_5^0 -> 1, x_6^0 -> 1 + x_6^0, rest remain the same}>
36.82/36.96	<l1, l1, 2 <= w_5^0 /\ x_6^0 <= 1 /\ 1 + x_6^0 = undef69 /\ undef69 = 2, {w_5^0 -> 1 + w_5^0, x_6^0 -> undef69, rest remain the same}>
36.82/36.96	<l1, l1, x_6^0 <= 1 /\ 1 + w_5^0 = undef82 /\ 1 + x_6^0 = undef81 /\ undef81 = 2 /\ undef82 = 2, {w_5^0 -> 1, x_6^0 -> undef81, rest remain the same}>
36.82/36.96	Variables:
36.82/36.96	w_5^0, x_6^0
36.82/36.96	Checking conditional termination of SCC {l1}...
36.82/36.96	
36.82/36.96	LOG: CALL solveLinear
36.82/36.96	
36.82/36.96	LOG: RETURN solveLinear - Elapsed time: 0.001928s
36.82/36.96	Ranking function: -6 + 7*w_5^0 - 8*x_6^0
36.82/36.96	New Graphs: 
36.82/36.96	Transitions:
36.82/36.96	<l1, l1, 2 <= x_6^0 /\ w_5^0 = 1, {w_5^0 -> 1, x_6^0 -> 1 + x_6^0, rest remain the same}>
36.82/36.96	<l1, l1, x_6^0 <= 1 /\ 1 + w_5^0 = undef82 /\ 1 + x_6^0 = undef81 /\ undef81 = 2 /\ undef82 = 2, {w_5^0 -> 1, x_6^0 -> undef81, rest remain the same}>
36.82/36.96	Variables:
36.82/36.96	w_5^0, x_6^0
36.82/36.96	Checking conditional termination of SCC {l1}...
36.82/36.96	
36.82/36.96	LOG: CALL solveLinear
36.82/36.96	
36.82/36.96	LOG: RETURN solveLinear - Elapsed time: 0.001431s
36.82/36.96	Ranking function: 4 - 4*x_6^0
36.82/36.96	New Graphs: 
36.82/36.96	Transitions:
36.82/36.96	<l1, l1, 2 <= x_6^0 /\ w_5^0 = 1, {w_5^0 -> 1, x_6^0 -> 1 + x_6^0, rest remain the same}>
36.82/36.96	Variables:
36.82/36.96	w_5^0, x_6^0
36.82/36.96	Checking conditional termination of SCC {l1}...
36.82/36.96	
36.82/36.96	LOG: CALL solveLinear
36.82/36.96	
36.82/36.96	LOG: RETURN solveLinear - Elapsed time: 0.000515s
36.82/36.96	
36.82/36.96	LOG: CALL solveLinear
36.82/36.96	
36.82/36.96	LOG: RETURN solveLinear - Elapsed time: 0.001670s
36.82/36.96	Trying to remove transition: <l1, l1, 2 <= x_6^0 /\ w_5^0 = 1, {w_5^0 -> 1, x_6^0 -> 1 + x_6^0, rest remain the same}>
36.82/36.96	Solving with 1 template(s).
36.82/36.96	
36.82/36.96	LOG: CALL solveNonLinearGetFirstSolution
36.82/36.96	
36.82/36.96	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005868s
36.82/36.96	Time used: 0.005732
36.82/36.96	Solving with 1 template(s).
36.82/36.96	
36.82/36.96	LOG: CALL solveNonLinearGetFirstSolution
36.82/36.96	
36.82/36.96	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.059506s
36.82/36.96	Time used: 0.058995
36.82/36.96	Improving Solution with cost 1 ...
36.82/36.96	
36.82/36.96	LOG: CALL solveNonLinearGetNextSolution
36.82/36.96	
36.82/36.96	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.074379s
36.82/36.96	Time used: 0.074376
36.82/36.96	
36.82/36.96	LOG: SAT solveNonLinear - Elapsed time: 0.133885s
36.82/36.96	Cost: 1; Total time: 0.133371
36.82/36.96	Failed at location 1: 2 <= w_5^0
36.82/36.96	Before Improving: 
36.82/36.96	Quasi-invariant at l1: 2 <= w_5^0
36.82/36.96	Optimizing invariants...
36.82/36.96	
36.82/36.96	LOG: CALL solveLinear
36.82/36.96	
36.82/36.96	LOG: RETURN solveLinear - Elapsed time: 0.011632s
36.82/36.96	Remaining time after improvement: 0.997383
36.82/36.96	Termination implied by a set of quasi-invariant(s):
36.82/36.96	Quasi-invariant at l1: 2 <= w_5^0
36.82/36.96	[ Invariant Graph ]
36.82/36.96	Strengthening and disabling transitions...
36.82/36.96	
36.82/36.96	LOG: CALL solverLinear in Graph for feasibility
36.82/36.96	
36.82/36.96	LOG: RETURN solveLinear in Graph for feasibility
36.82/36.96	It's unfeasible. Removing transition: 
36.82/36.96	<l1, l1, 2 <= x_6^0 /\ w_5^0 <= 0, {w_5^0 -> 1 + w_5^0, x_6^0 -> 1 + x_6^0, rest remain the same}>
36.82/36.96	
36.82/36.96	LOG: CALL solverLinear in Graph for feasibility
36.82/36.96	
36.82/36.96	LOG: RETURN solveLinear in Graph for feasibility
36.82/36.96	Strengthening transition (result): 
36.82/36.96	<l1, l1, 2 <= x_6^0 /\ w_5^0 = 2, {w_5^0 -> 1 + w_5^0, x_6^0 -> 1 + x_6^0, rest remain the same}>
36.82/36.96	
36.82/36.96	LOG: CALL solverLinear in Graph for feasibility
36.82/36.96	
36.82/36.96	LOG: RETURN solveLinear in Graph for feasibility
36.82/36.96	It's unfeasible. Removing transition: 
36.82/36.96	<l1, l1, 2 <= x_6^0 /\ w_5^0 = 1, {w_5^0 -> 1, x_6^0 -> 1 + x_6^0, rest remain the same}>
36.82/36.96	
36.82/36.96	LOG: CALL solverLinear in Graph for feasibility
36.82/36.96	
36.82/36.96	LOG: RETURN solveLinear in Graph for feasibility
36.82/36.96	It's unfeasible. Removing transition: 
36.82/36.96	<l1, l1, w_5^0 <= 0 /\ x_6^0 <= 0, {w_5^0 -> 1 + w_5^0, x_6^0 -> 1 + x_6^0, rest remain the same}>
36.82/36.96	
36.82/36.96	LOG: CALL solverLinear in Graph for feasibility
36.82/36.96	
36.82/36.96	LOG: RETURN solveLinear in Graph for feasibility
36.82/36.96	Strengthening transition (result): 
36.82/36.96	<l1, l1, 2 <= w_5^0 /\ x_6^0 <= 0, {w_5^0 -> 1 + w_5^0, x_6^0 -> 1 + x_6^0, rest remain the same}>
36.82/36.96	
36.82/36.96	LOG: CALL solverLinear in Graph for feasibility
36.82/36.96	
36.82/36.96	LOG: RETURN solveLinear in Graph for feasibility
36.82/36.96	It's unfeasible. Removing transition: 
36.82/36.96	<l1, l1, x_6^0 <= 0 /\ w_5^0 = 1, {w_5^0 -> 1, x_6^0 -> 1 + x_6^0, rest remain the same}>
36.82/36.96	
36.82/36.96	LOG: CALL solverLinear in Graph for feasibility
36.82/36.96	
36.82/36.96	LOG: RETURN solveLinear in Graph for feasibility
36.82/36.96	It's unfeasible. Removing transition: 
36.82/36.96	<l1, l1, x_6^0 <= 1 /\ w_5^0 <= 0 /\ 1 + x_6^0 = undef69 /\ undef69 = 2, {w_5^0 -> 1 + w_5^0, x_6^0 -> undef69, rest remain the same}>
36.82/36.96	
36.82/36.96	LOG: CALL solverLinear in Graph for feasibility
36.82/36.96	
36.82/36.96	LOG: RETURN solveLinear in Graph for feasibility
36.82/36.96	Strengthening transition (result): 
36.82/36.96	<l1, l1, 2 <= w_5^0 /\ x_6^0 <= 1 /\ 1 + x_6^0 = undef69 /\ undef69 = 2, {w_5^0 -> 1 + w_5^0, x_6^0 -> undef69, rest remain the same}>
36.82/36.96	
36.82/36.96	LOG: CALL solverLinear in Graph for feasibility
36.82/36.96	
36.82/36.96	LOG: RETURN solveLinear in Graph for feasibility
36.82/36.96	It's unfeasible. Removing transition: 
36.82/36.96	<l1, l1, x_6^0 <= 1 /\ 1 + w_5^0 = undef82 /\ 1 + x_6^0 = undef81 /\ undef81 = 2 /\ undef82 = 2, {w_5^0 -> 1, x_6^0 -> undef81, rest remain the same}>
36.82/36.96	[ Termination Graph ]
36.82/36.96	Strengthening and disabling transitions...
36.82/36.96	> It's unfeasible. Removing transition: 
36.82/36.96	<l1, l1, 2 <= x_6^0 /\ w_5^0 = 1, {w_5^0 -> 1, x_6^0 -> 1 + x_6^0, rest remain the same}>
36.82/36.96	New Graphs: 
36.82/36.96	Calling Safety with literal 2 <= w_5^0 and entry <l0, l1, true, {all remain the same}>
36.82/36.96	
36.82/36.96	LOG: CALL check - Post:2 <= w_5^0 - Process 1
36.82/36.96	* Exit transition: <l0, l1, true, {all remain the same}>
36.82/36.96	* Postcondition  : 2 <= w_5^0
36.82/36.96	
36.82/36.96	LOG: CALL solveLinear
36.82/36.96	
36.82/36.96	LOG: RETURN solveLinear - Elapsed time: 0.000468s
36.82/36.96	> Postcondition is not implied!
36.82/36.96	
36.82/36.96	LOG: RETURN check - Elapsed time: 0.000533s
36.82/36.96	INVARIANTS: 
36.82/36.96	1: 
36.82/36.96	Quasi-INVARIANTS to narrow Graph: 
36.82/36.96	1: 2 <= w_5^0 , 
36.82/36.96	Narrowing transition: 
36.82/36.96	<l1, l1, 2 <= x_6^0 /\ w_5^0 <= 0, {w_5^0 -> 1 + w_5^0, x_6^0 -> 1 + x_6^0, rest remain the same}>
36.82/36.96	
36.82/36.96	LOG: Narrow transition size 1
36.82/36.96	It's unfeasible. Removing transition: 
36.82/36.96	<l1, l1, 2 <= x_6^0 /\ w_5^0 = 2, {w_5^0 -> 1 + w_5^0, x_6^0 -> 1 + x_6^0, rest remain the same}>
36.82/36.96	Narrowing transition: 
36.82/36.96	<l1, l1, 2 <= x_6^0 /\ w_5^0 = 1, {w_5^0 -> 1, x_6^0 -> 1 + x_6^0, rest remain the same}>
36.82/36.96	
36.82/36.96	LOG: Narrow transition size 1
36.82/36.96	Narrowing transition: 
36.82/36.96	<l1, l1, w_5^0 <= 0 /\ x_6^0 <= 0, {w_5^0 -> 1 + w_5^0, x_6^0 -> 1 + x_6^0, rest remain the same}>
36.82/36.96	
36.82/36.96	LOG: Narrow transition size 1
36.82/36.96	It's unfeasible. Removing transition: 
36.82/36.96	<l1, l1, 2 <= w_5^0 /\ x_6^0 <= 0, {w_5^0 -> 1 + w_5^0, x_6^0 -> 1 + x_6^0, rest remain the same}>
36.82/36.96	Narrowing transition: 
36.82/36.96	<l1, l1, x_6^0 <= 0 /\ w_5^0 = 1, {w_5^0 -> 1, x_6^0 -> 1 + x_6^0, rest remain the same}>
36.82/36.96	
36.82/36.96	LOG: Narrow transition size 1
36.82/36.96	Narrowing transition: 
36.82/36.96	<l1, l1, x_6^0 <= 1 /\ w_5^0 <= 0 /\ 1 + x_6^0 = undef69 /\ undef69 = 2, {w_5^0 -> 1 + w_5^0, x_6^0 -> undef69, rest remain the same}>
36.82/36.96	
36.82/36.96	LOG: Narrow transition size 1
36.82/36.96	It's unfeasible. Removing transition: 
36.82/36.96	<l1, l1, 2 <= w_5^0 /\ x_6^0 <= 1 /\ 1 + x_6^0 = undef69 /\ undef69 = 2, {w_5^0 -> 1 + w_5^0, x_6^0 -> undef69, rest remain the same}>
36.82/36.96	Narrowing transition: 
36.82/36.96	<l1, l1, x_6^0 <= 1 /\ 1 + w_5^0 = undef82 /\ 1 + x_6^0 = undef81 /\ undef81 = 2 /\ undef82 = 2, {w_5^0 -> 1, x_6^0 -> undef81, rest remain the same}>
36.82/36.96	
36.82/36.96	LOG: Narrow transition size 1
36.82/36.96	invGraph after Narrowing: 
36.82/36.96	Transitions:
36.82/36.96	<l1, l1, 2 <= x_6^0 /\ w_5^0 <= 0, {w_5^0 -> 1 + w_5^0, x_6^0 -> 1 + x_6^0, rest remain the same}>
36.82/36.96	<l1, l1, 2 <= x_6^0 /\ w_5^0 = 1, {w_5^0 -> 1, x_6^0 -> 1 + x_6^0, rest remain the same}>
36.82/36.96	<l1, l1, w_5^0 <= 0 /\ x_6^0 <= 0, {w_5^0 -> 1 + w_5^0, x_6^0 -> 1 + x_6^0, rest remain the same}>
36.82/36.96	<l1, l1, x_6^0 <= 0 /\ w_5^0 = 1, {w_5^0 -> 1, x_6^0 -> 1 + x_6^0, rest remain the same}>
36.82/36.96	<l1, l1, x_6^0 <= 1 /\ w_5^0 <= 0 /\ 1 + x_6^0 = undef69 /\ undef69 = 2, {w_5^0 -> 1 + w_5^0, x_6^0 -> undef69, rest remain the same}>
36.82/36.96	<l1, l1, w_5^0 <= 1 /\ x_6^0 <= 1 /\ 1 + w_5^0 = undef82 /\ 1 + x_6^0 = undef81 /\ undef81 = 2 /\ undef82 = 2, {w_5^0 -> 1, x_6^0 -> undef81, rest remain the same}>
36.82/36.96	Variables:
36.82/36.96	w_5^0, x_6^0
36.82/36.96	Checking conditional termination of SCC {l1}...
36.82/36.96	
36.82/36.96	LOG: CALL solveLinear
36.82/36.96	
36.82/36.96	LOG: RETURN solveLinear - Elapsed time: 0.002982s
36.82/36.96	Ranking function: -3*w_5^0 - 4*x_6^0
36.82/36.96	New Graphs: 
36.82/36.96	Transitions:
36.82/36.96	<l1, l1, 2 <= x_6^0 /\ w_5^0 <= 0, {w_5^0 -> 1 + w_5^0, x_6^0 -> 1 + x_6^0, rest remain the same}>
36.82/36.96	<l1, l1, 2 <= x_6^0 /\ w_5^0 = 1, {w_5^0 -> 1, x_6^0 -> 1 + x_6^0, rest remain the same}>
36.82/36.96	<l1, l1, x_6^0 <= 0 /\ w_5^0 = 1, {w_5^0 -> 1, x_6^0 -> 1 + x_6^0, rest remain the same}>
36.82/36.96	<l1, l1, x_6^0 <= 1 /\ w_5^0 <= 0 /\ 1 + x_6^0 = undef69 /\ undef69 = 2, {w_5^0 -> 1 + w_5^0, x_6^0 -> undef69, rest remain the same}>
36.82/36.96	<l1, l1, w_5^0 <= 1 /\ x_6^0 <= 1 /\ 1 + w_5^0 = undef82 /\ 1 + x_6^0 = undef81 /\ undef81 = 2 /\ undef82 = 2, {w_5^0 -> 1, x_6^0 -> undef81, rest remain the same}>
36.82/36.96	Variables:
36.82/36.96	w_5^0, x_6^0
36.82/36.96	Checking conditional termination of SCC {l1}...
36.82/36.96	
36.82/36.96	LOG: CALL solveLinear
36.82/36.96	
36.82/36.96	LOG: RETURN solveLinear - Elapsed time: 0.002753s
36.82/36.96	Ranking function: -7*w_5^0
36.82/36.96	New Graphs: 
36.82/36.96	Transitions:
36.82/36.96	<l1, l1, 2 <= x_6^0 /\ w_5^0 = 1, {w_5^0 -> 1, x_6^0 -> 1 + x_6^0, rest remain the same}>
36.82/36.96	<l1, l1, x_6^0 <= 0 /\ w_5^0 = 1, {w_5^0 -> 1, x_6^0 -> 1 + x_6^0, rest remain the same}>
36.82/36.96	<l1, l1, w_5^0 <= 1 /\ x_6^0 <= 1 /\ 1 + w_5^0 = undef82 /\ 1 + x_6^0 = undef81 /\ undef81 = 2 /\ undef82 = 2, {w_5^0 -> 1, x_6^0 -> undef81, rest remain the same}>
36.82/36.96	Variables:
36.82/36.96	w_5^0, x_6^0
36.82/36.96	Checking conditional termination of SCC {l1}...
36.82/36.96	
36.82/36.96	LOG: CALL solveLinear
36.82/36.96	
36.82/36.96	LOG: RETURN solveLinear - Elapsed time: 0.001939s
36.82/36.96	Ranking function: 1 - w_5^0 - 7*x_6^0
36.82/36.96	New Graphs: 
36.82/36.96	Transitions:
36.82/36.96	<l1, l1, 2 <= x_6^0 /\ w_5^0 = 1, {w_5^0 -> 1, x_6^0 -> 1 + x_6^0, rest remain the same}>
36.82/36.96	<l1, l1, w_5^0 <= 1 /\ x_6^0 <= 1 /\ 1 + w_5^0 = undef82 /\ 1 + x_6^0 = undef81 /\ undef81 = 2 /\ undef82 = 2, {w_5^0 -> 1, x_6^0 -> undef81, rest remain the same}>
36.82/36.96	Variables:
36.82/36.96	w_5^0, x_6^0
36.82/36.96	Checking conditional termination of SCC {l1}...
36.82/36.96	
36.82/36.96	LOG: CALL solveLinear
36.82/36.96	
36.82/36.96	LOG: RETURN solveLinear - Elapsed time: 0.001671s
36.82/36.96	Ranking function: 2 - x_6^0
36.82/36.96	New Graphs: 
36.82/36.96	Transitions:
36.82/36.96	<l1, l1, 2 <= x_6^0 /\ w_5^0 = 1, {w_5^0 -> 1, x_6^0 -> 1 + x_6^0, rest remain the same}>
36.82/36.96	Variables:
36.82/36.96	w_5^0, x_6^0
36.82/36.96	Checking conditional termination of SCC {l1}...
36.82/36.96	
36.82/36.96	LOG: CALL solveLinear
36.82/36.96	
36.82/36.96	LOG: RETURN solveLinear - Elapsed time: 0.000536s
36.82/36.96	
36.82/36.96	LOG: CALL solveLinear
36.82/36.96	
36.82/36.96	LOG: RETURN solveLinear - Elapsed time: 0.001743s
36.82/36.96	Trying to remove transition: <l1, l1, 2 <= x_6^0 /\ w_5^0 = 1, {w_5^0 -> 1, x_6^0 -> 1 + x_6^0, rest remain the same}>
36.82/36.96	Solving with 1 template(s).
36.82/36.96	
36.82/36.96	LOG: CALL solveNonLinearGetFirstSolution
36.82/36.96	
36.82/36.96	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006012s
36.82/36.96	Time used: 0.005875
36.82/36.96	Solving with 1 template(s).
36.82/36.96	
36.82/36.96	LOG: CALL solveNonLinearGetFirstSolution
36.82/36.96	
36.82/36.96	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002735s
36.82/36.96	Time used: 4.00221
36.82/36.96	Solving with 2 template(s).
36.82/36.96	
36.82/36.96	LOG: CALL solveNonLinearGetFirstSolution
36.82/36.96	
36.82/36.96	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.007419s
36.82/36.96	Time used: 4.00096
36.82/36.96	Solving with 3 template(s).
36.82/36.96	
36.82/36.96	LOG: CALL solveNonLinearGetFirstSolution
36.82/36.96	
36.82/36.96	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.009759s
36.82/36.96	Time used: 1.00002
36.82/36.96	Solving with 1 template(s).
36.82/36.96	
36.82/36.96	LOG: CALL solveNonLinearGetFirstSolution
36.82/36.96	
36.82/36.96	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.056743s
36.82/36.96	Time used: 0.017426
36.82/36.96	Improving Solution with cost 1 ...
36.82/36.96	
36.82/36.96	LOG: CALL solveNonLinearGetNextSolution
36.82/36.96	
36.82/36.96	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.040559s
36.82/36.96	Time used: 0.040554
36.82/36.96	
36.82/36.96	LOG: SAT solveNonLinear - Elapsed time: 0.097302s
36.82/36.96	Cost: 1; Total time: 0.05798
36.82/36.96	Termination implied by a set of invariant(s):
36.82/36.96	Invariant at l1: w_5^0 <= 1
36.82/36.96	[ Invariant Graph ]
36.82/36.96	Strengthening and disabling transitions...
36.82/36.96	
36.82/36.96	LOG: CALL solverLinear in Graph for feasibility
36.82/36.96	
36.82/36.96	LOG: RETURN solveLinear in Graph for feasibility
36.82/36.96	Strengthening transition (result): 
36.82/36.96	<l1, l1, 2 <= x_6^0 /\ w_5^0 <= 0, {w_5^0 -> 1 + w_5^0, x_6^0 -> 1 + x_6^0, rest remain the same}>
36.82/36.96	
36.82/36.96	LOG: CALL solverLinear in Graph for feasibility
36.82/36.96	
36.82/36.96	LOG: RETURN solveLinear in Graph for feasibility
36.82/36.96	Strengthening transition (result): 
36.82/36.96	<l1, l1, 2 <= x_6^0 /\ w_5^0 = 1, {w_5^0 -> 1, x_6^0 -> 1 + x_6^0, rest remain the same}>
36.82/36.96	
36.82/36.96	LOG: CALL solverLinear in Graph for feasibility
36.82/36.96	
36.82/36.96	LOG: RETURN solveLinear in Graph for feasibility
36.82/36.96	Strengthening transition (result): 
36.82/36.96	<l1, l1, w_5^0 <= 0 /\ x_6^0 <= 0, {w_5^0 -> 1 + w_5^0, x_6^0 -> 1 + x_6^0, rest remain the same}>
36.82/36.96	
36.82/36.96	LOG: CALL solverLinear in Graph for feasibility
36.82/36.96	
36.82/36.96	LOG: RETURN solveLinear in Graph for feasibility
36.82/36.96	Strengthening transition (result): 
36.82/36.96	<l1, l1, x_6^0 <= 0 /\ w_5^0 = 1, {w_5^0 -> 1, x_6^0 -> 1 + x_6^0, rest remain the same}>
36.82/36.96	
36.82/36.96	LOG: CALL solverLinear in Graph for feasibility
36.82/36.96	
36.82/36.96	LOG: RETURN solveLinear in Graph for feasibility
36.82/36.96	Strengthening transition (result): 
36.82/36.96	<l1, l1, x_6^0 <= 1 /\ w_5^0 <= 0 /\ 1 + x_6^0 = undef69 /\ undef69 = 2, {w_5^0 -> 1 + w_5^0, x_6^0 -> undef69, rest remain the same}>
36.82/36.96	
36.82/36.96	LOG: CALL solverLinear in Graph for feasibility
36.82/36.96	
36.82/36.96	LOG: RETURN solveLinear in Graph for feasibility
36.82/36.96	Strengthening transition (result): 
36.82/36.96	<l1, l1, w_5^0 <= 1 /\ x_6^0 <= 1 /\ 1 + w_5^0 = undef82 /\ 1 + x_6^0 = undef81 /\ undef81 = 2 /\ undef82 = 2, {w_5^0 -> 1, x_6^0 -> undef81, rest remain the same}>
36.82/36.96	[ Termination Graph ]
36.82/36.96	Strengthening and disabling transitions...
36.82/36.96	
36.82/36.96	LOG: CALL solverLinear in Graph for feasibility
36.82/36.96	
36.82/36.96	LOG: RETURN solveLinear in Graph for feasibility
36.82/36.96	Strengthening transition (result): 
36.82/36.96	<l1, l1, 2 <= x_6^0 /\ w_5^0 = 1, {w_5^0 -> 1, x_6^0 -> 1 + x_6^0, rest remain the same}>
36.82/36.96	Quasi-ranking function: 50000 + w_5^0 - x_6^0
36.82/36.96	New Graphs: 
36.82/36.96	Transitions:
36.82/36.96	<l1, l1, 2 <= x_6^0 /\ 50001 + w_5^0 <= x_6^0 /\ w_5^0 = 1, {w_5^0 -> 1, x_6^0 -> 1 + x_6^0, rest remain the same}>
36.82/36.96	Variables:
36.82/36.96	w_5^0, x_6^0
36.82/36.96	Checking conditional termination of SCC {l1}...
36.82/36.96	
36.82/36.96	LOG: CALL solveLinear
36.82/36.96	
36.82/36.96	LOG: RETURN solveLinear - Elapsed time: 0.000690s
36.82/36.96	
36.82/36.96	LOG: CALL solveLinear
36.82/36.96	
36.82/36.96	LOG: RETURN solveLinear - Elapsed time: 0.002249s
36.82/36.96	Trying to remove transition: <l1, l1, 2 <= x_6^0 /\ 50001 + w_5^0 <= x_6^0 /\ w_5^0 = 1, {w_5^0 -> 1, x_6^0 -> 1 + x_6^0, rest remain the same}>
36.82/36.96	Solving with 1 template(s).
36.82/36.96	
36.82/36.96	LOG: CALL solveNonLinearGetFirstSolution
36.82/36.96	
36.82/36.96	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008010s
36.82/36.96	Time used: 0.007855
36.82/36.96	Solving with 1 template(s).
36.82/36.96	
36.82/36.96	LOG: CALL solveNonLinearGetFirstSolution
36.82/36.96	
36.82/36.96	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002149s
36.82/36.96	Time used: 4.00204
36.82/36.96	Solving with 2 template(s).
36.82/36.96	
36.82/36.96	LOG: CALL solveNonLinearGetFirstSolution
36.82/36.96	
36.82/36.96	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.008170s
36.82/36.96	Time used: 4.00121
36.82/36.96	Solving with 3 template(s).
36.82/36.96	
36.82/36.96	LOG: CALL solveNonLinearGetFirstSolution
36.82/36.96	
36.82/36.96	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.009817s
36.82/36.96	Time used: 1.00015
36.82/36.96	Solving with 1 template(s).
36.82/36.96	
36.82/36.96	LOG: CALL solveNonLinearGetFirstSolution
36.82/36.96	
36.82/36.96	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.036574s
36.82/36.96	Time used: 0.018863
36.82/36.96	Improving Solution with cost 1 ...
36.82/36.96	
36.82/36.96	LOG: CALL solveNonLinearGetNextSolution
36.82/36.96	
36.82/36.96	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.028344s
36.82/36.96	Time used: 0.028339
36.82/36.96	
36.82/36.96	LOG: SAT solveNonLinear - Elapsed time: 0.064918s
36.82/36.96	Cost: 1; Total time: 0.047202
36.82/36.96	Quasi-ranking function: 50000 - x_6^0
36.82/36.96	New Graphs: 
36.82/36.96	Transitions:
36.82/36.96	<l1, l1, 50001 + w_5^0 <= x_6^0 /\ 50001 <= x_6^0 /\ w_5^0 = 1, {w_5^0 -> 1, x_6^0 -> 1 + x_6^0, rest remain the same}>
36.82/36.96	Variables:
36.82/36.96	w_5^0, x_6^0
36.82/36.96	Checking conditional termination of SCC {l1}...
36.82/36.96	
36.82/36.96	LOG: CALL solveLinear
36.82/36.96	
36.82/36.96	LOG: RETURN solveLinear - Elapsed time: 0.000706s
36.82/36.96	
36.82/36.96	LOG: CALL solveLinear
36.82/36.96	
36.82/36.96	LOG: RETURN solveLinear - Elapsed time: 0.002331s
36.82/36.96	Trying to remove transition: <l1, l1, 50001 + w_5^0 <= x_6^0 /\ 50001 <= x_6^0 /\ w_5^0 = 1, {w_5^0 -> 1, x_6^0 -> 1 + x_6^0, rest remain the same}>
36.82/36.96	Solving with 1 template(s).
36.82/36.96	
36.82/36.96	LOG: CALL solveNonLinearGetFirstSolution
36.82/36.96	
36.82/36.96	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009112s
36.82/36.96	Time used: 0.008945
36.82/36.96	Solving with 1 template(s).
36.82/36.96	
36.82/36.96	LOG: CALL solveNonLinearGetFirstSolution
36.82/36.96	
36.82/36.96	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002536s
36.82/36.96	Time used: 4.00243
36.82/36.96	Solving with 2 template(s).
36.82/36.96	
36.82/36.96	LOG: CALL solveNonLinearGetFirstSolution
36.82/36.96	
36.82/36.96	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.014363s
36.82/36.96	Time used: 4.00138
36.82/36.96	Solving with 3 template(s).
36.82/36.96	
36.82/36.96	LOG: CALL solveNonLinearGetFirstSolution
36.82/36.96	
36.82/36.96	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.009526s
36.82/36.96	Time used: 1.00028
36.82/36.96	Solving with 1 template(s).
36.82/36.96	
36.82/36.96	LOG: CALL solveNonLinearGetFirstSolution
36.82/36.96	
36.82/36.96	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.038094s
36.82/36.96	Time used: 0.019879
36.82/36.96	Improving Solution with cost 1 ...
36.82/36.96	
36.82/36.96	LOG: CALL solveNonLinearGetNextSolution
36.82/36.96	
36.82/36.96	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.043883s
36.82/36.96	Time used: 0.043878
36.82/36.96	
36.82/36.96	LOG: SAT solveNonLinear - Elapsed time: 0.081978s
36.82/36.96	Cost: 1; Total time: 0.063757
36.82/36.96	Termination implied by a set of invariant(s):
36.82/36.96	Invariant at l1: w_5^0 <= 1
36.82/36.96	[ Invariant Graph ]
36.82/36.96	Strengthening and disabling transitions...
36.82/36.96	
36.82/36.96	LOG: CALL solverLinear in Graph for feasibility
36.82/36.96	
36.82/36.96	LOG: RETURN solveLinear in Graph for feasibility
36.82/36.96	Strengthening transition (result): 
36.82/36.96	<l1, l1, 2 <= x_6^0 /\ w_5^0 <= 0, {w_5^0 -> 1 + w_5^0, x_6^0 -> 1 + x_6^0, rest remain the same}>
36.82/36.96	
36.82/36.96	LOG: CALL solverLinear in Graph for feasibility
36.82/36.96	
36.82/36.96	LOG: RETURN solveLinear in Graph for feasibility
36.82/36.96	Strengthening transition (result): 
36.82/36.96	<l1, l1, 2 <= x_6^0 /\ w_5^0 = 1, {w_5^0 -> 1, x_6^0 -> 1 + x_6^0, rest remain the same}>
36.82/36.96	
36.82/36.96	LOG: CALL solverLinear in Graph for feasibility
36.82/36.96	
36.82/36.96	LOG: RETURN solveLinear in Graph for feasibility
36.82/36.96	Strengthening transition (result): 
36.82/36.96	<l1, l1, w_5^0 <= 0 /\ x_6^0 <= 0, {w_5^0 -> 1 + w_5^0, x_6^0 -> 1 + x_6^0, rest remain the same}>
36.82/36.96	
36.82/36.96	LOG: CALL solverLinear in Graph for feasibility
36.82/36.96	
36.82/36.96	LOG: RETURN solveLinear in Graph for feasibility
36.82/36.96	Strengthening transition (result): 
36.82/36.96	<l1, l1, x_6^0 <= 0 /\ w_5^0 = 1, {w_5^0 -> 1, x_6^0 -> 1 + x_6^0, rest remain the same}>
36.82/36.96	
36.82/36.96	LOG: CALL solverLinear in Graph for feasibility
36.82/36.96	
36.82/36.96	LOG: RETURN solveLinear in Graph for feasibility
36.82/36.96	Strengthening transition (result): 
36.82/36.96	<l1, l1, x_6^0 <= 1 /\ w_5^0 <= 0 /\ 1 + x_6^0 = undef69 /\ undef69 = 2, {w_5^0 -> 1 + w_5^0, x_6^0 -> undef69, rest remain the same}>
36.82/36.96	
36.82/36.96	LOG: CALL solverLinear in Graph for feasibility
36.82/36.96	
36.82/36.96	LOG: RETURN solveLinear in Graph for feasibility
36.82/36.96	Strengthening transition (result): 
36.82/36.96	<l1, l1, w_5^0 <= 1 /\ x_6^0 <= 1 /\ 1 + w_5^0 = undef82 /\ 1 + x_6^0 = undef81 /\ undef81 = 2 /\ undef82 = 2, {w_5^0 -> 1, x_6^0 -> undef81, rest remain the same}>
36.82/36.96	[ Termination Graph ]
36.82/36.96	Strengthening and disabling transitions...
36.82/36.96	
36.82/36.96	LOG: CALL solverLinear in Graph for feasibility
36.82/36.96	
36.82/36.96	LOG: RETURN solveLinear in Graph for feasibility
36.82/36.96	Strengthening transition (result): 
36.82/36.96	<l1, l1, 50001 + w_5^0 <= x_6^0 /\ 50001 <= x_6^0 /\ w_5^0 = 1, {w_5^0 -> 1, x_6^0 -> 1 + x_6^0, rest remain the same}>
36.82/36.96	Quasi-ranking function: 50000 - w_5^0 - x_6^0
36.82/36.96	New Graphs: 
36.82/36.96	Transitions:
36.82/36.96	<l1, l1, 50001 + w_5^0 <= x_6^0 /\ 50001 <= w_5^0 + x_6^0 /\ 50001 <= x_6^0 /\ w_5^0 = 1, {w_5^0 -> 1, x_6^0 -> 1 + x_6^0, rest remain the same}>
36.82/36.96	Variables:
36.82/36.96	w_5^0, x_6^0
36.82/36.96	Checking conditional termination of SCC {l1}...
36.82/36.96	
36.82/36.96	LOG: CALL solveLinear
36.82/36.96	
36.82/36.96	LOG: RETURN solveLinear - Elapsed time: 0.000780s
36.82/36.96	
36.82/36.96	LOG: CALL solveLinear
36.82/36.96	
36.82/36.96	LOG: RETURN solveLinear - Elapsed time: 0.002924s
36.82/36.96	Trying to remove transition: <l1, l1, 50001 + w_5^0 <= x_6^0 /\ 50001 <= w_5^0 + x_6^0 /\ 50001 <= x_6^0 /\ w_5^0 = 1, {w_5^0 -> 1, x_6^0 -> 1 + x_6^0, rest remain the same}>
36.82/36.96	Solving with 1 template(s).
36.82/36.96	
36.82/36.96	LOG: CALL solveNonLinearGetFirstSolution
36.82/36.96	
36.82/36.96	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007296s
36.82/36.96	Time used: 0.007133
36.82/36.96	Solving with 1 template(s).
36.82/36.96	
36.82/36.96	LOG: CALL solveNonLinearGetFirstSolution
36.82/36.96	
36.82/36.96	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002945s
36.82/36.96	Time used: 4.00277
36.82/36.96	Solving with 2 template(s).
36.82/36.96	
36.82/36.96	LOG: CALL solveNonLinearGetFirstSolution
36.82/36.96	
36.82/36.96	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.016455s
36.82/36.96	Time used: 4.00155
36.82/36.96	Solving with 3 template(s).
36.82/36.96	
36.82/36.96	LOG: CALL solveNonLinearGetFirstSolution
36.82/36.96	
36.82/36.96	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.009655s
36.82/36.96	Time used: 1.00011
36.82/36.96	Solving with 1 template(s).
36.82/36.96	
36.82/36.96	LOG: CALL solveNonLinearGetFirstSolution
36.82/36.96	
36.82/36.96	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.034247s
36.82/36.96	Time used: 0.016546
36.82/36.96	
36.82/36.96	Proving non-termination of subgraph 1
36.82/36.96	Transitions:
36.82/36.96	<l1, l1, 2 <= x_6^0 /\ w_5^0 <= 0, {w_5^0 -> 1 + w_5^0, x_6^0 -> 1 + x_6^0, rest remain the same}>
36.82/36.96	<l1, l1, 2 <= x_6^0 /\ w_5^0 = 1, {w_5^0 -> 1, x_6^0 -> 1 + x_6^0, rest remain the same}>
36.82/36.96	<l1, l1, w_5^0 <= 0 /\ x_6^0 <= 0, {w_5^0 -> 1 + w_5^0, x_6^0 -> 1 + x_6^0, rest remain the same}>
36.82/36.96	<l1, l1, x_6^0 <= 0 /\ w_5^0 = 1, {w_5^0 -> 1, x_6^0 -> 1 + x_6^0, rest remain the same}>
36.82/36.96	<l1, l1, x_6^0 <= 1 /\ w_5^0 <= 0 /\ 1 + x_6^0 = undef69 /\ undef69 = 2, {w_5^0 -> 1 + w_5^0, x_6^0 -> undef69, rest remain the same}>
36.82/36.96	<l1, l1, w_5^0 <= 1 /\ x_6^0 <= 1 /\ 1 + w_5^0 = undef82 /\ 1 + x_6^0 = undef81 /\ undef81 = 2 /\ undef82 = 2, {w_5^0 -> 1, x_6^0 -> undef81, rest remain the same}>
36.82/36.96	Variables:
36.82/36.96	w_5^0, x_6^0
36.82/36.96	
36.82/36.96	Checking that every undef value has an assignment...
36.82/36.96	
36.82/36.96	LOG: CALL solveLinear
36.82/36.96	
36.82/36.96	LOG: RETURN solveLinear - Elapsed time: 0.001915s
36.82/36.96	Checking conditional non-termination of SCC {l1}...
36.82/36.96	> No assignment for some undef value.
36.82/36.96	> Checking if the negation of the conditions of every pending exit is quasi-invariant... YES
36.82/36.96	Calling reachability with...
36.82/36.96	Transition: <l1, end, true, {all remain the same}>
36.82/36.96	Conditions: w_5^0 <= 1, 
36.82/36.96	OPEN EXITS: 
36.82/36.96	<l1, end, w_5^0 <= 1, {all remain the same}>
36.82/36.96	
36.82/36.96	--- Reachability graph ---
36.82/36.96	> Graph without transitions.
36.82/36.96	
36.82/36.96	Calling reachability with...
36.82/36.96	Transition: <l0, l1, true, {all remain the same}>
36.82/36.96	Conditions: w_5^0 <= 1, 
36.82/36.96	OPEN EXITS: 
36.82/36.96	<l0, l1, w_5^0 <= 1, {all remain the same}>
36.82/36.96	
36.82/36.96	> Conditions are reachable!
36.82/36.96	
36.82/36.96	Program does NOT terminate
36.82/36.96	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
36.82/36.96	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
36.82/36.96	EOF