1.69/1.72	NO
1.69/1.72	
1.69/1.72	Solver Timeout: 4
1.69/1.72	Global Timeout: 300
1.69/1.72	No parsing errors!
1.69/1.72	Init Location: 0
1.69/1.72	Transitions:
1.69/1.72	<l0, l7, true>
1.69/1.72	<l1, l2, true, par{len^0 -> (1 + len^0)}>
1.69/1.72	<l3, l1, (5 <= (0 + len^0))>
1.69/1.72	<l3, l1, ((1 + len^0) <= 4)>
1.69/1.72	<l3, l1, ((0 + len^0) <= 4) /\ (4 <= (0 + len^0)), par{len^0 -> 0}>
1.69/1.72	<l4, l5, ((0 + tmp^0) <= 0) /\ (0 <= (0 + tmp^0))>
1.69/1.72	<l4, l3, (1 <= (0 + tmp^0))>
1.69/1.72	<l4, l3, ((1 + tmp^0) <= 0)>
1.69/1.72	<l2, l4, (undef16 = undef16), par{tmp^0 -> undef16}>
1.69/1.72	<l6, l2, true, par{len^0 -> 0}>
1.69/1.72	<l7, l6, true>
1.69/1.72	
1.69/1.72	Fresh variables:
1.69/1.72	undef16, 
1.69/1.72	
1.69/1.72	Undef variables:
1.69/1.72	undef16, 
1.69/1.72	
1.69/1.72	Abstraction variables:
1.69/1.72	
1.69/1.72	Exit nodes:
1.69/1.72	
1.69/1.72	Accepting locations:
1.69/1.72	
1.69/1.72	Asserts:
1.69/1.72	
1.69/1.72	Preprocessed LLVMGraph
1.69/1.72	Init Location: 0
1.69/1.72	Transitions:
1.69/1.72	<l0, l2, (len^0 = 0)>
1.69/1.72	<l2, l5, (undef16 = undef16) /\ ((0 + undef16) <= 0) /\ (0 <= (0 + undef16))>
1.69/1.72	<l2, l2, (undef16 = undef16) /\ (1 <= (0 + undef16)) /\ (5 <= (0 + len^0)), par{len^0 -> (1 + len^0)}>
1.69/1.72	<l2, l2, (undef16 = undef16) /\ (1 <= (0 + undef16)) /\ ((1 + len^0) <= 4), par{len^0 -> (1 + len^0)}>
1.69/1.72	<l2, l2, (undef16 = undef16) /\ (1 <= (0 + undef16)) /\ ((0 + len^0) <= 4) /\ (4 <= (0 + len^0)), par{len^0 -> (1 + 0)}>
1.69/1.72	<l2, l2, (undef16 = undef16) /\ ((1 + undef16) <= 0) /\ (5 <= (0 + len^0)), par{len^0 -> (1 + len^0)}>
1.69/1.72	<l2, l2, (undef16 = undef16) /\ ((1 + undef16) <= 0) /\ ((1 + len^0) <= 4), par{len^0 -> (1 + len^0)}>
1.69/1.72	<l2, l2, (undef16 = undef16) /\ ((1 + undef16) <= 0) /\ ((0 + len^0) <= 4) /\ (4 <= (0 + len^0)), par{len^0 -> (1 + 0)}>
1.69/1.72	
1.69/1.72	Fresh variables:
1.69/1.72	undef16, 
1.69/1.72	
1.69/1.72	Undef variables:
1.69/1.72	undef16, 
1.69/1.72	
1.69/1.72	Abstraction variables:
1.69/1.72	
1.69/1.72	Exit nodes:
1.69/1.72	
1.69/1.72	Accepting locations:
1.69/1.72	
1.69/1.72	Asserts:
1.69/1.72	
1.69/1.72	*************************************************************
1.69/1.72	*******************************************************************************************
1.69/1.72	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
1.69/1.72	*******************************************************************************************
1.69/1.72	
1.69/1.72	Init Location: 0
1.69/1.72	Graph 0:
1.69/1.72	Transitions:
1.69/1.72	Variables:
1.69/1.72	
1.69/1.72	Graph 1:
1.69/1.72	Transitions:
1.69/1.72	<l2, l2, 1 <= undef16 /\ 5 <= len^0, {len^0 -> 1 + len^0, rest remain the same}>
1.69/1.72	<l2, l2, 1 <= undef16 /\ len^0 <= 3, {len^0 -> 1 + len^0, rest remain the same}>
1.69/1.72	<l2, l2, 1 <= undef16 /\ len^0 = 4, {len^0 -> 1, rest remain the same}>
1.69/1.72	<l2, l2, 1 + undef16 <= 0 /\ 5 <= len^0, {len^0 -> 1 + len^0, rest remain the same}>
1.69/1.72	<l2, l2, 1 + undef16 <= 0 /\ len^0 <= 3, {len^0 -> 1 + len^0, rest remain the same}>
1.69/1.72	<l2, l2, 1 + undef16 <= 0 /\ len^0 = 4, {len^0 -> 1, rest remain the same}>
1.69/1.72	Variables:
1.69/1.72	len^0
1.69/1.72	
1.69/1.72	Graph 2:
1.69/1.72	Transitions:
1.69/1.72	Variables:
1.69/1.72	
1.69/1.72	Precedence: 
1.69/1.72	Graph 0
1.69/1.72	
1.69/1.72	Graph 1
1.69/1.72	<l0, l2, len^0 = 0, {all remain the same}>
1.69/1.72	
1.69/1.72	Graph 2
1.69/1.72	<l2, l5, undef16 = 0, {all remain the same}>
1.69/1.72	
1.69/1.72	Map Locations to Subgraph:
1.69/1.72	( 0 , 0 )
1.69/1.72	( 2 , 1 )
1.69/1.72	( 5 , 2 )
1.69/1.72	
1.69/1.72	*******************************************************************************************
1.69/1.72	********************************    CHECKING ASSERTIONS    ********************************
1.69/1.72	*******************************************************************************************
1.69/1.72	
1.69/1.72	Proving termination of subgraph 0
1.69/1.72	Proving termination of subgraph 1
1.69/1.72	Checking unfeasibility...
1.69/1.72	Time used: 0.022067
1.69/1.72	Some transition disabled by a set of invariant(s):
1.69/1.72	Invariant at l2: len^0 <= 4
1.69/1.72	
1.69/1.72	Strengthening and disabling transitions...
1.69/1.72	> It's unfeasible. Removing transition: 
1.69/1.72	<l2, l2, 1 + undef16 <= 0 /\ 5 <= len^0, {len^0 -> 1 + len^0, rest remain the same}>
1.69/1.72	
1.69/1.72	LOG: CALL solverLinear in Graph for feasibility
1.69/1.72	
1.69/1.72	LOG: RETURN solveLinear in Graph for feasibility
1.69/1.72	It's unfeasible. Removing transition: 
1.69/1.72	<l2, l2, 1 <= undef16 /\ 5 <= len^0, {len^0 -> 1 + len^0, rest remain the same}>
1.69/1.72	
1.69/1.72	LOG: CALL solverLinear in Graph for feasibility
1.69/1.72	
1.69/1.72	LOG: RETURN solveLinear in Graph for feasibility
1.69/1.72	Strengthening transition (result): 
1.69/1.72	<l2, l2, 1 <= undef16 /\ len^0 <= 3, {len^0 -> 1 + len^0, rest remain the same}>
1.69/1.72	
1.69/1.72	LOG: CALL solverLinear in Graph for feasibility
1.69/1.72	
1.69/1.72	LOG: RETURN solveLinear in Graph for feasibility
1.69/1.72	Strengthening transition (result): 
1.69/1.72	<l2, l2, 1 <= undef16 /\ len^0 = 4, {len^0 -> 1, rest remain the same}>
1.69/1.72	
1.69/1.72	LOG: CALL solverLinear in Graph for feasibility
1.69/1.72	
1.69/1.72	LOG: RETURN solveLinear in Graph for feasibility
1.69/1.72	Strengthening transition (result): 
1.69/1.72	<l2, l2, 1 + undef16 <= 0 /\ len^0 <= 3, {len^0 -> 1 + len^0, rest remain the same}>
1.69/1.72	
1.69/1.72	LOG: CALL solverLinear in Graph for feasibility
1.69/1.72	
1.69/1.72	LOG: RETURN solveLinear in Graph for feasibility
1.69/1.72	Strengthening transition (result): 
1.69/1.72	<l2, l2, 1 + undef16 <= 0 /\ len^0 = 4, {len^0 -> 1, rest remain the same}>
1.69/1.72	Checking unfeasibility...
1.69/1.72	Time used: 0.012595
1.69/1.72	
1.69/1.72	Checking conditional termination of SCC {l2}...
1.69/1.72	
1.69/1.72	LOG: CALL solveLinear
1.69/1.72	
1.69/1.72	LOG: RETURN solveLinear - Elapsed time: 0.001482s
1.69/1.72	
1.69/1.72	LOG: CALL solveLinear
1.69/1.72	
1.69/1.72	LOG: RETURN solveLinear - Elapsed time: 0.019879s
1.69/1.72	Trying to remove transition: <l2, l2, 1 + undef16 <= 0 /\ len^0 = 4, {len^0 -> 1, rest remain the same}>
1.69/1.72	Solving with 1 template(s).
1.69/1.72	
1.69/1.72	LOG: CALL solveNonLinearGetFirstSolution
1.69/1.72	
1.69/1.72	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.059324s
1.69/1.72	Time used: 0.058945
1.69/1.72	Trying to remove transition: <l2, l2, 1 + undef16 <= 0 /\ len^0 <= 3, {len^0 -> 1 + len^0, rest remain the same}>
1.69/1.72	Solving with 1 template(s).
1.69/1.72	
1.69/1.72	LOG: CALL solveNonLinearGetFirstSolution
1.69/1.72	
1.69/1.72	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.025941s
1.69/1.72	Time used: 0.024894
1.69/1.72	Trying to remove transition: <l2, l2, 1 <= undef16 /\ len^0 = 4, {len^0 -> 1, rest remain the same}>
1.69/1.72	Solving with 1 template(s).
1.69/1.72	
1.69/1.72	LOG: CALL solveNonLinearGetFirstSolution
1.69/1.72	
1.69/1.72	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.062294s
1.69/1.72	Time used: 0.061482
1.69/1.72	Trying to remove transition: <l2, l2, 1 <= undef16 /\ len^0 <= 3, {len^0 -> 1 + len^0, rest remain the same}>
1.69/1.72	Solving with 1 template(s).
1.69/1.72	
1.69/1.72	LOG: CALL solveNonLinearGetFirstSolution
1.69/1.72	
1.69/1.72	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.027120s
1.69/1.72	Time used: 0.025927
1.69/1.72	Solving with 1 template(s).
1.69/1.72	
1.69/1.72	LOG: CALL solveNonLinearGetFirstSolution
1.69/1.72	
1.69/1.72	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.054119s
1.69/1.72	Time used: 0.053271
1.69/1.72	Solving with 2 template(s).
1.69/1.72	
1.69/1.72	LOG: CALL solveNonLinearGetFirstSolution
1.69/1.72	
1.69/1.72	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.279964s
1.69/1.72	Time used: 0.277678
1.69/1.72	Solving with 3 template(s).
1.69/1.72	
1.69/1.72	LOG: CALL solveNonLinearGetFirstSolution
1.69/1.72	
1.69/1.72	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.009063s
1.69/1.72	Time used: 1.00083
1.69/1.72	Solving with 1 template(s).
1.69/1.72	
1.69/1.72	LOG: CALL solveNonLinearGetFirstSolution
1.69/1.72	
1.69/1.72	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.070845s
1.69/1.72	Time used: 0.054119
1.69/1.72	Termination failed. Trying to show unreachability...
1.69/1.72	Proving unreachability of entry: <l0, l2, len^0 = 0, {all remain the same}>
1.69/1.72	
1.69/1.72	LOG: CALL check - Post:1 <= 0 - Process 1
1.69/1.72	* Exit transition: <l0, l2, len^0 = 0, {all remain the same}>
1.69/1.72	* Postcondition  : 1 <= 0
1.69/1.72	
1.69/1.72	LOG: CALL solveLinear
1.69/1.72	
1.69/1.72	LOG: RETURN solveLinear - Elapsed time: 0.002855s
1.69/1.72	> Postcondition is not implied!
1.69/1.72	
1.69/1.72	LOG: RETURN check - Elapsed time: 0.002947s
1.69/1.72	Cannot prove unreachability
1.69/1.72	
1.69/1.72	Proving non-termination of subgraph 1
1.69/1.72	Transitions:
1.69/1.72	<l2, l2, 1 <= undef16 /\ len^0 <= 3, {len^0 -> 1 + len^0, rest remain the same}>
1.69/1.72	<l2, l2, 1 <= undef16 /\ len^0 = 4, {len^0 -> 1, rest remain the same}>
1.69/1.72	<l2, l2, 1 + undef16 <= 0 /\ len^0 <= 3, {len^0 -> 1 + len^0, rest remain the same}>
1.69/1.72	<l2, l2, 1 + undef16 <= 0 /\ len^0 = 4, {len^0 -> 1, rest remain the same}>
1.69/1.72	Variables:
1.69/1.72	len^0
1.69/1.72	
1.69/1.72	Checking conditional non-termination of SCC {l2}...
1.69/1.72	> No exit transition to close.
1.69/1.72	Calling reachability with...
1.69/1.72	Transition: <l2, end, true, {all remain the same}>
1.69/1.72	Conditions: 
1.69/1.72	OPEN EXITS: 
1.69/1.72	<l2, end, true, {all remain the same}>
1.69/1.72	
1.69/1.72	--- Reachability graph ---
1.69/1.72	> Graph without transitions.
1.69/1.72	
1.69/1.72	Calling reachability with...
1.69/1.72	Transition: <l0, l2, len^0 = 0, {all remain the same}>
1.69/1.72	Conditions: 
1.69/1.72	OPEN EXITS: 
1.69/1.72	<l0, l2, len^0 = 0, {all remain the same}>
1.69/1.72	
1.69/1.72	> Conditions are reachable!
1.69/1.72	
1.69/1.72	Program does NOT terminate
1.69/1.72	/export/starexec/sandbox2/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
1.69/1.72	/export/starexec/sandbox2/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
1.69/1.72	EOF