9.51/9.58	NO
9.51/9.58	
9.51/9.59	Solver Timeout: 4
9.51/9.59	Global Timeout: 300
9.51/9.59	No parsing errors!
9.51/9.59	Init Location: 0
9.51/9.59	Transitions:
9.51/9.59	<l0, l14, true>
9.51/9.59	<l1, l2, (6 <= (0 + WItemsNum^0)) /\ (undef2 = undef2), par{tmp1^0 -> undef2}>
9.51/9.59	<l1, l3, ((0 + WItemsNum^0) <= 5)>
9.51/9.59	<l4, l5, true>
9.51/9.59	<l5, l1, true>
9.51/9.59	<l6, l7, true>
9.51/9.59	<l8, l9, true>
9.51/9.59	<l10, l11, true>
9.51/9.59	<l11, l12, true>
9.51/9.59	<l12, l11, true>
9.51/9.59	<l7, l4, ((0 + WItemsNum^0) <= 2)>
9.51/9.59	<l7, l6, (3 <= (0 + WItemsNum^0)), par{WItemsNum^0 -> (~(1) + WItemsNum^0)}>
9.51/9.59	<l2, l6, ((0 + tmp1^0) <= 0) /\ (0 <= (0 + tmp1^0))>
9.51/9.59	<l2, l3, (1 <= (0 + tmp1^0))>
9.51/9.59	<l2, l3, ((1 + tmp1^0) <= 0)>
9.51/9.59	<l3, l5, (6 <= (0 + WItemsNum^0)), par{WItemsNum^0 -> (1 + WItemsNum^0)}>
9.51/9.59	<l3, l5, ((0 + WItemsNum^0) <= 5), par{WItemsNum^0 -> (1 + WItemsNum^0)}>
9.51/9.59	<l13, l4, (undef35 = undef35) /\ (undef33 = undef33), par{WItemsNum^0 -> undef33}>
9.51/9.59	<l14, l13, true>
9.51/9.59	
9.51/9.59	Fresh variables:
9.51/9.59	undef2, undef33, undef35, 
9.51/9.59	
9.51/9.59	Undef variables:
9.51/9.59	undef2, undef33, undef35, 
9.51/9.59	
9.51/9.59	Abstraction variables:
9.51/9.59	
9.51/9.59	Exit nodes:
9.51/9.59	
9.51/9.59	Accepting locations:
9.51/9.59	
9.51/9.59	Asserts:
9.51/9.59	
9.51/9.59	Preprocessed LLVMGraph
9.51/9.59	Init Location: 0
9.51/9.59	Transitions:
9.51/9.59	<l0, l5, (WItemsNum^0 = undef33) /\ (undef35 = undef35) /\ (undef33 = undef33)>
9.51/9.59	<l5, l6, (6 <= (0 + WItemsNum^0)) /\ (undef2 = undef2) /\ ((0 + undef2) <= 0) /\ (0 <= (0 + undef2))>
9.51/9.59	<l5, l5, (6 <= (0 + WItemsNum^0)) /\ (undef2 = undef2) /\ (1 <= (0 + undef2)) /\ (6 <= (0 + WItemsNum^0)), par{WItemsNum^0 -> (1 + WItemsNum^0)}>
9.51/9.59	<l5, l5, (6 <= (0 + WItemsNum^0)) /\ (undef2 = undef2) /\ ((1 + undef2) <= 0) /\ (6 <= (0 + WItemsNum^0)), par{WItemsNum^0 -> (1 + WItemsNum^0)}>
9.51/9.59	<l5, l5, ((0 + WItemsNum^0) <= 5) /\ ((0 + WItemsNum^0) <= 5), par{WItemsNum^0 -> (1 + WItemsNum^0)}>
9.51/9.59	<l6, l5, ((0 + WItemsNum^0) <= 2)>
9.51/9.59	<l6, l6, (3 <= (0 + WItemsNum^0)), par{WItemsNum^0 -> (~(1) + WItemsNum^0)}>
9.51/9.59	
9.51/9.59	Fresh variables:
9.51/9.59	undef2, undef33, undef35, 
9.51/9.59	
9.51/9.59	Undef variables:
9.51/9.59	undef2, undef33, undef35, 
9.51/9.59	
9.51/9.59	Abstraction variables:
9.51/9.59	
9.51/9.59	Exit nodes:
9.51/9.59	
9.51/9.59	Accepting locations:
9.51/9.59	
9.51/9.59	Asserts:
9.51/9.59	
9.51/9.59	*************************************************************
9.51/9.59	*******************************************************************************************
9.51/9.59	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
9.51/9.59	*******************************************************************************************
9.51/9.59	
9.51/9.59	Init Location: 0
9.51/9.59	Graph 0:
9.51/9.59	Transitions:
9.51/9.59	Variables:
9.51/9.59	
9.51/9.59	Graph 1:
9.51/9.59	Transitions:
9.51/9.59	<l5, l6, 6 <= WItemsNum^0 /\ undef2 = 0, {all remain the same}>
9.51/9.59	<l5, l5, 6 <= WItemsNum^0 /\ 1 <= undef2, {WItemsNum^0 -> 1 + WItemsNum^0, rest remain the same}>
9.51/9.59	<l5, l5, 6 <= WItemsNum^0 /\ 1 + undef2 <= 0, {WItemsNum^0 -> 1 + WItemsNum^0, rest remain the same}>
9.51/9.59	<l5, l5, WItemsNum^0 <= 5, {WItemsNum^0 -> 1 + WItemsNum^0, rest remain the same}>
9.51/9.59	<l6, l5, WItemsNum^0 <= 2, {all remain the same}>
9.51/9.59	<l6, l6, 3 <= WItemsNum^0, {WItemsNum^0 -> -1 + WItemsNum^0, rest remain the same}>
9.51/9.59	Variables:
9.51/9.59	WItemsNum^0
9.51/9.59	
9.51/9.59	Precedence: 
9.51/9.59	Graph 0
9.51/9.59	
9.51/9.59	Graph 1
9.51/9.59	<l0, l5, WItemsNum^0 = undef33, {all remain the same}>
9.51/9.59	
9.51/9.59	Map Locations to Subgraph:
9.51/9.59	( 0 , 0 )
9.51/9.59	( 5 , 1 )
9.51/9.59	( 6 , 1 )
9.51/9.59	
9.51/9.59	*******************************************************************************************
9.51/9.59	********************************    CHECKING ASSERTIONS    ********************************
9.51/9.59	*******************************************************************************************
9.51/9.59	
9.51/9.59	Proving termination of subgraph 0
9.51/9.59	Proving termination of subgraph 1
9.51/9.59	Checking unfeasibility...
9.51/9.59	Time used: 0.05961
9.51/9.59	
9.51/9.59	Checking conditional termination of SCC {l5, l6}...
9.51/9.59	
9.51/9.59	LOG: CALL solveLinear
9.51/9.59	
9.51/9.59	LOG: RETURN solveLinear - Elapsed time: 0.001538s
9.51/9.59	
9.51/9.59	LOG: CALL solveLinear
9.51/9.59	
9.51/9.59	LOG: RETURN solveLinear - Elapsed time: 0.024263s
9.51/9.59	Trying to remove transition: <l6, l6, 3 <= WItemsNum^0, {WItemsNum^0 -> -1 + WItemsNum^0, rest remain the same}>
9.51/9.59	Solving with 1 template(s).
9.51/9.59	
9.51/9.59	LOG: CALL solveNonLinearGetFirstSolution
9.51/9.59	
9.51/9.59	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.048712s
9.51/9.59	Time used: 0.048502
9.51/9.59	Trying to remove transition: <l5, l5, WItemsNum^0 <= 5, {WItemsNum^0 -> 1 + WItemsNum^0, rest remain the same}>
9.51/9.59	Solving with 1 template(s).
9.51/9.59	
9.51/9.59	LOG: CALL solveNonLinearGetFirstSolution
9.51/9.59	
9.51/9.59	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.078710s
9.51/9.59	Time used: 0.077837
9.51/9.59	Trying to remove transition: <l5, l5, 6 <= WItemsNum^0 /\ 1 + undef2 <= 0, {WItemsNum^0 -> 1 + WItemsNum^0, rest remain the same}>
9.51/9.59	Solving with 1 template(s).
9.51/9.59	
9.51/9.59	LOG: CALL solveNonLinearGetFirstSolution
9.51/9.59	
9.51/9.59	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013550s
9.51/9.59	Time used: 0.011384
9.51/9.59	Trying to remove transition: <l5, l5, 6 <= WItemsNum^0 /\ 1 <= undef2, {WItemsNum^0 -> 1 + WItemsNum^0, rest remain the same}>
9.51/9.59	Solving with 1 template(s).
9.51/9.59	
9.51/9.59	LOG: CALL solveNonLinearGetFirstSolution
9.51/9.59	
9.51/9.59	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010772s
9.51/9.59	Time used: 0.009939
9.51/9.59	Solving with 1 template(s).
9.51/9.59	
9.51/9.59	LOG: CALL solveNonLinearGetFirstSolution
9.51/9.59	
9.51/9.59	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002245s
9.51/9.59	Time used: 4.00088
9.51/9.59	Solving with 2 template(s).
9.51/9.59	
9.51/9.59	LOG: CALL solveNonLinearGetFirstSolution
9.51/9.59	
9.51/9.59	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005394s
9.51/9.59	Time used: 4.0011
9.51/9.59	Solving with 3 template(s).
9.51/9.59	
9.51/9.59	LOG: CALL solveNonLinearGetFirstSolution
9.51/9.59	
9.51/9.59	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.013138s
9.51/9.59	Time used: 1.00101
9.51/9.59	Solving with 1 template(s).
9.51/9.59	
9.51/9.59	LOG: CALL solveNonLinearGetFirstSolution
9.51/9.59	
9.51/9.59	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.235639s
9.51/9.59	Time used: 0.217281
9.51/9.59	Termination failed. Trying to show unreachability...
9.51/9.59	Proving unreachability of entry: <l0, l5, WItemsNum^0 = undef33, {all remain the same}>
9.51/9.59	
9.51/9.59	LOG: CALL check - Post:1 <= 0 - Process 1
9.51/9.59	* Exit transition: <l0, l5, WItemsNum^0 = undef33, {all remain the same}>
9.51/9.59	* Postcondition  : 1 <= 0
9.51/9.59	
9.51/9.59	LOG: CALL solveLinear
9.51/9.59	
9.51/9.59	LOG: RETURN solveLinear - Elapsed time: 0.004175s
9.51/9.59	> Postcondition is not implied!
9.51/9.59	
9.51/9.59	LOG: RETURN check - Elapsed time: 0.004302s
9.51/9.59	Cannot prove unreachability
9.51/9.59	
9.51/9.59	Proving non-termination of subgraph 1
9.51/9.59	Transitions:
9.51/9.59	<l5, l6, 6 <= WItemsNum^0 /\ undef2 = 0, {all remain the same}>
9.51/9.59	<l5, l5, 6 <= WItemsNum^0 /\ 1 <= undef2, {WItemsNum^0 -> 1 + WItemsNum^0, rest remain the same}>
9.51/9.59	<l5, l5, 6 <= WItemsNum^0 /\ 1 + undef2 <= 0, {WItemsNum^0 -> 1 + WItemsNum^0, rest remain the same}>
9.51/9.59	<l5, l5, WItemsNum^0 <= 5, {WItemsNum^0 -> 1 + WItemsNum^0, rest remain the same}>
9.51/9.59	<l6, l5, WItemsNum^0 <= 2, {all remain the same}>
9.51/9.59	<l6, l6, 3 <= WItemsNum^0, {WItemsNum^0 -> -1 + WItemsNum^0, rest remain the same}>
9.51/9.59	Variables:
9.51/9.59	WItemsNum^0
9.51/9.59	
9.51/9.59	Checking conditional non-termination of SCC {l5, l6}...
9.51/9.59	> No exit transition to close.
9.51/9.59	Calling reachability with...
9.51/9.59	Transition: <l5, end, true, {all remain the same}>
9.51/9.59	Conditions: 
9.51/9.59	OPEN EXITS: 
9.51/9.59	<l5, end, true, {all remain the same}>
9.51/9.59	
9.51/9.59	--- Reachability graph ---
9.51/9.59	> Graph without transitions.
9.51/9.59	
9.51/9.59	Calling reachability with...
9.51/9.59	Transition: <l0, l5, WItemsNum^0 = undef33, {all remain the same}>
9.51/9.59	Conditions: 
9.51/9.59	OPEN EXITS: 
9.51/9.59	<l0, l5, WItemsNum^0 = undef33, {all remain the same}>
9.51/9.59	
9.51/9.59	> Conditions are reachable!
9.51/9.59	
9.51/9.59	Program does NOT terminate
9.51/9.59	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
9.51/9.59	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
9.51/9.59	EOF