36.57/36.63	NO
36.57/36.63	
36.57/36.63	Solver Timeout: 4
36.57/36.63	Global Timeout: 300
36.57/36.63	No parsing errors!
36.57/36.63	Init Location: 0
36.57/36.63	Transitions:
36.57/36.63	<l0, l14, true>
36.57/36.63	<l1, l2, true>
36.57/36.63	<l2, l3, (undef8 = undef8), par{__rho_2_^0 -> undef8}>
36.57/36.63	<l4, l5, true>
36.57/36.63	<l6, l7, true>
36.57/36.63	<l8, l9, true>
36.57/36.63	<l5, l4, (3 <= (0 + WItemsNum^0)), par{WItemsNum^0 -> (~(1) + WItemsNum^0)}>
36.57/36.63	<l5, l1, ((0 + WItemsNum^0) <= 2)>
36.57/36.63	<l9, l10, true>
36.57/36.63	<l10, l9, true>
36.57/36.63	<l11, l2, ((1 + __const_5^0) <= (0 + WItemsNum^0)), par{WItemsNum^0 -> (1 + WItemsNum^0)}>
36.57/36.63	<l11, l2, ((0 + WItemsNum^0) <= (0 + __const_5^0)), par{WItemsNum^0 -> (1 + WItemsNum^0)}>
36.57/36.63	<l12, l11, ((0 + __rho_2_^0) <= 0)>
36.57/36.63	<l12, l4, (1 <= (0 + __rho_2_^0))>
36.57/36.63	<l3, l11, ((1 + __const_5^0) <= (0 + WItemsNum^0))>
36.57/36.63	<l3, l12, ((0 + WItemsNum^0) <= (0 + __const_5^0))>
36.57/36.63	<l13, l1, (undef65 = undef65) /\ (undef63 = undef63), par{WItemsNum^0 -> (0 + undef63), __rho_1_^0 -> undef63}>
36.57/36.63	<l14, l13, true>
36.57/36.63	
36.57/36.63	Fresh variables:
36.57/36.63	undef8, undef63, undef65, 
36.57/36.63	
36.57/36.63	Undef variables:
36.57/36.63	undef8, undef63, undef65, 
36.57/36.63	
36.57/36.63	Abstraction variables:
36.57/36.63	
36.57/36.63	Exit nodes:
36.57/36.63	
36.57/36.63	Accepting locations:
36.57/36.63	
36.57/36.63	Asserts:
36.57/36.63	
36.57/36.63	Preprocessed LLVMGraph
36.57/36.63	Init Location: 0
36.57/36.63	Transitions:
36.57/36.63	<l0, l2, (WItemsNum^0 = (0 + undef63)) /\ (undef65 = undef65) /\ (undef63 = undef63)>
36.57/36.63	<l2, l2, (undef8 = undef8) /\ ((1 + __const_5^0) <= (0 + WItemsNum^0)) /\ ((1 + __const_5^0) <= (0 + WItemsNum^0)), par{WItemsNum^0 -> (1 + WItemsNum^0)}>
36.57/36.63	<l2, l2, (undef8 = undef8) /\ ((0 + WItemsNum^0) <= (0 + __const_5^0)) /\ ((0 + undef8) <= 0) /\ ((0 + WItemsNum^0) <= (0 + __const_5^0)), par{WItemsNum^0 -> (1 + WItemsNum^0)}>
36.57/36.63	<l2, l4, (undef8 = undef8) /\ ((0 + WItemsNum^0) <= (0 + __const_5^0)) /\ (1 <= (0 + undef8))>
36.57/36.63	<l4, l4, (3 <= (0 + WItemsNum^0)), par{WItemsNum^0 -> (~(1) + WItemsNum^0)}>
36.57/36.63	<l4, l2, ((0 + WItemsNum^0) <= 2)>
36.57/36.63	
36.57/36.63	Fresh variables:
36.57/36.63	undef8, undef63, undef65, 
36.57/36.63	
36.57/36.63	Undef variables:
36.57/36.63	undef8, undef63, undef65, 
36.57/36.63	
36.57/36.63	Abstraction variables:
36.57/36.63	
36.57/36.63	Exit nodes:
36.57/36.63	
36.57/36.63	Accepting locations:
36.57/36.63	
36.57/36.63	Asserts:
36.57/36.63	
36.57/36.63	*************************************************************
36.57/36.63	*******************************************************************************************
36.57/36.63	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
36.57/36.63	*******************************************************************************************
36.57/36.63	
36.57/36.63	Init Location: 0
36.57/36.63	Graph 0:
36.57/36.63	Transitions:
36.57/36.63	Variables:
36.57/36.63	
36.57/36.63	Graph 1:
36.57/36.63	Transitions:
36.57/36.63	<l2, l2, 1 + __const_5^0 <= WItemsNum^0, {WItemsNum^0 -> 1 + WItemsNum^0, rest remain the same}>
36.57/36.63	<l2, l2, WItemsNum^0 <= __const_5^0 /\ undef8 <= 0, {WItemsNum^0 -> 1 + WItemsNum^0, rest remain the same}>
36.57/36.63	<l2, l4, WItemsNum^0 <= __const_5^0 /\ 1 <= undef8, {all remain the same}>
36.57/36.63	<l4, l4, 3 <= WItemsNum^0, {WItemsNum^0 -> -1 + WItemsNum^0, rest remain the same}>
36.57/36.63	<l4, l2, WItemsNum^0 <= 2, {all remain the same}>
36.57/36.63	Variables:
36.57/36.63	WItemsNum^0, __const_5^0
36.57/36.63	
36.57/36.63	Precedence: 
36.57/36.63	Graph 0
36.57/36.63	
36.57/36.63	Graph 1
36.57/36.63	<l0, l2, WItemsNum^0 = undef63, {all remain the same}>
36.57/36.63	
36.57/36.63	Map Locations to Subgraph:
36.57/36.63	( 0 , 0 )
36.57/36.63	( 2 , 1 )
36.57/36.63	( 4 , 1 )
36.57/36.63	
36.57/36.63	*******************************************************************************************
36.57/36.63	********************************    CHECKING ASSERTIONS    ********************************
36.57/36.63	*******************************************************************************************
36.57/36.63	
36.57/36.63	Proving termination of subgraph 0
36.57/36.63	Proving termination of subgraph 1
36.57/36.63	Checking unfeasibility...
36.57/36.63	Time used: 0.011527
36.57/36.63	
36.57/36.63	Checking conditional termination of SCC {l2, l4}...
36.57/36.63	
36.57/36.63	LOG: CALL solveLinear
36.57/36.63	
36.57/36.63	LOG: RETURN solveLinear - Elapsed time: 0.001781s
36.57/36.63	
36.57/36.63	LOG: CALL solveLinear
36.57/36.63	
36.57/36.63	LOG: RETURN solveLinear - Elapsed time: 0.009355s
36.57/36.63	Trying to remove transition: <l4, l4, 3 <= WItemsNum^0, {WItemsNum^0 -> -1 + WItemsNum^0, rest remain the same}>
36.57/36.63	Solving with 1 template(s).
36.57/36.63	
36.57/36.63	LOG: CALL solveNonLinearGetFirstSolution
36.57/36.63	
36.57/36.63	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.046098s
36.57/36.63	Time used: 0.045837
36.57/36.63	Trying to remove transition: <l2, l2, WItemsNum^0 <= __const_5^0 /\ undef8 <= 0, {WItemsNum^0 -> 1 + WItemsNum^0, rest remain the same}>
36.57/36.63	Solving with 1 template(s).
36.57/36.63	
36.57/36.63	LOG: CALL solveNonLinearGetFirstSolution
36.57/36.63	
36.57/36.63	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.019637s
36.57/36.63	Time used: 0.018906
36.57/36.63	Trying to remove transition: <l2, l2, 1 + __const_5^0 <= WItemsNum^0, {WItemsNum^0 -> 1 + WItemsNum^0, rest remain the same}>
36.57/36.63	Solving with 1 template(s).
36.57/36.63	
36.57/36.63	LOG: CALL solveNonLinearGetFirstSolution
36.57/36.63	
36.57/36.63	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012005s
36.57/36.63	Time used: 0.010898
36.57/36.63	Solving with 1 template(s).
36.57/36.63	
36.57/36.63	LOG: CALL solveNonLinearGetFirstSolution
36.57/36.63	
36.57/36.63	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.053780s
36.57/36.63	Time used: 0.052622
36.57/36.63	Improving Solution with cost 1 ...
36.57/36.63	
36.57/36.63	LOG: CALL solveNonLinearGetNextSolution
36.57/36.63	
36.57/36.63	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.174098s
36.57/36.63	Time used: 0.174084
36.57/36.63	
36.57/36.63	LOG: SAT solveNonLinear - Elapsed time: 0.227877s
36.57/36.63	Cost: 1; Total time: 0.226706
36.57/36.63	Failed at location 2: 1 + __const_5^0 <= WItemsNum^0
36.57/36.63	Before Improving: 
36.57/36.63	Quasi-invariant at l2: 1 + __const_5^0 <= WItemsNum^0
36.57/36.63	Quasi-invariant at l4: 1 <= 0
36.57/36.63	Optimizing invariants...
36.57/36.63	
36.57/36.63	LOG: CALL solveLinear
36.57/36.63	
36.57/36.63	LOG: RETURN solveLinear - Elapsed time: 0.013365s
36.57/36.63	Remaining time after improvement: 0.996486
36.57/36.63	Termination implied by a set of quasi-invariant(s):
36.57/36.63	Quasi-invariant at l2: 1 + __const_5^0 <= WItemsNum^0
36.57/36.63	Quasi-invariant at l4: 1 <= 0
36.57/36.63	[ Invariant Graph ]
36.57/36.63	Strengthening and disabling transitions...
36.57/36.63	
36.57/36.63	LOG: CALL solverLinear in Graph for feasibility
36.57/36.63	
36.57/36.63	LOG: RETURN solveLinear in Graph for feasibility
36.57/36.63	Strengthening transition (result): 
36.57/36.63	<l2, l2, 1 + __const_5^0 <= WItemsNum^0, {WItemsNum^0 -> 1 + WItemsNum^0, rest remain the same}>
36.57/36.63	
36.57/36.63	LOG: CALL solverLinear in Graph for feasibility
36.57/36.63	
36.57/36.63	LOG: RETURN solveLinear in Graph for feasibility
36.57/36.63	It's unfeasible. Removing transition: 
36.57/36.63	<l2, l2, WItemsNum^0 <= __const_5^0 /\ undef8 <= 0, {WItemsNum^0 -> 1 + WItemsNum^0, rest remain the same}>
36.57/36.63	
36.57/36.63	LOG: CALL solverLinear in Graph for feasibility
36.57/36.63	
36.57/36.63	LOG: RETURN solveLinear in Graph for feasibility
36.57/36.63	It's unfeasible. Removing transition: 
36.57/36.63	<l2, l4, WItemsNum^0 <= __const_5^0 /\ 1 <= undef8, {all remain the same}>
36.57/36.63	
36.57/36.63	LOG: CALL solverLinear in Graph for feasibility
36.57/36.63	
36.57/36.63	LOG: RETURN solveLinear in Graph for feasibility
36.57/36.63	It's unfeasible. Removing transition: 
36.57/36.63	<l4, l4, 3 <= WItemsNum^0, {WItemsNum^0 -> -1 + WItemsNum^0, rest remain the same}>
36.57/36.63	
36.57/36.63	LOG: CALL solverLinear in Graph for feasibility
36.57/36.63	
36.57/36.63	LOG: RETURN solveLinear in Graph for feasibility
36.57/36.63	It's unfeasible. Removing transition: 
36.57/36.63	<l4, l2, WItemsNum^0 <= 2, {all remain the same}>
36.57/36.63	[ Termination Graph ]
36.57/36.63	Strengthening and disabling transitions...
36.57/36.63	
36.57/36.63	LOG: CALL solverLinear in Graph for feasibility
36.57/36.63	
36.57/36.63	LOG: RETURN solveLinear in Graph for feasibility
36.57/36.63	Strengthening transition (result): 
36.57/36.63	<l2, l2, 1 + __const_5^0 <= WItemsNum^0, {WItemsNum^0 -> 1 + WItemsNum^0, rest remain the same}>
36.57/36.63	
36.57/36.63	LOG: CALL solverLinear in Graph for feasibility
36.57/36.63	
36.57/36.63	LOG: RETURN solveLinear in Graph for feasibility
36.57/36.63	It's unfeasible. Removing transition: 
36.57/36.63	<l2, l2, WItemsNum^0 <= __const_5^0 /\ undef8 <= 0, {WItemsNum^0 -> 1 + WItemsNum^0, rest remain the same}>
36.57/36.63	
36.57/36.63	LOG: CALL solverLinear in Graph for feasibility
36.57/36.63	
36.57/36.63	LOG: RETURN solveLinear in Graph for feasibility
36.57/36.63	It's unfeasible. Removing transition: 
36.57/36.63	<l2, l4, WItemsNum^0 <= __const_5^0 /\ 1 <= undef8, {all remain the same}>
36.57/36.63	
36.57/36.63	LOG: CALL solverLinear in Graph for feasibility
36.57/36.63	
36.57/36.63	LOG: RETURN solveLinear in Graph for feasibility
36.57/36.63	It's unfeasible. Removing transition: 
36.57/36.63	<l4, l4, 3 <= WItemsNum^0, {WItemsNum^0 -> -1 + WItemsNum^0, rest remain the same}>
36.57/36.63	
36.57/36.63	LOG: CALL solverLinear in Graph for feasibility
36.57/36.63	
36.57/36.63	LOG: RETURN solveLinear in Graph for feasibility
36.57/36.63	It's unfeasible. Removing transition: 
36.57/36.63	<l4, l2, WItemsNum^0 <= 2, {all remain the same}>
36.57/36.63	New Graphs: 
36.57/36.63	Transitions:
36.57/36.63	<l2, l2, 1 + __const_5^0 <= WItemsNum^0, {WItemsNum^0 -> 1 + WItemsNum^0, rest remain the same}>
36.57/36.63	Variables:
36.57/36.63	WItemsNum^0, __const_5^0
36.57/36.63	Checking conditional termination of SCC {l2}...
36.57/36.63	
36.57/36.63	LOG: CALL solveLinear
36.57/36.63	
36.57/36.63	LOG: RETURN solveLinear - Elapsed time: 0.000635s
36.57/36.63	
36.57/36.63	LOG: CALL solveLinear
36.57/36.63	
36.57/36.63	LOG: RETURN solveLinear - Elapsed time: 0.001746s
36.57/36.63	Trying to remove transition: <l2, l2, 1 + __const_5^0 <= WItemsNum^0, {WItemsNum^0 -> 1 + WItemsNum^0, rest remain the same}>
36.57/36.63	Solving with 1 template(s).
36.57/36.63	
36.57/36.63	LOG: CALL solveNonLinearGetFirstSolution
36.57/36.63	
36.57/36.63	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004596s
36.57/36.63	Time used: 0.004463
36.57/36.63	Solving with 1 template(s).
36.57/36.63	
36.57/36.63	LOG: CALL solveNonLinearGetFirstSolution
36.57/36.63	
36.57/36.63	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001763s
36.57/36.63	Time used: 4.001
36.57/36.63	Solving with 2 template(s).
36.57/36.63	
36.57/36.63	LOG: CALL solveNonLinearGetFirstSolution
36.57/36.63	
36.57/36.63	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.008639s
36.57/36.63	Time used: 4.00084
36.57/36.63	Solving with 3 template(s).
36.57/36.63	
36.57/36.63	LOG: CALL solveNonLinearGetFirstSolution
36.57/36.63	
36.57/36.63	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.004192s
36.57/36.63	Time used: 1.00046
36.57/36.63	Solving with 1 template(s).
36.57/36.63	
36.57/36.63	LOG: CALL solveNonLinearGetFirstSolution
36.57/36.63	
36.57/36.63	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009257s
36.57/36.63	Time used: 0.005994
36.57/36.63	Improving Solution with cost 1 ...
36.57/36.63	
36.57/36.63	LOG: CALL solveNonLinearGetNextSolution
36.57/36.63	
36.57/36.63	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.009364s
36.57/36.63	Time used: 0.009359
36.57/36.63	
36.57/36.63	LOG: SAT solveNonLinear - Elapsed time: 0.018621s
36.57/36.63	Cost: 1; Total time: 0.015353
36.57/36.63	Quasi-ranking function: 50000 - WItemsNum^0 + __const_5^0
36.57/36.63	New Graphs: 
36.57/36.63	Transitions:
36.57/36.63	<l2, l2, 50001 + __const_5^0 <= WItemsNum^0, {WItemsNum^0 -> 1 + WItemsNum^0, rest remain the same}>
36.57/36.63	Variables:
36.57/36.63	WItemsNum^0, __const_5^0
36.57/36.63	Checking conditional termination of SCC {l2}...
36.57/36.63	
36.57/36.63	LOG: CALL solveLinear
36.57/36.63	
36.57/36.63	LOG: RETURN solveLinear - Elapsed time: 0.000460s
36.57/36.63	
36.57/36.63	LOG: CALL solveLinear
36.57/36.63	
36.57/36.63	LOG: RETURN solveLinear - Elapsed time: 0.001784s
36.57/36.63	Trying to remove transition: <l2, l2, 50001 + __const_5^0 <= WItemsNum^0, {WItemsNum^0 -> 1 + WItemsNum^0, rest remain the same}>
36.57/36.63	Solving with 1 template(s).
36.57/36.63	
36.57/36.63	LOG: CALL solveNonLinearGetFirstSolution
36.57/36.63	
36.57/36.63	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005364s
36.57/36.63	Time used: 0.005227
36.57/36.63	Solving with 1 template(s).
36.57/36.63	
36.57/36.63	LOG: CALL solveNonLinearGetFirstSolution
36.57/36.63	
36.57/36.63	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005253s
36.57/36.63	Time used: 4.00271
36.57/36.63	Solving with 2 template(s).
36.57/36.63	
36.57/36.63	LOG: CALL solveNonLinearGetFirstSolution
36.57/36.63	
36.57/36.63	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.006480s
36.57/36.63	Time used: 4.00076
36.57/36.63	Solving with 3 template(s).
36.57/36.63	
36.57/36.63	LOG: CALL solveNonLinearGetFirstSolution
36.57/36.63	
36.57/36.63	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.012826s
36.57/36.63	Time used: 1.00047
36.57/36.63	Solving with 1 template(s).
36.57/36.63	
36.57/36.63	LOG: CALL solveNonLinearGetFirstSolution
36.57/36.63	
36.57/36.63	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008968s
36.57/36.63	Time used: 0.005916
36.57/36.63	Improving Solution with cost 1 ...
36.57/36.63	
36.57/36.63	LOG: CALL solveNonLinearGetNextSolution
36.57/36.63	
36.57/36.63	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.009358s
36.57/36.63	Time used: 0.009352
36.57/36.63	
36.57/36.63	LOG: SAT solveNonLinear - Elapsed time: 0.018326s
36.57/36.63	Cost: 1; Total time: 0.015268
36.57/36.63	Quasi-ranking function: 50000 - WItemsNum^0
36.57/36.63	New Graphs: 
36.57/36.63	Transitions:
36.57/36.63	<l2, l2, 50001 <= WItemsNum^0 /\ 50001 + __const_5^0 <= WItemsNum^0, {WItemsNum^0 -> 1 + WItemsNum^0, rest remain the same}>
36.57/36.63	Variables:
36.57/36.63	WItemsNum^0, __const_5^0
36.57/36.63	Checking conditional termination of SCC {l2}...
36.57/36.63	
36.57/36.63	LOG: CALL solveLinear
36.57/36.63	
36.57/36.63	LOG: RETURN solveLinear - Elapsed time: 0.000548s
36.57/36.63	
36.57/36.63	LOG: CALL solveLinear
36.57/36.63	
36.57/36.63	LOG: RETURN solveLinear - Elapsed time: 0.002050s
36.57/36.63	Trying to remove transition: <l2, l2, 50001 <= WItemsNum^0 /\ 50001 + __const_5^0 <= WItemsNum^0, {WItemsNum^0 -> 1 + WItemsNum^0, rest remain the same}>
36.57/36.63	Solving with 1 template(s).
36.57/36.63	
36.57/36.63	LOG: CALL solveNonLinearGetFirstSolution
36.57/36.63	
36.57/36.63	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005452s
36.57/36.63	Time used: 0.005306
36.57/36.63	Solving with 1 template(s).
36.57/36.63	
36.57/36.63	LOG: CALL solveNonLinearGetFirstSolution
36.57/36.63	
36.57/36.63	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002512s
36.57/36.63	Time used: 4.0018
36.57/36.63	Solving with 2 template(s).
36.57/36.63	
36.57/36.63	LOG: CALL solveNonLinearGetFirstSolution
36.57/36.63	
36.57/36.63	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005239s
36.57/36.63	Time used: 4.00076
36.57/36.63	Solving with 3 template(s).
36.57/36.63	
36.57/36.63	LOG: CALL solveNonLinearGetFirstSolution
36.57/36.63	
36.57/36.63	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.004279s
36.57/36.63	Time used: 1.00058
36.57/36.63	Solving with 1 template(s).
36.57/36.63	
36.57/36.63	LOG: CALL solveNonLinearGetFirstSolution
36.57/36.63	
36.57/36.63	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009548s
36.57/36.63	Time used: 0.006482
36.57/36.63	Improving Solution with cost 1 ...
36.57/36.63	
36.57/36.63	LOG: CALL solveNonLinearGetNextSolution
36.57/36.63	
36.57/36.63	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.009245s
36.57/36.63	Time used: 0.009225
36.57/36.63	
36.57/36.63	LOG: SAT solveNonLinear - Elapsed time: 0.018793s
36.57/36.63	Cost: 1; Total time: 0.015707
36.57/36.63	Quasi-ranking function: 50000 - WItemsNum^0 - __const_5^0
36.57/36.63	New Graphs: 
36.57/36.63	Transitions:
36.57/36.63	<l2, l2, 50001 <= WItemsNum^0 /\ 50001 + __const_5^0 <= WItemsNum^0 /\ 50001 <= WItemsNum^0 + __const_5^0, {WItemsNum^0 -> 1 + WItemsNum^0, rest remain the same}>
36.57/36.63	Variables:
36.57/36.63	WItemsNum^0, __const_5^0
36.57/36.63	Checking conditional termination of SCC {l2}...
36.57/36.63	
36.57/36.63	LOG: CALL solveLinear
36.57/36.63	
36.57/36.63	LOG: RETURN solveLinear - Elapsed time: 0.000636s
36.57/36.63	
36.57/36.63	LOG: CALL solveLinear
36.57/36.63	
36.57/36.63	LOG: RETURN solveLinear - Elapsed time: 0.002370s
36.57/36.63	Trying to remove transition: <l2, l2, 50001 <= WItemsNum^0 /\ 50001 + __const_5^0 <= WItemsNum^0 /\ 50001 <= WItemsNum^0 + __const_5^0, {WItemsNum^0 -> 1 + WItemsNum^0, rest remain the same}>
36.57/36.63	Solving with 1 template(s).
36.57/36.63	
36.57/36.63	LOG: CALL solveNonLinearGetFirstSolution
36.57/36.63	
36.57/36.63	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005835s
36.57/36.63	Time used: 0.005675
36.57/36.63	Solving with 1 template(s).
36.57/36.63	
36.57/36.63	LOG: CALL solveNonLinearGetFirstSolution
36.57/36.63	
36.57/36.63	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.006954s
36.57/36.63	Time used: 4.00104
36.57/36.63	Solving with 2 template(s).
36.57/36.63	
36.57/36.63	LOG: CALL solveNonLinearGetFirstSolution
36.57/36.63	
36.57/36.63	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005889s
36.57/36.63	Time used: 4.00077
36.57/36.63	Solving with 3 template(s).
36.57/36.63	
36.57/36.63	LOG: CALL solveNonLinearGetFirstSolution
36.57/36.63	
36.57/36.63	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.003828s
36.57/36.63	Time used: 1.00064
36.57/36.63	Solving with 1 template(s).
36.57/36.63	
36.57/36.63	LOG: CALL solveNonLinearGetFirstSolution
36.57/36.63	
36.57/36.63	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009113s
36.57/36.63	Time used: 0.006249
36.57/36.63	Termination failed. Trying to show unreachability...
36.57/36.63	Proving unreachability of entry: <l0, l2, WItemsNum^0 = undef63, {all remain the same}>
36.57/36.63	
36.57/36.63	LOG: CALL check - Post:1 <= 0 - Process 1
36.57/36.63	* Exit transition: <l0, l2, WItemsNum^0 = undef63, {all remain the same}>
36.57/36.63	* Postcondition  : 1 <= 0
36.57/36.63	
36.57/36.63	LOG: CALL solveLinear
36.57/36.63	
36.57/36.63	LOG: RETURN solveLinear - Elapsed time: 0.001224s
36.57/36.63	> Postcondition is not implied!
36.57/36.63	
36.57/36.63	LOG: RETURN check - Elapsed time: 0.001304s
36.57/36.63	Cannot prove unreachability
36.57/36.63	
36.57/36.63	Proving non-termination of subgraph 1
36.57/36.63	Transitions:
36.57/36.63	<l2, l2, 1 + __const_5^0 <= WItemsNum^0, {WItemsNum^0 -> 1 + WItemsNum^0, rest remain the same}>
36.57/36.63	<l2, l2, WItemsNum^0 <= __const_5^0 /\ undef8 <= 0, {WItemsNum^0 -> 1 + WItemsNum^0, rest remain the same}>
36.57/36.63	<l2, l4, WItemsNum^0 <= __const_5^0 /\ 1 <= undef8, {all remain the same}>
36.57/36.63	<l4, l4, 3 <= WItemsNum^0, {WItemsNum^0 -> -1 + WItemsNum^0, rest remain the same}>
36.57/36.63	<l4, l2, WItemsNum^0 <= 2, {all remain the same}>
36.57/36.63	Variables:
36.57/36.63	WItemsNum^0, __const_5^0
36.57/36.63	
36.57/36.63	Checking conditional non-termination of SCC {l2, l4}...
36.57/36.63	> No exit transition to close.
36.57/36.63	Calling reachability with...
36.57/36.63	Transition: <l2, end, true, {all remain the same}>
36.57/36.63	Conditions: 
36.57/36.63	OPEN EXITS: 
36.57/36.63	<l2, end, true, {all remain the same}>
36.57/36.63	
36.57/36.63	--- Reachability graph ---
36.57/36.63	> Graph without transitions.
36.57/36.63	
36.57/36.63	Calling reachability with...
36.57/36.63	Transition: <l0, l2, WItemsNum^0 = undef63, {all remain the same}>
36.57/36.63	Conditions: 
36.57/36.63	OPEN EXITS: 
36.57/36.63	<l0, l2, WItemsNum^0 = undef63, {all remain the same}>
36.57/36.63	
36.57/36.63	> Conditions are reachable!
36.57/36.63	
36.57/36.63	Program does NOT terminate
36.57/36.63	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
36.57/36.63	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
36.57/36.63	EOF