9.28/9.37	NO
9.28/9.37	
9.28/9.37	Solver Timeout: 4
9.28/9.37	Global Timeout: 300
9.28/9.37	No parsing errors!
9.28/9.37	Init Location: 0
9.28/9.37	Transitions:
9.28/9.37	<l0, l15, true>
9.28/9.37	<l1, l2, (6 <= (0 + WItemsNum^0))>
9.28/9.37	<l1, l3, ((0 + WItemsNum^0) <= 5) /\ (undef4 = undef4), par{tmp1^0 -> undef4}>
9.28/9.37	<l4, l5, true>
9.28/9.37	<l5, l1, true>
9.28/9.37	<l6, l7, true>
9.28/9.37	<l8, l9, true>
9.28/9.37	<l10, l11, true>
9.28/9.37	<l7, l4, ((0 + WItemsNum^0) <= 2)>
9.28/9.37	<l7, l6, (3 <= (0 + WItemsNum^0)), par{WItemsNum^0 -> (~(1) + WItemsNum^0)}>
9.28/9.37	<l11, l12, true>
9.28/9.37	<l12, l11, true>
9.28/9.37	<l2, l6, true>
9.28/9.37	<l13, l5, (6 <= (0 + WItemsNum^0)), par{WItemsNum^0 -> (1 + WItemsNum^0)}>
9.28/9.37	<l13, l5, ((0 + WItemsNum^0) <= 5), par{WItemsNum^0 -> (1 + WItemsNum^0)}>
9.28/9.37	<l3, l2, ((0 + tmp1^0) <= 0) /\ (0 <= (0 + tmp1^0))>
9.28/9.37	<l3, l13, (1 <= (0 + tmp1^0))>
9.28/9.37	<l3, l13, ((1 + tmp1^0) <= 0)>
9.28/9.37	<l14, l4, (undef37 = undef37) /\ (undef35 = undef35), par{WItemsNum^0 -> undef35}>
9.28/9.37	<l15, l14, true>
9.28/9.37	
9.28/9.37	Fresh variables:
9.28/9.37	undef4, undef35, undef37, 
9.28/9.37	
9.28/9.37	Undef variables:
9.28/9.37	undef4, undef35, undef37, 
9.28/9.37	
9.28/9.37	Abstraction variables:
9.28/9.37	
9.28/9.37	Exit nodes:
9.28/9.37	
9.28/9.37	Accepting locations:
9.28/9.37	
9.28/9.37	Asserts:
9.28/9.37	
9.28/9.37	Preprocessed LLVMGraph
9.28/9.37	Init Location: 0
9.28/9.37	Transitions:
9.28/9.37	<l0, l5, (WItemsNum^0 = undef35) /\ (undef37 = undef37) /\ (undef35 = undef35)>
9.28/9.37	<l5, l6, (6 <= (0 + WItemsNum^0))>
9.28/9.37	<l5, l6, ((0 + WItemsNum^0) <= 5) /\ (undef4 = undef4) /\ ((0 + undef4) <= 0) /\ (0 <= (0 + undef4))>
9.28/9.37	<l5, l5, ((0 + WItemsNum^0) <= 5) /\ (undef4 = undef4) /\ (1 <= (0 + undef4)) /\ ((0 + WItemsNum^0) <= 5), par{WItemsNum^0 -> (1 + WItemsNum^0)}>
9.28/9.37	<l5, l5, ((0 + WItemsNum^0) <= 5) /\ (undef4 = undef4) /\ ((1 + undef4) <= 0) /\ ((0 + WItemsNum^0) <= 5), par{WItemsNum^0 -> (1 + WItemsNum^0)}>
9.28/9.37	<l6, l5, ((0 + WItemsNum^0) <= 2)>
9.28/9.37	<l6, l6, (3 <= (0 + WItemsNum^0)), par{WItemsNum^0 -> (~(1) + WItemsNum^0)}>
9.28/9.37	
9.28/9.37	Fresh variables:
9.28/9.37	undef4, undef35, undef37, 
9.28/9.37	
9.28/9.37	Undef variables:
9.28/9.37	undef4, undef35, undef37, 
9.28/9.37	
9.28/9.37	Abstraction variables:
9.28/9.37	
9.28/9.37	Exit nodes:
9.28/9.37	
9.28/9.37	Accepting locations:
9.28/9.37	
9.28/9.37	Asserts:
9.28/9.37	
9.28/9.37	*************************************************************
9.28/9.37	*******************************************************************************************
9.28/9.37	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
9.28/9.37	*******************************************************************************************
9.28/9.37	
9.28/9.37	Init Location: 0
9.28/9.37	Graph 0:
9.28/9.37	Transitions:
9.28/9.37	Variables:
9.28/9.37	
9.28/9.37	Graph 1:
9.28/9.37	Transitions:
9.28/9.37	<l5, l6, 6 <= WItemsNum^0, {all remain the same}>
9.28/9.37	<l5, l6, WItemsNum^0 <= 5 /\ undef4 = 0, {all remain the same}>
9.28/9.37	<l5, l5, 1 <= undef4 /\ WItemsNum^0 <= 5, {WItemsNum^0 -> 1 + WItemsNum^0, rest remain the same}>
9.28/9.37	<l5, l5, 1 + undef4 <= 0 /\ WItemsNum^0 <= 5, {WItemsNum^0 -> 1 + WItemsNum^0, rest remain the same}>
9.28/9.37	<l6, l5, WItemsNum^0 <= 2, {all remain the same}>
9.28/9.37	<l6, l6, 3 <= WItemsNum^0, {WItemsNum^0 -> -1 + WItemsNum^0, rest remain the same}>
9.28/9.37	Variables:
9.28/9.37	WItemsNum^0
9.28/9.37	
9.28/9.37	Precedence: 
9.28/9.37	Graph 0
9.28/9.37	
9.28/9.37	Graph 1
9.28/9.37	<l0, l5, WItemsNum^0 = undef35, {all remain the same}>
9.28/9.37	
9.28/9.37	Map Locations to Subgraph:
9.28/9.37	( 0 , 0 )
9.28/9.37	( 5 , 1 )
9.28/9.37	( 6 , 1 )
9.28/9.37	
9.28/9.37	*******************************************************************************************
9.28/9.37	********************************    CHECKING ASSERTIONS    ********************************
9.28/9.37	*******************************************************************************************
9.28/9.37	
9.28/9.37	Proving termination of subgraph 0
9.28/9.37	Proving termination of subgraph 1
9.28/9.37	Checking unfeasibility...
9.28/9.37	Time used: 0.010863
9.28/9.37	
9.28/9.37	Checking conditional termination of SCC {l5, l6}...
9.28/9.37	
9.28/9.37	LOG: CALL solveLinear
9.28/9.37	
9.28/9.37	LOG: RETURN solveLinear - Elapsed time: 0.001281s
9.28/9.37	
9.28/9.37	LOG: CALL solveLinear
9.28/9.37	
9.28/9.37	LOG: RETURN solveLinear - Elapsed time: 0.013898s
9.28/9.37	Trying to remove transition: <l6, l6, 3 <= WItemsNum^0, {WItemsNum^0 -> -1 + WItemsNum^0, rest remain the same}>
9.28/9.37	Solving with 1 template(s).
9.28/9.37	
9.28/9.37	LOG: CALL solveNonLinearGetFirstSolution
9.28/9.37	
9.28/9.37	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.063428s
9.28/9.37	Time used: 0.063188
9.28/9.37	Trying to remove transition: <l5, l5, 1 + undef4 <= 0 /\ WItemsNum^0 <= 5, {WItemsNum^0 -> 1 + WItemsNum^0, rest remain the same}>
9.28/9.37	Solving with 1 template(s).
9.28/9.37	
9.28/9.37	LOG: CALL solveNonLinearGetFirstSolution
9.28/9.37	
9.28/9.37	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.040664s
9.28/9.37	Time used: 0.039762
9.28/9.37	Trying to remove transition: <l5, l5, 1 <= undef4 /\ WItemsNum^0 <= 5, {WItemsNum^0 -> 1 + WItemsNum^0, rest remain the same}>
9.28/9.37	Solving with 1 template(s).
9.28/9.37	
9.28/9.37	LOG: CALL solveNonLinearGetFirstSolution
9.28/9.37	
9.28/9.37	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.040288s
9.28/9.37	Time used: 0.038775
9.28/9.37	Solving with 1 template(s).
9.28/9.37	
9.28/9.37	LOG: CALL solveNonLinearGetFirstSolution
9.28/9.37	
9.28/9.37	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002045s
9.28/9.37	Time used: 4.00068
9.28/9.37	Solving with 2 template(s).
9.28/9.37	
9.28/9.37	LOG: CALL solveNonLinearGetFirstSolution
9.28/9.37	
9.28/9.37	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.013453s
9.28/9.37	Time used: 4.00071
9.28/9.37	Solving with 3 template(s).
9.28/9.37	
9.28/9.37	LOG: CALL solveNonLinearGetFirstSolution
9.28/9.37	
9.28/9.37	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.015174s
9.28/9.37	Time used: 1.00079
9.28/9.37	Solving with 1 template(s).
9.28/9.37	
9.28/9.37	LOG: CALL solveNonLinearGetFirstSolution
9.28/9.37	
9.28/9.37	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.046736s
9.28/9.37	Time used: 0.027165
9.28/9.37	Termination failed. Trying to show unreachability...
9.28/9.37	Proving unreachability of entry: <l0, l5, WItemsNum^0 = undef35, {all remain the same}>
9.28/9.37	
9.28/9.37	LOG: CALL check - Post:1 <= 0 - Process 1
9.28/9.37	* Exit transition: <l0, l5, WItemsNum^0 = undef35, {all remain the same}>
9.28/9.37	* Postcondition  : 1 <= 0
9.28/9.37	
9.28/9.37	LOG: CALL solveLinear
9.28/9.37	
9.28/9.37	LOG: RETURN solveLinear - Elapsed time: 0.003175s
9.28/9.37	> Postcondition is not implied!
9.28/9.37	
9.28/9.37	LOG: RETURN check - Elapsed time: 0.003291s
9.28/9.37	Cannot prove unreachability
9.28/9.37	
9.28/9.37	Proving non-termination of subgraph 1
9.28/9.37	Transitions:
9.28/9.37	<l5, l6, 6 <= WItemsNum^0, {all remain the same}>
9.28/9.37	<l5, l6, WItemsNum^0 <= 5 /\ undef4 = 0, {all remain the same}>
9.28/9.37	<l5, l5, 1 <= undef4 /\ WItemsNum^0 <= 5, {WItemsNum^0 -> 1 + WItemsNum^0, rest remain the same}>
9.28/9.37	<l5, l5, 1 + undef4 <= 0 /\ WItemsNum^0 <= 5, {WItemsNum^0 -> 1 + WItemsNum^0, rest remain the same}>
9.28/9.37	<l6, l5, WItemsNum^0 <= 2, {all remain the same}>
9.28/9.37	<l6, l6, 3 <= WItemsNum^0, {WItemsNum^0 -> -1 + WItemsNum^0, rest remain the same}>
9.28/9.37	Variables:
9.28/9.37	WItemsNum^0
9.28/9.37	
9.28/9.37	Checking conditional non-termination of SCC {l5, l6}...
9.28/9.37	> No exit transition to close.
9.28/9.37	Calling reachability with...
9.28/9.37	Transition: <l5, end, true, {all remain the same}>
9.28/9.37	Conditions: 
9.28/9.37	OPEN EXITS: 
9.28/9.37	<l5, end, true, {all remain the same}>
9.28/9.37	
9.28/9.37	--- Reachability graph ---
9.28/9.37	> Graph without transitions.
9.28/9.37	
9.28/9.37	Calling reachability with...
9.28/9.37	Transition: <l0, l5, WItemsNum^0 = undef35, {all remain the same}>
9.28/9.37	Conditions: 
9.28/9.37	OPEN EXITS: 
9.28/9.37	<l0, l5, WItemsNum^0 = undef35, {all remain the same}>
9.28/9.37	
9.28/9.37	> Conditions are reachable!
9.28/9.37	
9.28/9.37	Program does NOT terminate
9.28/9.37	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
9.28/9.37	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
9.28/9.37	EOF