52.94/53.00	NO
52.94/53.00	
52.94/53.00	Solver Timeout: 4
52.94/53.00	Global Timeout: 300
52.94/53.00	No parsing errors!
52.94/53.00	Init Location: 0
52.94/53.00	Transitions:
52.94/53.00	<l0, l9, true>
52.94/53.00	<l1, l2, ((0 + conditional^0) <= 1)>
52.94/53.00	<l1, l3, (2 <= (0 + conditional^0)), par{num^0 -> (1 + num^0)}>
52.94/53.00	<l4, l5, ((0 + conditional^0) <= 1), par{IoCreateDevice^0 -> 0, status^0 -> 1}>
52.94/53.00	<l4, l1, (2 <= (0 + conditional^0)) /\ (undef37 = undef37), par{IoCreateDevice^0 -> 0, Pdo^0 -> 0, conditional^0 -> undef37}>
52.94/53.00	<l2, l6, true, par{PPBunlockInits^0 -> 1, num^0 -> 0}>
52.94/53.00	<l6, l2, true>
52.94/53.00	<l7, l2, ((0 + DName^0) <= 0)>
52.94/53.00	<l7, l4, (1 <= (0 + DName^0)) /\ (undef77 = undef77), par{IoCreateDevice^0 -> 1, conditional^0 -> undef77}>
52.94/53.00	<l5, l3, true, par{i^0 -> (~(1) + i^0)}>
52.94/53.00	<l5, l3, true, par{i^0 -> (1 + i^0)}>
52.94/53.00	<l3, l2, ((0 + Pdolen^0) <= (0 + i^0)), par{status^0 -> 0}>
52.94/53.00	<l3, l7, ((1 + i^0) <= (0 + Pdolen^0)) /\ (undef111 = undef111), par{DName^0 -> undef111, PPBlockInits^0 -> 1, status^0 -> 0}>
52.94/53.00	<l8, l3, (undef128 = undef128) /\ (undef126 = undef126), par{IoCreateDevice^0 -> 0, PPBlockInits^0 -> 1, PPBunlockInits^0 -> 0, Pdolen^0 -> undef126, i^0 -> undef128, status^0 -> 0}>
52.94/53.00	<l9, l8, true>
52.94/53.00	
52.94/53.00	Fresh variables:
52.94/53.00	undef37, undef77, undef111, undef126, undef128, 
52.94/53.00	
52.94/53.00	Undef variables:
52.94/53.00	undef37, undef77, undef111, undef126, undef128, 
52.94/53.00	
52.94/53.00	Abstraction variables:
52.94/53.00	
52.94/53.00	Exit nodes:
52.94/53.00	
52.94/53.00	Accepting locations:
52.94/53.00	
52.94/53.00	Asserts:
52.94/53.00	
52.94/53.00	Preprocessed LLVMGraph
52.94/53.00	Init Location: 0
52.94/53.00	Transitions:
52.94/53.00	<l0, l3, (Pdolen^0 = undef126) /\ (i^0 = undef128) /\ (undef128 = undef128) /\ (undef126 = undef126)>
52.94/53.00	<l2, l2, true, par{num^0 -> 0}>
52.94/53.00	<l3, l2, ((0 + Pdolen^0) <= (0 + i^0))>
52.94/53.00	<l3, l2, ((1 + i^0) <= (0 + Pdolen^0)) /\ (undef111 = undef111) /\ ((0 + undef111) <= 0)>
52.94/53.00	<l3, l3, ((1 + i^0) <= (0 + Pdolen^0)) /\ (undef111 = undef111) /\ (1 <= (0 + undef111)) /\ (undef77 = undef77) /\ ((0 + undef77) <= 1), par{i^0 -> (~(1) + i^0)}>
52.94/53.00	<l3, l3, ((1 + i^0) <= (0 + Pdolen^0)) /\ (undef111 = undef111) /\ (1 <= (0 + undef111)) /\ (undef77 = undef77) /\ ((0 + undef77) <= 1), par{i^0 -> (1 + i^0)}>
52.94/53.00	<l3, l2, ((1 + i^0) <= (0 + Pdolen^0)) /\ (undef111 = undef111) /\ (1 <= (0 + undef111)) /\ (undef77 = undef77) /\ (2 <= (0 + undef77)) /\ (undef37 = undef37) /\ ((0 + undef37) <= 1)>
52.94/53.00	<l3, l3, ((1 + i^0) <= (0 + Pdolen^0)) /\ (undef111 = undef111) /\ (1 <= (0 + undef111)) /\ (undef77 = undef77) /\ (2 <= (0 + undef77)) /\ (undef37 = undef37) /\ (2 <= (0 + undef37)), par{num^0 -> (1 + num^0)}>
52.94/53.00	
52.94/53.00	Fresh variables:
52.94/53.00	undef37, undef77, undef111, undef126, undef128, 
52.94/53.00	
52.94/53.00	Undef variables:
52.94/53.00	undef37, undef77, undef111, undef126, undef128, 
52.94/53.00	
52.94/53.00	Abstraction variables:
52.94/53.00	
52.94/53.00	Exit nodes:
52.94/53.00	
52.94/53.00	Accepting locations:
52.94/53.00	
52.94/53.00	Asserts:
52.94/53.00	
52.94/53.00	*************************************************************
52.94/53.00	*******************************************************************************************
52.94/53.00	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
52.94/53.00	*******************************************************************************************
52.94/53.00	
52.94/53.00	Init Location: 0
52.94/53.00	Graph 0:
52.94/53.00	Transitions:
52.94/53.00	Variables:
52.94/53.00	
52.94/53.00	Graph 1:
52.94/53.00	Transitions:
52.94/53.00	<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ undef77 <= 1, {i^0 -> -1 + i^0, rest remain the same}>
52.94/53.00	<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ undef77 <= 1, {i^0 -> 1 + i^0, rest remain the same}>
52.94/53.00	<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ 2 <= undef37 /\ 2 <= undef77, {num^0 -> 1 + num^0, rest remain the same}>
52.94/53.00	Variables:
52.94/53.00	Pdolen^0, i^0, num^0
52.94/53.00	
52.94/53.00	Graph 2:
52.94/53.00	Transitions:
52.94/53.00	<l2, l2, true, {num^0 -> 0, rest remain the same}>
52.94/53.00	Variables:
52.94/53.00	
52.94/53.00	Precedence: 
52.94/53.00	Graph 0
52.94/53.00	
52.94/53.00	Graph 1
52.94/53.00	<l0, l3, Pdolen^0 = undef126 /\ i^0 = undef128, {all remain the same}>
52.94/53.00	
52.94/53.00	Graph 2
52.94/53.00	<l3, l2, Pdolen^0 <= i^0, {all remain the same}>
52.94/53.00	<l3, l2, undef111 <= 0 /\ 1 + i^0 <= Pdolen^0, {all remain the same}>
52.94/53.00	<l3, l2, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ 2 <= undef77 /\ undef37 <= 1, {all remain the same}>
52.94/53.00	
52.94/53.00	Map Locations to Subgraph:
52.94/53.00	( 0 , 0 )
52.94/53.00	( 2 , 2 )
52.94/53.00	( 3 , 1 )
52.94/53.00	
52.94/53.00	*******************************************************************************************
52.94/53.00	********************************    CHECKING ASSERTIONS    ********************************
52.94/53.00	*******************************************************************************************
52.94/53.00	
52.94/53.00	Proving termination of subgraph 0
52.94/53.00	Proving termination of subgraph 1
52.94/53.00	Checking unfeasibility...
52.94/53.00	Time used: 0.008134
52.94/53.00	
52.94/53.00	Checking conditional termination of SCC {l3}...
52.94/53.00	
52.94/53.00	LOG: CALL solveLinear
52.94/53.00	
52.94/53.00	LOG: RETURN solveLinear - Elapsed time: 0.001740s
52.94/53.00	
52.94/53.00	LOG: CALL solveLinear
52.94/53.00	
52.94/53.00	LOG: RETURN solveLinear - Elapsed time: 0.011916s
52.94/53.00	Trying to remove transition: <l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ 2 <= undef37 /\ 2 <= undef77, {num^0 -> 1 + num^0, rest remain the same}>
52.94/53.00	Solving with 1 template(s).
52.94/53.00	
52.94/53.00	LOG: CALL solveNonLinearGetFirstSolution
52.94/53.00	
52.94/53.00	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016255s
52.94/53.00	Time used: 0.015928
52.94/53.00	Trying to remove transition: <l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ undef77 <= 1, {i^0 -> 1 + i^0, rest remain the same}>
52.94/53.00	Solving with 1 template(s).
52.94/53.00	
52.94/53.00	LOG: CALL solveNonLinearGetFirstSolution
52.94/53.00	
52.94/53.00	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012228s
52.94/53.00	Time used: 0.011194
52.94/53.00	Trying to remove transition: <l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ undef77 <= 1, {i^0 -> -1 + i^0, rest remain the same}>
52.94/53.00	Solving with 1 template(s).
52.94/53.00	
52.94/53.00	LOG: CALL solveNonLinearGetFirstSolution
52.94/53.00	
52.94/53.00	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009517s
52.94/53.00	Time used: 0.008789
52.94/53.00	Solving with 1 template(s).
52.94/53.00	
52.94/53.00	LOG: CALL solveNonLinearGetFirstSolution
52.94/53.00	
52.94/53.00	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.033724s
52.94/53.00	Time used: 0.032863
52.94/53.00	Improving Solution with cost 1 ...
52.94/53.00	
52.94/53.00	LOG: CALL solveNonLinearGetNextSolution
52.94/53.00	
52.94/53.00	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.094738s
52.94/53.00	Time used: 0.09471
52.94/53.00	
52.94/53.00	LOG: SAT solveNonLinear - Elapsed time: 0.128462s
52.94/53.00	Cost: 1; Total time: 0.127573
52.94/53.00	Failed at location 3: 1 + Pdolen^0 <= i^0
52.94/53.00	Before Improving: 
52.94/53.00	Quasi-invariant at l3: 1 + Pdolen^0 <= i^0
52.94/53.00	Optimizing invariants...
52.94/53.00	
52.94/53.00	LOG: CALL solveLinear
52.94/53.00	
52.94/53.00	LOG: RETURN solveLinear - Elapsed time: 0.010809s
52.94/53.00	Remaining time after improvement: 0.996794
52.94/53.00	Termination implied by a set of quasi-invariant(s):
52.94/53.00	Quasi-invariant at l3: 1 + Pdolen^0 <= i^0
52.94/53.00	[ Invariant Graph ]
52.94/53.00	Strengthening and disabling transitions...
52.94/53.00	
52.94/53.00	LOG: CALL solverLinear in Graph for feasibility
52.94/53.00	
52.94/53.00	LOG: RETURN solveLinear in Graph for feasibility
52.94/53.00	It's unfeasible. Removing transition: 
52.94/53.00	<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ undef77 <= 1, {i^0 -> -1 + i^0, rest remain the same}>
52.94/53.00	
52.94/53.00	LOG: CALL solverLinear in Graph for feasibility
52.94/53.00	
52.94/53.00	LOG: RETURN solveLinear in Graph for feasibility
52.94/53.00	It's unfeasible. Removing transition: 
52.94/53.00	<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ undef77 <= 1, {i^0 -> 1 + i^0, rest remain the same}>
52.94/53.00	
52.94/53.00	LOG: CALL solverLinear in Graph for feasibility
52.94/53.00	
52.94/53.00	LOG: RETURN solveLinear in Graph for feasibility
52.94/53.00	It's unfeasible. Removing transition: 
52.94/53.00	<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ 2 <= undef37 /\ 2 <= undef77, {num^0 -> 1 + num^0, rest remain the same}>
52.94/53.00	[ Termination Graph ]
52.94/53.00	Strengthening and disabling transitions...
52.94/53.00	> It's unfeasible. Removing transition: 
52.94/53.00	<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ 2 <= undef37 /\ 2 <= undef77, {num^0 -> 1 + num^0, rest remain the same}>
52.94/53.00	
52.94/53.00	LOG: CALL solverLinear in Graph for feasibility
52.94/53.00	
52.94/53.00	LOG: RETURN solveLinear in Graph for feasibility
52.94/53.00	It's unfeasible. Removing transition: 
52.94/53.00	<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ undef77 <= 1, {i^0 -> -1 + i^0, rest remain the same}>
52.94/53.00	
52.94/53.00	LOG: CALL solverLinear in Graph for feasibility
52.94/53.00	
52.94/53.00	LOG: RETURN solveLinear in Graph for feasibility
52.94/53.00	It's unfeasible. Removing transition: 
52.94/53.00	<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ undef77 <= 1, {i^0 -> 1 + i^0, rest remain the same}>
52.94/53.00	New Graphs: 
52.94/53.00	Calling Safety with literal 1 + Pdolen^0 <= i^0 and entry <l0, l3, Pdolen^0 = undef126 /\ i^0 = undef128, {all remain the same}>
52.94/53.00	
52.94/53.00	LOG: CALL check - Post:1 + Pdolen^0 <= i^0 - Process 1
52.94/53.00	* Exit transition: <l0, l3, Pdolen^0 = undef126 /\ i^0 = undef128, {all remain the same}>
52.94/53.00	* Postcondition  : 1 + Pdolen^0 <= i^0
52.94/53.00	
52.94/53.00	LOG: CALL solveLinear
52.94/53.00	
52.94/53.00	LOG: RETURN solveLinear - Elapsed time: 0.000855s
52.94/53.00	> Postcondition is not implied!
52.94/53.00	
52.94/53.00	LOG: RETURN check - Elapsed time: 0.000949s
52.94/53.00	INVARIANTS: 
52.94/53.00	3: 
52.94/53.00	Quasi-INVARIANTS to narrow Graph: 
52.94/53.00	3: 1 + Pdolen^0 <= i^0 , 
52.94/53.00	Narrowing transition: 
52.94/53.00	<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ undef77 <= 1, {i^0 -> -1 + i^0, rest remain the same}>
52.94/53.00	
52.94/53.00	LOG: Narrow transition size 1
52.94/53.00	Narrowing transition: 
52.94/53.00	<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ undef77 <= 1, {i^0 -> 1 + i^0, rest remain the same}>
52.94/53.00	
52.94/53.00	LOG: Narrow transition size 1
52.94/53.00	Narrowing transition: 
52.94/53.00	<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ 2 <= undef37 /\ 2 <= undef77, {num^0 -> 1 + num^0, rest remain the same}>
52.94/53.00	
52.94/53.00	LOG: Narrow transition size 1
52.94/53.00	invGraph after Narrowing: 
52.94/53.00	Transitions:
52.94/53.00	<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ undef77 <= 1, {i^0 -> -1 + i^0, rest remain the same}>
52.94/53.00	<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ undef77 <= 1, {i^0 -> 1 + i^0, rest remain the same}>
52.94/53.00	<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ 2 <= undef37 /\ 2 <= undef77, {num^0 -> 1 + num^0, rest remain the same}>
52.94/53.00	Variables:
52.94/53.00	Pdolen^0, i^0, num^0
52.94/53.00	Checking conditional termination of SCC {l3}...
52.94/53.00	
52.94/53.00	LOG: CALL solveLinear
52.94/53.00	
52.94/53.00	LOG: RETURN solveLinear - Elapsed time: 0.001581s
52.94/53.00	
52.94/53.00	LOG: CALL solveLinear
52.94/53.00	
52.94/53.00	LOG: RETURN solveLinear - Elapsed time: 0.012116s
52.94/53.00	Trying to remove transition: <l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ 2 <= undef37 /\ 2 <= undef77, {num^0 -> 1 + num^0, rest remain the same}>
52.94/53.00	Solving with 1 template(s).
52.94/53.00	
52.94/53.00	LOG: CALL solveNonLinearGetFirstSolution
52.94/53.00	
52.94/53.00	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013437s
52.94/53.00	Time used: 0.012878
52.94/53.00	Trying to remove transition: <l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ undef77 <= 1, {i^0 -> 1 + i^0, rest remain the same}>
52.94/53.00	Solving with 1 template(s).
52.94/53.00	
52.94/53.00	LOG: CALL solveNonLinearGetFirstSolution
52.94/53.00	
52.94/53.00	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012495s
52.94/53.00	Time used: 0.011383
52.94/53.00	Trying to remove transition: <l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ undef77 <= 1, {i^0 -> -1 + i^0, rest remain the same}>
52.94/53.00	Solving with 1 template(s).
52.94/53.00	
52.94/53.00	LOG: CALL solveNonLinearGetFirstSolution
52.94/53.00	
52.94/53.00	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009739s
52.94/53.00	Time used: 0.008918
52.94/53.00	Solving with 1 template(s).
52.94/53.00	
52.94/53.00	LOG: CALL solveNonLinearGetFirstSolution
52.94/53.00	
52.94/53.00	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.035972s
52.94/53.00	Time used: 0.03502
52.94/53.00	Improving Solution with cost 1 ...
52.94/53.00	
52.94/53.00	LOG: CALL solveNonLinearGetNextSolution
52.94/53.00	
52.94/53.00	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.059718s
52.94/53.00	Time used: 0.059702
52.94/53.00	
52.94/53.00	LOG: SAT solveNonLinear - Elapsed time: 0.095690s
52.94/53.00	Cost: 1; Total time: 0.094722
52.94/53.00	Failed at location 3: Pdolen^0 <= i^0
52.94/53.00	Before Improving: 
52.94/53.00	Quasi-invariant at l3: Pdolen^0 <= i^0
52.94/53.00	Optimizing invariants...
52.94/53.00	
52.94/53.00	LOG: CALL solveLinear
52.94/53.00	
52.94/53.00	LOG: RETURN solveLinear - Elapsed time: 0.011357s
52.94/53.00	Remaining time after improvement: 0.996282
52.94/53.00	Termination implied by a set of quasi-invariant(s):
52.94/53.00	Quasi-invariant at l3: Pdolen^0 <= i^0
52.94/53.00	[ Invariant Graph ]
52.94/53.00	Strengthening and disabling transitions...
52.94/53.00	
52.94/53.00	LOG: CALL solverLinear in Graph for feasibility
52.94/53.00	
52.94/53.00	LOG: RETURN solveLinear in Graph for feasibility
52.94/53.00	It's unfeasible. Removing transition: 
52.94/53.00	<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ undef77 <= 1, {i^0 -> -1 + i^0, rest remain the same}>
52.94/53.00	
52.94/53.00	LOG: CALL solverLinear in Graph for feasibility
52.94/53.00	
52.94/53.00	LOG: RETURN solveLinear in Graph for feasibility
52.94/53.00	It's unfeasible. Removing transition: 
52.94/53.00	<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ undef77 <= 1, {i^0 -> 1 + i^0, rest remain the same}>
52.94/53.00	
52.94/53.00	LOG: CALL solverLinear in Graph for feasibility
52.94/53.00	
52.94/53.00	LOG: RETURN solveLinear in Graph for feasibility
52.94/53.00	It's unfeasible. Removing transition: 
52.94/53.00	<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ 2 <= undef37 /\ 2 <= undef77, {num^0 -> 1 + num^0, rest remain the same}>
52.94/53.00	[ Termination Graph ]
52.94/53.00	Strengthening and disabling transitions...
52.94/53.00	> It's unfeasible. Removing transition: 
52.94/53.00	<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ undef77 <= 1, {i^0 -> -1 + i^0, rest remain the same}>
52.94/53.00	
52.94/53.00	LOG: CALL solverLinear in Graph for feasibility
52.94/53.00	
52.94/53.00	LOG: RETURN solveLinear in Graph for feasibility
52.94/53.00	It's unfeasible. Removing transition: 
52.94/53.00	<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ undef77 <= 1, {i^0 -> 1 + i^0, rest remain the same}>
52.94/53.00	
52.94/53.00	LOG: CALL solverLinear in Graph for feasibility
52.94/53.00	
52.94/53.00	LOG: RETURN solveLinear in Graph for feasibility
52.94/53.00	It's unfeasible. Removing transition: 
52.94/53.00	<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ 2 <= undef37 /\ 2 <= undef77, {num^0 -> 1 + num^0, rest remain the same}>
52.94/53.00	New Graphs: 
52.94/53.00	Calling Safety with literal Pdolen^0 <= i^0 and entry <l0, l3, i^0 <= Pdolen^0 /\ Pdolen^0 = undef126 /\ i^0 = undef128, {all remain the same}>
52.94/53.00	
52.94/53.00	LOG: CALL check - Post:Pdolen^0 <= i^0 - Process 2
52.94/53.00	* Exit transition: <l0, l3, i^0 <= Pdolen^0 /\ Pdolen^0 = undef126 /\ i^0 = undef128, {all remain the same}>
52.94/53.00	* Postcondition  : Pdolen^0 <= i^0
52.94/53.00	
52.94/53.00	LOG: CALL solveLinear
52.94/53.00	
52.94/53.00	LOG: RETURN solveLinear - Elapsed time: 0.000921s
52.94/53.00	> Postcondition is not implied!
52.94/53.00	
52.94/53.00	LOG: RETURN check - Elapsed time: 0.001020s
52.94/53.00	INVARIANTS: 
52.94/53.00	3: 
52.94/53.00	Quasi-INVARIANTS to narrow Graph: 
52.94/53.00	3: Pdolen^0 <= i^0 , 
52.94/53.00	Narrowing transition: 
52.94/53.00	<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ undef77 <= 1, {i^0 -> -1 + i^0, rest remain the same}>
52.94/53.00	
52.94/53.00	LOG: Narrow transition size 1
52.94/53.00	Narrowing transition: 
52.94/53.00	<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ undef77 <= 1, {i^0 -> 1 + i^0, rest remain the same}>
52.94/53.00	
52.94/53.00	LOG: Narrow transition size 1
52.94/53.00	Narrowing transition: 
52.94/53.00	<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ 2 <= undef37 /\ 2 <= undef77, {num^0 -> 1 + num^0, rest remain the same}>
52.94/53.00	
52.94/53.00	LOG: Narrow transition size 1
52.94/53.00	invGraph after Narrowing: 
52.94/53.00	Transitions:
52.94/53.00	<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ undef77 <= 1, {i^0 -> -1 + i^0, rest remain the same}>
52.94/53.00	<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ undef77 <= 1, {i^0 -> 1 + i^0, rest remain the same}>
52.94/53.00	<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ 2 <= undef37 /\ 2 <= undef77, {num^0 -> 1 + num^0, rest remain the same}>
52.94/53.00	Variables:
52.94/53.00	Pdolen^0, i^0, num^0
52.94/53.00	Checking conditional termination of SCC {l3}...
52.94/53.00	
52.94/53.00	LOG: CALL solveLinear
52.94/53.00	
52.94/53.00	LOG: RETURN solveLinear - Elapsed time: 0.001580s
52.94/53.00	
52.94/53.00	LOG: CALL solveLinear
52.94/53.00	
52.94/53.00	LOG: RETURN solveLinear - Elapsed time: 0.012175s
52.94/53.00	Trying to remove transition: <l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ 2 <= undef37 /\ 2 <= undef77, {num^0 -> 1 + num^0, rest remain the same}>
52.94/53.00	Solving with 1 template(s).
52.94/53.00	
52.94/53.00	LOG: CALL solveNonLinearGetFirstSolution
52.94/53.00	
52.94/53.00	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013491s
52.94/53.00	Time used: 0.01289
52.94/53.00	Trying to remove transition: <l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ undef77 <= 1, {i^0 -> 1 + i^0, rest remain the same}>
52.94/53.00	Solving with 1 template(s).
52.94/53.00	
52.94/53.00	LOG: CALL solveNonLinearGetFirstSolution
52.94/53.00	
52.94/53.00	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012409s
52.94/53.00	Time used: 0.011298
52.94/53.00	Trying to remove transition: <l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ undef77 <= 1, {i^0 -> -1 + i^0, rest remain the same}>
52.94/53.00	Solving with 1 template(s).
52.94/53.00	
52.94/53.00	LOG: CALL solveNonLinearGetFirstSolution
52.94/53.00	
52.94/53.00	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009707s
52.94/53.00	Time used: 0.008883
52.94/53.00	Solving with 1 template(s).
52.94/53.00	
52.94/53.00	LOG: CALL solveNonLinearGetFirstSolution
52.94/53.00	
52.94/53.00	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002510s
52.94/53.00	Time used: 4.00075
52.94/53.00	Solving with 2 template(s).
52.94/53.00	
52.94/53.00	LOG: CALL solveNonLinearGetFirstSolution
52.94/53.00	
52.94/53.00	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.017641s
52.94/53.00	Time used: 4.00062
52.94/53.00	Solving with 3 template(s).
52.94/53.00	
52.94/53.00	LOG: CALL solveNonLinearGetFirstSolution
52.94/53.00	
52.94/53.00	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.009306s
52.94/53.00	Time used: 1.00013
52.94/53.00	Solving with 1 template(s).
52.94/53.00	
52.94/53.00	LOG: CALL solveNonLinearGetFirstSolution
52.94/53.00	
52.94/53.00	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.074304s
52.94/53.00	Time used: 0.033419
52.94/53.00	Improving Solution with cost 1 ...
52.94/53.00	
52.94/53.00	LOG: CALL solveNonLinearGetNextSolution
52.94/53.00	
52.94/53.00	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.067754s
52.94/53.00	Time used: 0.067738
52.94/53.00	
52.94/53.00	LOG: SAT solveNonLinear - Elapsed time: 0.142059s
52.94/53.00	Cost: 1; Total time: 0.101157
52.94/53.00	Termination implied by a set of invariant(s):
52.94/53.00	Invariant at l3: i^0 <= 1 + Pdolen^0
52.94/53.00	[ Invariant Graph ]
52.94/53.00	Strengthening and disabling transitions...
52.94/53.00	
52.94/53.00	LOG: CALL solverLinear in Graph for feasibility
52.94/53.00	
52.94/53.00	LOG: RETURN solveLinear in Graph for feasibility
52.94/53.00	Strengthening transition (result): 
52.94/53.00	<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ undef77 <= 1, {i^0 -> -1 + i^0, rest remain the same}>
52.94/53.00	
52.94/53.00	LOG: CALL solverLinear in Graph for feasibility
52.94/53.00	
52.94/53.00	LOG: RETURN solveLinear in Graph for feasibility
52.94/53.00	Strengthening transition (result): 
52.94/53.00	<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ undef77 <= 1, {i^0 -> 1 + i^0, rest remain the same}>
52.94/53.00	
52.94/53.00	LOG: CALL solverLinear in Graph for feasibility
52.94/53.00	
52.94/53.00	LOG: RETURN solveLinear in Graph for feasibility
52.94/53.00	Strengthening transition (result): 
52.94/53.00	<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ 2 <= undef37 /\ 2 <= undef77, {num^0 -> 1 + num^0, rest remain the same}>
52.94/53.00	[ Termination Graph ]
52.94/53.00	Strengthening and disabling transitions...
52.94/53.00	
52.94/53.00	LOG: CALL solverLinear in Graph for feasibility
52.94/53.00	
52.94/53.00	LOG: RETURN solveLinear in Graph for feasibility
52.94/53.00	Strengthening transition (result): 
52.94/53.00	<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ undef77 <= 1, {i^0 -> -1 + i^0, rest remain the same}>
52.94/53.00	
52.94/53.00	LOG: CALL solverLinear in Graph for feasibility
52.94/53.00	
52.94/53.00	LOG: RETURN solveLinear in Graph for feasibility
52.94/53.00	Strengthening transition (result): 
52.94/53.00	<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ undef77 <= 1, {i^0 -> 1 + i^0, rest remain the same}>
52.94/53.00	
52.94/53.00	LOG: CALL solverLinear in Graph for feasibility
52.94/53.00	
52.94/53.00	LOG: RETURN solveLinear in Graph for feasibility
52.94/53.00	Strengthening transition (result): 
52.94/53.00	<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ 2 <= undef37 /\ 2 <= undef77, {num^0 -> 1 + num^0, rest remain the same}>
52.94/53.00	Quasi-ranking function: 50000 - num^0
52.94/53.00	New Graphs: 
52.94/53.00	Transitions:
52.94/53.00	<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ undef77 <= 1, {i^0 -> -1 + i^0, rest remain the same}>
52.94/53.00	<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ undef77 <= 1, {i^0 -> 1 + i^0, rest remain the same}>
52.94/53.00	<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ 2 <= undef37 /\ 2 <= undef77 /\ 50001 <= num^0, {num^0 -> 1 + num^0, rest remain the same}>
52.94/53.00	Variables:
52.94/53.00	Pdolen^0, i^0, num^0
52.94/53.00	Checking conditional termination of SCC {l3}...
52.94/53.00	
52.94/53.00	LOG: CALL solveLinear
52.94/53.00	
52.94/53.00	LOG: RETURN solveLinear - Elapsed time: 0.001814s
52.94/53.00	
52.94/53.00	LOG: CALL solveLinear
52.94/53.00	
52.94/53.00	LOG: RETURN solveLinear - Elapsed time: 0.014530s
52.94/53.00	Trying to remove transition: <l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ 2 <= undef37 /\ 2 <= undef77 /\ 50001 <= num^0, {num^0 -> 1 + num^0, rest remain the same}>
52.94/53.00	Solving with 1 template(s).
52.94/53.00	
52.94/53.00	LOG: CALL solveNonLinearGetFirstSolution
52.94/53.00	
52.94/53.00	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.017606s
52.94/53.00	Time used: 0.017093
52.94/53.00	Trying to remove transition: <l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ undef77 <= 1, {i^0 -> 1 + i^0, rest remain the same}>
52.94/53.00	Solving with 1 template(s).
52.94/53.00	
52.94/53.00	LOG: CALL solveNonLinearGetFirstSolution
52.94/53.00	
52.94/53.00	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.014790s
52.94/53.00	Time used: 0.013575
52.94/53.00	Trying to remove transition: <l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ undef77 <= 1, {i^0 -> -1 + i^0, rest remain the same}>
52.94/53.00	Solving with 1 template(s).
52.94/53.00	
52.94/53.00	LOG: CALL solveNonLinearGetFirstSolution
52.94/53.00	
52.94/53.00	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011555s
52.94/53.00	Time used: 0.010704
52.94/53.00	Solving with 1 template(s).
52.94/53.00	
52.94/53.00	LOG: CALL solveNonLinearGetFirstSolution
52.94/53.00	
52.94/53.00	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.019666s
52.94/53.00	Time used: 4.01796
52.94/53.00	Solving with 2 template(s).
52.94/53.00	
52.94/53.00	LOG: CALL solveNonLinearGetFirstSolution
52.94/53.00	
52.94/53.00	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.018083s
52.94/53.00	Time used: 4.00087
52.94/53.00	Solving with 3 template(s).
52.94/53.00	
52.94/53.00	LOG: CALL solveNonLinearGetFirstSolution
52.94/53.00	
52.94/53.00	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.009466s
52.94/53.00	Time used: 1.00011
52.94/53.00	Solving with 1 template(s).
52.94/53.00	
52.94/53.00	LOG: CALL solveNonLinearGetFirstSolution
52.94/53.00	
52.94/53.00	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.054264s
52.94/53.00	Time used: 0.034182
52.94/53.00	Improving Solution with cost 1 ...
52.94/53.00	
52.94/53.00	LOG: CALL solveNonLinearGetNextSolution
52.94/53.00	
52.94/53.00	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.061074s
52.94/53.00	Time used: 0.061058
52.94/53.00	
52.94/53.00	LOG: SAT solveNonLinear - Elapsed time: 0.115339s
52.94/53.00	Cost: 1; Total time: 0.09524
52.94/53.00	Quasi-ranking function: 50000 + Pdolen^0 - num^0
52.94/53.00	New Graphs: 
52.94/53.00	Transitions:
52.94/53.00	<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ undef77 <= 1, {i^0 -> -1 + i^0, rest remain the same}>
52.94/53.00	<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ undef77 <= 1, {i^0 -> 1 + i^0, rest remain the same}>
52.94/53.00	<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ 2 <= undef37 /\ 2 <= undef77 /\ 50001 + Pdolen^0 <= num^0 /\ 50001 <= num^0, {num^0 -> 1 + num^0, rest remain the same}>
52.94/53.00	Variables:
52.94/53.00	Pdolen^0, i^0, num^0
52.94/53.00	Checking conditional termination of SCC {l3}...
52.94/53.00	
52.94/53.00	LOG: CALL solveLinear
52.94/53.00	
52.94/53.00	LOG: RETURN solveLinear - Elapsed time: 0.001999s
52.94/53.00	
52.94/53.00	LOG: CALL solveLinear
52.94/53.00	
52.94/53.00	LOG: RETURN solveLinear - Elapsed time: 0.016050s
52.94/53.00	Trying to remove transition: <l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ 2 <= undef37 /\ 2 <= undef77 /\ 50001 + Pdolen^0 <= num^0 /\ 50001 <= num^0, {num^0 -> 1 + num^0, rest remain the same}>
52.94/53.00	Solving with 1 template(s).
52.94/53.00	
52.94/53.00	LOG: CALL solveNonLinearGetFirstSolution
52.94/53.00	
52.94/53.00	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015809s
52.94/53.00	Time used: 0.015067
52.94/53.00	Trying to remove transition: <l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ undef77 <= 1, {i^0 -> 1 + i^0, rest remain the same}>
52.94/53.00	Solving with 1 template(s).
52.94/53.00	
52.94/53.00	LOG: CALL solveNonLinearGetFirstSolution
52.94/53.00	
52.94/53.00	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015011s
52.94/53.00	Time used: 0.013791
52.94/53.00	Trying to remove transition: <l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ undef77 <= 1, {i^0 -> -1 + i^0, rest remain the same}>
52.94/53.00	Solving with 1 template(s).
52.94/53.00	
52.94/53.00	LOG: CALL solveNonLinearGetFirstSolution
52.94/53.00	
52.94/53.00	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012278s
52.94/53.00	Time used: 0.01137
52.94/53.00	Solving with 1 template(s).
52.94/53.00	
52.94/53.00	LOG: CALL solveNonLinearGetFirstSolution
52.94/53.00	
52.94/53.00	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.010905s
52.94/53.00	Time used: 4.00916
52.94/53.00	Solving with 2 template(s).
52.94/53.00	
52.94/53.00	LOG: CALL solveNonLinearGetFirstSolution
52.94/53.00	
52.94/53.00	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.012905s
52.94/53.00	Time used: 4.00096
52.94/53.00	Solving with 3 template(s).
52.94/53.00	
52.94/53.00	LOG: CALL solveNonLinearGetFirstSolution
52.94/53.00	
52.94/53.00	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.009906s
52.94/53.00	Time used: 1.00003
52.94/53.00	Solving with 1 template(s).
52.94/53.00	
52.94/53.00	LOG: CALL solveNonLinearGetFirstSolution
52.94/53.00	
52.94/53.00	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.053861s
52.94/53.00	Time used: 0.033311
52.94/53.00	Improving Solution with cost 1 ...
52.94/53.00	
52.94/53.00	LOG: CALL solveNonLinearGetNextSolution
52.94/53.00	
52.94/53.00	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.070811s
52.94/53.00	Time used: 0.070793
52.94/53.00	
52.94/53.00	LOG: SAT solveNonLinear - Elapsed time: 0.124672s
52.94/53.00	Cost: 1; Total time: 0.104104
52.94/53.00	Quasi-ranking function: 50000 - Pdolen^0 - num^0
52.94/53.00	New Graphs: 
52.94/53.00	Transitions:
52.94/53.00	<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ undef77 <= 1, {i^0 -> -1 + i^0, rest remain the same}>
52.94/53.00	<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ undef77 <= 1, {i^0 -> 1 + i^0, rest remain the same}>
52.94/53.00	<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ 2 <= undef37 /\ 2 <= undef77 /\ 50001 + Pdolen^0 <= num^0 /\ 50001 <= Pdolen^0 + num^0 /\ 50001 <= num^0, {num^0 -> 1 + num^0, rest remain the same}>
52.94/53.00	Variables:
52.94/53.00	Pdolen^0, i^0, num^0
52.94/53.00	Checking conditional termination of SCC {l3}...
52.94/53.00	
52.94/53.00	LOG: CALL solveLinear
52.94/53.00	
52.94/53.00	LOG: RETURN solveLinear - Elapsed time: 0.002106s
52.94/53.00	
52.94/53.00	LOG: CALL solveLinear
52.94/53.00	
52.94/53.00	LOG: RETURN solveLinear - Elapsed time: 0.016472s
52.94/53.00	Trying to remove transition: <l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ 2 <= undef37 /\ 2 <= undef77 /\ 50001 + Pdolen^0 <= num^0 /\ 50001 <= Pdolen^0 + num^0 /\ 50001 <= num^0, {num^0 -> 1 + num^0, rest remain the same}>
52.94/53.00	Solving with 1 template(s).
52.94/53.00	
52.94/53.00	LOG: CALL solveNonLinearGetFirstSolution
52.94/53.00	
52.94/53.00	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.019471s
52.94/53.00	Time used: 0.01882
52.94/53.00	Trying to remove transition: <l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ undef77 <= 1, {i^0 -> 1 + i^0, rest remain the same}>
52.94/53.00	Solving with 1 template(s).
52.94/53.00	
52.94/53.00	LOG: CALL solveNonLinearGetFirstSolution
52.94/53.00	
52.94/53.00	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016186s
52.94/53.00	Time used: 0.014969
52.94/53.00	Trying to remove transition: <l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ undef77 <= 1, {i^0 -> -1 + i^0, rest remain the same}>
52.94/53.00	Solving with 1 template(s).
52.94/53.00	
52.94/53.00	LOG: CALL solveNonLinearGetFirstSolution
52.94/53.00	
52.94/53.00	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013660s
52.94/53.00	Time used: 0.012739
52.94/53.00	Solving with 1 template(s).
52.94/53.00	
52.94/53.00	LOG: CALL solveNonLinearGetFirstSolution
52.94/53.00	
52.94/53.00	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.011434s
52.94/53.00	Time used: 4.00965
52.94/53.00	Solving with 2 template(s).
52.94/53.00	
52.94/53.00	LOG: CALL solveNonLinearGetFirstSolution
52.94/53.00	
52.94/53.00	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.016236s
52.94/53.00	Time used: 4.00102
52.94/53.00	Solving with 3 template(s).
52.94/53.00	
52.94/53.00	LOG: CALL solveNonLinearGetFirstSolution
52.94/53.00	
52.94/53.00	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.009464s
52.94/53.00	Time used: 1.00005
52.94/53.00	Solving with 1 template(s).
52.94/53.00	
52.94/53.00	LOG: CALL solveNonLinearGetFirstSolution
52.94/53.00	
52.94/53.00	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.059188s
52.94/53.00	Time used: 0.039449
52.94/53.00	
52.94/53.00	Proving non-termination of subgraph 1
52.94/53.00	Transitions:
52.94/53.00	<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ undef77 <= 1, {i^0 -> -1 + i^0, rest remain the same}>
52.94/53.00	<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ undef77 <= 1, {i^0 -> 1 + i^0, rest remain the same}>
52.94/53.00	<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ 2 <= undef37 /\ 2 <= undef77, {num^0 -> 1 + num^0, rest remain the same}>
52.94/53.00	Variables:
52.94/53.00	Pdolen^0, i^0, num^0
52.94/53.00	
52.94/53.00	Checking conditional non-termination of SCC {l3}...
52.94/53.00	EXIT TRANSITIONS:
52.94/53.00	<l3, end, Pdolen^0 <= i^0, {all remain the same}>
52.94/53.00	
52.94/53.00	Solving with 1 template(s).
52.94/53.00	
52.94/53.00	LOG: CALL solveNonLinearGetFirstSolution
52.94/53.00	
52.94/53.00	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.002842s
52.94/53.00	Time used: 5.00154
52.94/53.00	Solving with 2 template(s).
52.94/53.00	
52.94/53.00	LOG: CALL solveNonLinearGetFirstSolution
52.94/53.00	
52.94/53.00	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.013340s
52.94/53.00	Time used: 5.00188
52.94/53.00	Solving with 3 template(s).
52.94/53.00	
52.94/53.00	LOG: CALL solveNonLinearGetFirstSolution
52.94/53.00	
52.94/53.00	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.014363s
52.94/53.00	Time used: 5.00096
52.94/53.00	> Checking if the negation of the conditions of every pending exit is quasi-invariant... NO
52.94/53.00	
52.94/53.00	Proving non-termination of subgraph 1
52.94/53.00	Transitions:
52.94/53.00	<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ undef77 <= 1, {i^0 -> -1 + i^0, rest remain the same}>
52.94/53.00	<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ undef77 <= 1, {i^0 -> 1 + i^0, rest remain the same}>
52.94/53.00	<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ 2 <= undef37 /\ 2 <= undef77 /\ 50001 + Pdolen^0 <= num^0 /\ 50001 <= Pdolen^0 + num^0 /\ 50001 <= num^0, {num^0 -> 1 + num^0, rest remain the same}>
52.94/53.00	Variables:
52.94/53.00	Pdolen^0, i^0, num^0
52.94/53.00	
52.94/53.00	Checking conditional non-termination of SCC {l3}...
52.94/53.00	EXIT TRANSITIONS:
52.94/53.00	<l3, end, Pdolen^0 <= i^0 /\ 50001 <= Pdolen^0 + num^0 /\ num^0 <= 50000 + Pdolen^0, {all remain the same}>
52.94/53.00	<l3, end, Pdolen^0 <= i^0 /\ Pdolen^0 + num^0 <= 50000 /\ num^0 <= 50000 + Pdolen^0 /\ num^0 <= 50000, {all remain the same}>
52.94/53.00	<l3, end, Pdolen^0 <= i^0 /\ 50001 + Pdolen^0 <= num^0 /\ 50001 <= Pdolen^0 + num^0 /\ 50001 <= num^0, {all remain the same}>
52.94/53.00	<l3, end, Pdolen^0 <= i^0 /\ 50001 + Pdolen^0 <= num^0 /\ Pdolen^0 + num^0 <= 50000, {all remain the same}>
52.94/53.00	
52.94/53.00	Solving with 1 template(s).
52.94/53.00	
52.94/53.00	LOG: CALL solveNonLinearGetFirstSolution
52.94/53.00	
52.94/53.00	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.078104s
52.94/53.00	Time used: 0.077667
52.94/53.00	Improving Solution with cost 4 ...
52.94/53.00	
52.94/53.00	LOG: CALL solveNonLinearGetNextSolution
52.94/53.00	
52.94/53.00	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.307094s
52.94/53.00	Time used: 0.307041
52.94/53.00	Improving Solution with cost 1 ...
52.94/53.00	
52.94/53.00	LOG: CALL solveNonLinearGetNextSolution
52.94/53.00	
52.94/53.00	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.071368s
52.94/53.00	Time used: 0.071348
52.94/53.00	
52.94/53.00	LOG: SAT solveNonLinear - Elapsed time: 0.456565s
52.94/53.00	Cost: 1; Total time: 0.456056
52.94/53.00	Failed at location 3: 1 + i^0 <= Pdolen^0
52.94/53.00	Before Improving: 
52.94/53.00	Quasi-invariant at l3: 1 + i^0 <= Pdolen^0
52.94/53.00	Optimizing invariants...
52.94/53.00	
52.94/53.00	LOG: CALL solveLinear
52.94/53.00	
52.94/53.00	LOG: RETURN solveLinear - Elapsed time: 0.009115s
52.94/53.00	Remaining time after improvement: 0.996203
52.94/53.00	Minimizing number of undef constraints...
52.94/53.00	
52.94/53.00	LOG: CALL solveNonLinear
52.94/53.00	
52.94/53.00	LOG: RETURN solveNonLinear - Elapsed time: 0.009130s
52.94/53.00	Number of undef constraints reduced!
52.94/53.00	
52.94/53.00	Non-termination implied by a set of quasi-invariant(s):
52.94/53.00	Quasi-invariant at l3: 1 + i^0 <= Pdolen^0
52.94/53.00	Constraint over undef '6 <= undef77' in transition:
52.94/53.00	<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ undef77 <= 1, {i^0 -> 1 + i^0, rest remain the same}>
52.94/53.00	
52.94/53.00	Strengthening and disabling EXIT transitions...
52.94/53.00	Closed exits from l3: 4
52.94/53.00	
52.94/53.00	Strengthening and disabling transitions...
52.94/53.00	
52.94/53.00	LOG: CALL solverLinear in Graph for feasibility
52.94/53.00	
52.94/53.00	LOG: RETURN solveLinear in Graph for feasibility
52.94/53.00	Strengthening transition (result): 
52.94/53.00	<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ undef77 <= 1, {i^0 -> -1 + i^0, rest remain the same}>
52.94/53.00	
52.94/53.00	LOG: CALL solverLinear in Graph for feasibility
52.94/53.00	
52.94/53.00	LOG: RETURN solveLinear in Graph for feasibility
52.94/53.00	It's unfeasible. Removing transition: 
52.94/53.00	<l3, l3, 1 <= 0, {i^0 -> 1 + i^0, rest remain the same}>
52.94/53.00	
52.94/53.00	LOG: CALL solverLinear in Graph for feasibility
52.94/53.00	
52.94/53.00	LOG: RETURN solveLinear in Graph for feasibility
52.94/53.00	Strengthening transition (result): 
52.94/53.00	<l3, l3, 1 + i^0 <= Pdolen^0 /\ 1 <= undef111 /\ 2 <= undef37 /\ 2 <= undef77 /\ 50001 + Pdolen^0 <= num^0 /\ 50001 <= Pdolen^0 + num^0 /\ 50001 <= num^0, {num^0 -> 1 + num^0, rest remain the same}>
52.94/53.00	
52.94/53.00	Calling reachability with...
52.94/53.00	Transition: <l3, end, true, {all remain the same}>
52.94/53.00	Conditions: 1 + i^0 <= Pdolen^0, 
52.94/53.00	OPEN EXITS: 
52.94/53.00	<l3, end, 1 + i^0 <= Pdolen^0, {all remain the same}>
52.94/53.00	
52.94/53.00	--- Reachability graph ---
52.94/53.00	> Graph without transitions.
52.94/53.00	
52.94/53.00	Calling reachability with...
52.94/53.00	Transition: <l0, l3, Pdolen^0 = undef126 /\ i^0 = undef128, {all remain the same}>
52.94/53.00	Conditions: 1 + i^0 <= Pdolen^0, 
52.94/53.00	OPEN EXITS: 
52.94/53.00	<l0, l3, 1 + i^0 <= Pdolen^0 /\ Pdolen^0 = undef126 /\ i^0 = undef128, {all remain the same}>
52.94/53.00	
52.94/53.00	> Conditions are reachable!
52.94/53.00	
52.94/53.00	Program does NOT terminate
52.94/53.00	/export/starexec/sandbox2/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
52.94/53.00	/export/starexec/sandbox2/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
52.94/53.00	EOF