16.78/16.82	NO
16.78/16.82	
16.78/16.82	Solver Timeout: 4
16.78/16.82	Global Timeout: 300
16.78/16.82	No parsing errors!
16.78/16.82	Init Location: 0
16.78/16.82	Transitions:
16.78/16.82	<l0, l4, true>
16.78/16.82	<l1, l2, (1 <= (1 + len_98^0)) /\ (1 <= (0 + len_98^0)) /\ (undef5 = undef5) /\ (undef1 = (0 + l_11^0)) /\ (1 <= (1 + undef5)) /\ (1 <= (0 + undef5)) /\ (undef3 = undef3) /\ (0 <= (0 + (~(1) * undef1))) /\ ((0 + (~(1) * undef1)) <= 0), par{elem_13^0 -> undef1, l_11^0 -> (0 + x_12^0), len_98^0 -> undef3}>
16.78/16.82	<l2, l1, true>
16.78/16.82	<l3, l1, true>
16.78/16.82	<l4, l3, true>
16.78/16.82	
16.78/16.82	Fresh variables:
16.78/16.82	undef1, undef3, undef5, 
16.78/16.82	
16.78/16.82	Undef variables:
16.78/16.82	undef1, undef3, undef5, 
16.78/16.82	
16.78/16.82	Abstraction variables:
16.78/16.82	
16.78/16.82	Exit nodes:
16.78/16.82	
16.78/16.82	Accepting locations:
16.78/16.82	
16.78/16.82	Asserts:
16.78/16.82	
16.78/16.82	Preprocessed LLVMGraph
16.78/16.82	Init Location: 0
16.78/16.82	Transitions:
16.78/16.82	<l0, l1, true>
16.78/16.82	<l1, l1, (1 <= (1 + len_98^0)) /\ (1 <= (0 + len_98^0)) /\ (undef5 = undef5) /\ (undef1 = (0 + l_11^0)) /\ (1 <= (1 + undef5)) /\ (1 <= (0 + undef5)) /\ (undef3 = undef3) /\ (0 <= (0 + (~(1) * undef1))) /\ ((0 + (~(1) * undef1)) <= 0), par{l_11^0 -> (0 + x_12^0), len_98^0 -> undef3}>
16.78/16.82	
16.78/16.82	Fresh variables:
16.78/16.82	undef1, undef3, undef5, 
16.78/16.82	
16.78/16.82	Undef variables:
16.78/16.82	undef1, undef3, undef5, 
16.78/16.82	
16.78/16.82	Abstraction variables:
16.78/16.82	
16.78/16.82	Exit nodes:
16.78/16.82	
16.78/16.82	Accepting locations:
16.78/16.82	
16.78/16.82	Asserts:
16.78/16.82	
16.78/16.82	*************************************************************
16.78/16.82	*******************************************************************************************
16.78/16.82	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
16.78/16.82	*******************************************************************************************
16.78/16.82	
16.78/16.82	Init Location: 0
16.78/16.82	Graph 0:
16.78/16.82	Transitions:
16.78/16.82	Variables:
16.78/16.82	
16.78/16.82	Graph 1:
16.78/16.82	Transitions:
16.78/16.82	<l1, l1, 1 <= len_98^0 /\ 1 <= undef5 /\ l_11^0 = undef1 /\ undef1 = 0, {l_11^0 -> x_12^0, len_98^0 -> undef3, rest remain the same}>
16.78/16.82	Variables:
16.78/16.82	l_11^0, len_98^0, x_12^0
16.78/16.82	
16.78/16.82	Precedence: 
16.78/16.82	Graph 0
16.78/16.82	
16.78/16.82	Graph 1
16.78/16.82	<l0, l1, true, {all remain the same}>
16.78/16.82	
16.78/16.82	Map Locations to Subgraph:
16.78/16.82	( 0 , 0 )
16.78/16.82	( 1 , 1 )
16.78/16.82	
16.78/16.82	*******************************************************************************************
16.78/16.82	********************************    CHECKING ASSERTIONS    ********************************
16.78/16.82	*******************************************************************************************
16.78/16.82	
16.78/16.82	Proving termination of subgraph 0
16.78/16.82	Proving termination of subgraph 1
16.78/16.82	Checking unfeasibility...
16.78/16.82	Time used: 0.002371
16.78/16.82	
16.78/16.82	Checking conditional termination of SCC {l1}...
16.78/16.82	
16.78/16.82	LOG: CALL solveLinear
16.78/16.82	
16.78/16.82	LOG: RETURN solveLinear - Elapsed time: 0.000721s
16.78/16.82	
16.78/16.82	LOG: CALL solveLinear
16.78/16.82	
16.78/16.82	LOG: RETURN solveLinear - Elapsed time: 0.002622s
16.78/16.82	Trying to remove transition: <l1, l1, 1 <= len_98^0 /\ 1 <= undef5 /\ l_11^0 = undef1 /\ undef1 = 0, {l_11^0 -> x_12^0, len_98^0 -> undef3, rest remain the same}>
16.78/16.82	Solving with 1 template(s).
16.78/16.82	
16.78/16.82	LOG: CALL solveNonLinearGetFirstSolution
16.78/16.82	
16.78/16.82	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006581s
16.78/16.82	Time used: 0.006376
16.78/16.82	Solving with 1 template(s).
16.78/16.82	
16.78/16.82	LOG: CALL solveNonLinearGetFirstSolution
16.78/16.82	
16.78/16.82	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008514s
16.78/16.82	Time used: 0.007984
16.78/16.82	Improving Solution with cost 1 ...
16.78/16.82	
16.78/16.82	LOG: CALL solveNonLinearGetNextSolution
16.78/16.82	
16.78/16.82	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.015237s
16.78/16.82	Time used: 0.015232
16.78/16.82	
16.78/16.82	LOG: SAT solveNonLinear - Elapsed time: 0.023751s
16.78/16.82	Cost: 1; Total time: 0.023216
16.78/16.82	Failed at location 1: 1 + len_98^0 <= l_11^0
16.78/16.82	Before Improving: 
16.78/16.82	Quasi-invariant at l1: 1 + len_98^0 <= l_11^0
16.78/16.82	Optimizing invariants...
16.78/16.82	
16.78/16.82	LOG: CALL solveLinear
16.78/16.82	
16.78/16.82	LOG: RETURN solveLinear - Elapsed time: 0.002586s
16.78/16.82	Remaining time after improvement: 0.998757
16.78/16.82	Termination implied by a set of quasi-invariant(s):
16.78/16.82	Quasi-invariant at l1: 1 + len_98^0 <= l_11^0
16.78/16.82	[ Invariant Graph ]
16.78/16.82	Strengthening and disabling transitions...
16.78/16.82	
16.78/16.82	LOG: CALL solverLinear in Graph for feasibility
16.78/16.82	
16.78/16.82	LOG: RETURN solveLinear in Graph for feasibility
16.78/16.82	It's unfeasible. Removing transition: 
16.78/16.82	<l1, l1, 1 <= len_98^0 /\ 1 <= undef5 /\ l_11^0 = undef1 /\ undef1 = 0, {l_11^0 -> x_12^0, len_98^0 -> undef3, rest remain the same}>
16.78/16.82	[ Termination Graph ]
16.78/16.82	Strengthening and disabling transitions...
16.78/16.82	
16.78/16.82	LOG: CALL solverLinear in Graph for feasibility
16.78/16.82	
16.78/16.82	LOG: RETURN solveLinear in Graph for feasibility
16.78/16.82	It's unfeasible. Removing transition: 
16.78/16.82	<l1, l1, 1 <= len_98^0 /\ 1 <= undef5 /\ l_11^0 = undef1 /\ undef1 = 0, {l_11^0 -> x_12^0, len_98^0 -> undef3, rest remain the same}>
16.78/16.82	New Graphs: 
16.78/16.82	Calling Safety with literal 1 + len_98^0 <= l_11^0 and entry <l0, l1, true, {all remain the same}>
16.78/16.82	
16.78/16.82	LOG: CALL check - Post:1 + len_98^0 <= l_11^0 - Process 1
16.78/16.82	* Exit transition: <l0, l1, true, {all remain the same}>
16.78/16.82	* Postcondition  : 1 + len_98^0 <= l_11^0
16.78/16.82	
16.78/16.82	LOG: CALL solveLinear
16.78/16.82	
16.78/16.82	LOG: RETURN solveLinear - Elapsed time: 0.000404s
16.78/16.82	> Postcondition is not implied!
16.78/16.82	
16.78/16.82	LOG: RETURN check - Elapsed time: 0.000476s
16.78/16.82	INVARIANTS: 
16.78/16.82	1: 
16.78/16.82	Quasi-INVARIANTS to narrow Graph: 
16.78/16.82	1: 1 + len_98^0 <= l_11^0 , 
16.78/16.82	Narrowing transition: 
16.78/16.82	<l1, l1, 1 <= len_98^0 /\ 1 <= undef5 /\ l_11^0 = undef1 /\ undef1 = 0, {l_11^0 -> x_12^0, len_98^0 -> undef3, rest remain the same}>
16.78/16.82	
16.78/16.82	LOG: Narrow transition size 1
16.78/16.82	invGraph after Narrowing: 
16.78/16.82	Transitions:
16.78/16.82	<l1, l1, 1 <= len_98^0 /\ 1 <= undef5 /\ l_11^0 <= len_98^0 /\ l_11^0 = undef1 /\ undef1 = 0, {l_11^0 -> x_12^0, len_98^0 -> undef3, rest remain the same}>
16.78/16.82	Variables:
16.78/16.82	l_11^0, len_98^0, x_12^0
16.78/16.82	Checking conditional termination of SCC {l1}...
16.78/16.82	
16.78/16.82	LOG: CALL solveLinear
16.78/16.82	
16.78/16.82	LOG: RETURN solveLinear - Elapsed time: 0.000738s
16.78/16.82	
16.78/16.82	LOG: CALL solveLinear
16.78/16.82	
16.78/16.82	LOG: RETURN solveLinear - Elapsed time: 0.002695s
16.78/16.82	Trying to remove transition: <l1, l1, 1 <= len_98^0 /\ 1 <= undef5 /\ l_11^0 <= len_98^0 /\ l_11^0 = undef1 /\ undef1 = 0, {l_11^0 -> x_12^0, len_98^0 -> undef3, rest remain the same}>
16.78/16.82	Solving with 1 template(s).
16.78/16.82	
16.78/16.82	LOG: CALL solveNonLinearGetFirstSolution
16.78/16.82	
16.78/16.82	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006054s
16.78/16.82	Time used: 0.005837
16.78/16.82	Solving with 1 template(s).
16.78/16.82	
16.78/16.82	LOG: CALL solveNonLinearGetFirstSolution
16.78/16.82	
16.78/16.82	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008342s
16.78/16.82	Time used: 0.007776
16.78/16.82	Improving Solution with cost 1 ...
16.78/16.82	
16.78/16.82	LOG: CALL solveNonLinearGetNextSolution
16.78/16.82	
16.78/16.82	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.012113s
16.78/16.82	Time used: 0.012108
16.78/16.82	
16.78/16.82	LOG: SAT solveNonLinear - Elapsed time: 0.020455s
16.78/16.82	Cost: 1; Total time: 0.019884
16.78/16.82	Failed at location 1: 1 + l_11^0 <= 0
16.78/16.82	Before Improving: 
16.78/16.82	Quasi-invariant at l1: 1 + l_11^0 <= 0
16.78/16.82	Optimizing invariants...
16.78/16.82	
16.78/16.82	LOG: CALL solveLinear
16.78/16.82	
16.78/16.82	LOG: RETURN solveLinear - Elapsed time: 0.002668s
16.78/16.82	Remaining time after improvement: 0.998607
16.78/16.82	Termination implied by a set of quasi-invariant(s):
16.78/16.82	Quasi-invariant at l1: 1 + l_11^0 <= 0
16.78/16.82	[ Invariant Graph ]
16.78/16.82	Strengthening and disabling transitions...
16.78/16.82	
16.78/16.82	LOG: CALL solverLinear in Graph for feasibility
16.78/16.82	
16.78/16.82	LOG: RETURN solveLinear in Graph for feasibility
16.78/16.82	It's unfeasible. Removing transition: 
16.78/16.82	<l1, l1, 1 <= len_98^0 /\ 1 <= undef5 /\ l_11^0 <= len_98^0 /\ l_11^0 = undef1 /\ undef1 = 0, {l_11^0 -> x_12^0, len_98^0 -> undef3, rest remain the same}>
16.78/16.82	[ Termination Graph ]
16.78/16.82	Strengthening and disabling transitions...
16.78/16.82	
16.78/16.82	LOG: CALL solverLinear in Graph for feasibility
16.78/16.82	
16.78/16.82	LOG: RETURN solveLinear in Graph for feasibility
16.78/16.82	It's unfeasible. Removing transition: 
16.78/16.82	<l1, l1, 1 <= len_98^0 /\ 1 <= undef5 /\ l_11^0 <= len_98^0 /\ l_11^0 = undef1 /\ undef1 = 0, {l_11^0 -> x_12^0, len_98^0 -> undef3, rest remain the same}>
16.78/16.82	New Graphs: 
16.78/16.82	Calling Safety with literal 1 + l_11^0 <= 0 and entry <l0, l1, l_11^0 <= len_98^0, {all remain the same}>
16.78/16.82	
16.78/16.82	LOG: CALL check - Post:1 + l_11^0 <= 0 - Process 2
16.78/16.82	* Exit transition: <l0, l1, l_11^0 <= len_98^0, {all remain the same}>
16.78/16.82	* Postcondition  : 1 + l_11^0 <= 0
16.78/16.82	
16.78/16.82	LOG: CALL solveLinear
16.78/16.82	
16.78/16.82	LOG: RETURN solveLinear - Elapsed time: 0.000483s
16.78/16.82	> Postcondition is not implied!
16.78/16.82	
16.78/16.82	LOG: RETURN check - Elapsed time: 0.000553s
16.78/16.82	INVARIANTS: 
16.78/16.82	1: 
16.78/16.82	Quasi-INVARIANTS to narrow Graph: 
16.78/16.82	1: 1 + l_11^0 <= 0 , 
16.78/16.82	Narrowing transition: 
16.78/16.82	<l1, l1, 1 <= len_98^0 /\ 1 <= undef5 /\ l_11^0 <= len_98^0 /\ l_11^0 = undef1 /\ undef1 = 0, {l_11^0 -> x_12^0, len_98^0 -> undef3, rest remain the same}>
16.78/16.82	
16.78/16.82	LOG: Narrow transition size 1
16.78/16.82	invGraph after Narrowing: 
16.78/16.82	Transitions:
16.78/16.82	<l1, l1, 1 <= len_98^0 /\ 1 <= undef5 /\ l_11^0 <= len_98^0 /\ 0 <= l_11^0 /\ l_11^0 = undef1 /\ undef1 = 0, {l_11^0 -> x_12^0, len_98^0 -> undef3, rest remain the same}>
16.78/16.82	Variables:
16.78/16.82	l_11^0, len_98^0, x_12^0
16.78/16.82	Checking conditional termination of SCC {l1}...
16.78/16.82	
16.78/16.82	LOG: CALL solveLinear
16.78/16.82	
16.78/16.82	LOG: RETURN solveLinear - Elapsed time: 0.000796s
16.78/16.82	
16.78/16.82	LOG: CALL solveLinear
16.78/16.82	
16.78/16.82	LOG: RETURN solveLinear - Elapsed time: 0.002923s
16.78/16.82	Trying to remove transition: <l1, l1, 1 <= len_98^0 /\ 1 <= undef5 /\ l_11^0 <= len_98^0 /\ 0 <= l_11^0 /\ l_11^0 = undef1 /\ undef1 = 0, {l_11^0 -> x_12^0, len_98^0 -> undef3, rest remain the same}>
16.78/16.82	Solving with 1 template(s).
16.78/16.82	
16.78/16.82	LOG: CALL solveNonLinearGetFirstSolution
16.78/16.82	
16.78/16.82	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006539s
16.78/16.82	Time used: 0.006361
16.78/16.82	Solving with 1 template(s).
16.78/16.82	
16.78/16.82	LOG: CALL solveNonLinearGetFirstSolution
16.78/16.82	
16.78/16.82	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009101s
16.78/16.82	Time used: 0.008531
16.78/16.82	Improving Solution with cost 1 ...
16.78/16.82	
16.78/16.82	LOG: CALL solveNonLinearGetNextSolution
16.78/16.82	
16.78/16.82	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.010582s
16.78/16.82	Time used: 0.010577
16.78/16.82	
16.78/16.82	LOG: SAT solveNonLinear - Elapsed time: 0.019683s
16.78/16.82	Cost: 1; Total time: 0.019108
16.78/16.82	Failed at location 1: 1 <= l_11^0
16.78/16.82	Before Improving: 
16.78/16.82	Quasi-invariant at l1: 1 <= l_11^0
16.78/16.82	Optimizing invariants...
16.78/16.82	
16.78/16.82	LOG: CALL solveLinear
16.78/16.82	
16.78/16.82	LOG: RETURN solveLinear - Elapsed time: 0.002834s
16.78/16.82	Remaining time after improvement: 0.998448
16.78/16.82	Termination implied by a set of quasi-invariant(s):
16.78/16.82	Quasi-invariant at l1: 1 <= l_11^0
16.78/16.82	[ Invariant Graph ]
16.78/16.82	Strengthening and disabling transitions...
16.78/16.82	
16.78/16.82	LOG: CALL solverLinear in Graph for feasibility
16.78/16.82	
16.78/16.82	LOG: RETURN solveLinear in Graph for feasibility
16.78/16.82	It's unfeasible. Removing transition: 
16.78/16.82	<l1, l1, 1 <= len_98^0 /\ 1 <= undef5 /\ l_11^0 <= len_98^0 /\ 0 <= l_11^0 /\ l_11^0 = undef1 /\ undef1 = 0, {l_11^0 -> x_12^0, len_98^0 -> undef3, rest remain the same}>
16.78/16.82	[ Termination Graph ]
16.78/16.82	Strengthening and disabling transitions...
16.78/16.82	> It's unfeasible. Removing transition: 
16.78/16.82	<l1, l1, 1 <= len_98^0 /\ 1 <= undef5 /\ l_11^0 <= len_98^0 /\ 0 <= l_11^0 /\ l_11^0 = undef1 /\ undef1 = 0, {l_11^0 -> x_12^0, len_98^0 -> undef3, rest remain the same}>
16.78/16.82	New Graphs: 
16.78/16.82	Calling Safety with literal 1 <= l_11^0 and entry <l0, l1, l_11^0 <= len_98^0 /\ 0 <= l_11^0, {all remain the same}>
16.78/16.82	
16.78/16.82	LOG: CALL check - Post:1 <= l_11^0 - Process 3
16.78/16.82	* Exit transition: <l0, l1, l_11^0 <= len_98^0 /\ 0 <= l_11^0, {all remain the same}>
16.78/16.82	* Postcondition  : 1 <= l_11^0
16.78/16.82	
16.78/16.82	LOG: CALL solveLinear
16.78/16.82	
16.78/16.82	LOG: RETURN solveLinear - Elapsed time: 0.000556s
16.78/16.82	> Postcondition is not implied!
16.78/16.82	
16.78/16.82	LOG: RETURN check - Elapsed time: 0.000635s
16.78/16.82	INVARIANTS: 
16.78/16.82	1: 
16.78/16.82	Quasi-INVARIANTS to narrow Graph: 
16.78/16.82	1: 1 <= l_11^0 , 
16.78/16.82	Narrowing transition: 
16.78/16.82	<l1, l1, 1 <= len_98^0 /\ 1 <= undef5 /\ l_11^0 <= len_98^0 /\ 0 <= l_11^0 /\ l_11^0 = undef1 /\ undef1 = 0, {l_11^0 -> x_12^0, len_98^0 -> undef3, rest remain the same}>
16.78/16.82	
16.78/16.82	LOG: Narrow transition size 1
16.78/16.82	invGraph after Narrowing: 
16.78/16.82	Transitions:
16.78/16.82	<l1, l1, 1 <= len_98^0 /\ 1 <= undef5 /\ l_11^0 <= len_98^0 /\ l_11^0 = 0 /\ l_11^0 = undef1 /\ undef1 = 0, {l_11^0 -> x_12^0, len_98^0 -> undef3, rest remain the same}>
16.78/16.82	Variables:
16.78/16.82	l_11^0, len_98^0, x_12^0
16.78/16.82	Checking conditional termination of SCC {l1}...
16.78/16.82	
16.78/16.82	LOG: CALL solveLinear
16.78/16.82	
16.78/16.82	LOG: RETURN solveLinear - Elapsed time: 0.000773s
16.78/16.82	
16.78/16.82	LOG: CALL solveLinear
16.78/16.82	
16.78/16.82	LOG: RETURN solveLinear - Elapsed time: 0.002817s
16.78/16.82	Trying to remove transition: <l1, l1, 1 <= len_98^0 /\ 1 <= undef5 /\ l_11^0 <= len_98^0 /\ l_11^0 = 0 /\ l_11^0 = undef1 /\ undef1 = 0, {l_11^0 -> x_12^0, len_98^0 -> undef3, rest remain the same}>
16.78/16.82	Solving with 1 template(s).
16.78/16.82	
16.78/16.82	LOG: CALL solveNonLinearGetFirstSolution
16.78/16.82	
16.78/16.82	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006194s
16.78/16.82	Time used: 0.006017
16.78/16.82	Solving with 1 template(s).
16.78/16.82	
16.78/16.82	LOG: CALL solveNonLinearGetFirstSolution
16.78/16.82	
16.78/16.82	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009166s
16.78/16.82	Time used: 0.008575
16.78/16.82	Improving Solution with cost 1 ...
16.78/16.82	
16.78/16.82	LOG: CALL solveNonLinearGetNextSolution
16.78/16.82	
16.78/16.82	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.011601s
16.78/16.82	Time used: 0.011596
16.78/16.82	
16.78/16.82	LOG: SAT solveNonLinear - Elapsed time: 0.020767s
16.78/16.82	Cost: 1; Total time: 0.020171
16.78/16.82	Failed at location 1: l_11^0 + len_98^0 <= 0
16.78/16.82	Before Improving: 
16.78/16.82	Quasi-invariant at l1: l_11^0 + len_98^0 <= 0
16.78/16.82	Optimizing invariants...
16.78/16.82	
16.78/16.82	LOG: CALL solveLinear
16.78/16.82	
16.78/16.82	LOG: RETURN solveLinear - Elapsed time: 0.002805s
16.78/16.82	Remaining time after improvement: 0.99846
16.78/16.82	Termination implied by a set of quasi-invariant(s):
16.78/16.82	Quasi-invariant at l1: l_11^0 + len_98^0 <= 0
16.78/16.82	[ Invariant Graph ]
16.78/16.82	Strengthening and disabling transitions...
16.78/16.82	
16.78/16.82	LOG: CALL solverLinear in Graph for feasibility
16.78/16.82	
16.78/16.82	LOG: RETURN solveLinear in Graph for feasibility
16.78/16.82	It's unfeasible. Removing transition: 
16.78/16.82	<l1, l1, 1 <= len_98^0 /\ 1 <= undef5 /\ l_11^0 <= len_98^0 /\ l_11^0 = 0 /\ l_11^0 = undef1 /\ undef1 = 0, {l_11^0 -> x_12^0, len_98^0 -> undef3, rest remain the same}>
16.78/16.82	[ Termination Graph ]
16.78/16.82	Strengthening and disabling transitions...
16.78/16.82	
16.78/16.82	LOG: CALL solverLinear in Graph for feasibility
16.78/16.82	
16.78/16.82	LOG: RETURN solveLinear in Graph for feasibility
16.78/16.82	It's unfeasible. Removing transition: 
16.78/16.82	<l1, l1, 1 <= len_98^0 /\ 1 <= undef5 /\ l_11^0 <= len_98^0 /\ l_11^0 = 0 /\ l_11^0 = undef1 /\ undef1 = 0, {l_11^0 -> x_12^0, len_98^0 -> undef3, rest remain the same}>
16.78/16.82	New Graphs: 
16.78/16.82	Calling Safety with literal l_11^0 + len_98^0 <= 0 and entry <l0, l1, l_11^0 <= len_98^0 /\ l_11^0 = 0, {all remain the same}>
16.78/16.82	
16.78/16.82	LOG: CALL check - Post:l_11^0 + len_98^0 <= 0 - Process 4
16.78/16.82	* Exit transition: <l0, l1, l_11^0 <= len_98^0 /\ l_11^0 = 0, {all remain the same}>
16.78/16.82	* Postcondition  : l_11^0 + len_98^0 <= 0
16.78/16.82	
16.78/16.82	LOG: CALL solveLinear
16.78/16.82	
16.78/16.82	LOG: RETURN solveLinear - Elapsed time: 0.000566s
16.78/16.82	> Postcondition is not implied!
16.78/16.82	
16.78/16.82	LOG: RETURN check - Elapsed time: 0.000649s
16.78/16.82	INVARIANTS: 
16.78/16.82	1: 
16.78/16.82	Quasi-INVARIANTS to narrow Graph: 
16.78/16.82	1: l_11^0 + len_98^0 <= 0 , 
16.78/16.82	Narrowing transition: 
16.78/16.82	<l1, l1, 1 <= len_98^0 /\ 1 <= undef5 /\ l_11^0 <= len_98^0 /\ l_11^0 = 0 /\ l_11^0 = undef1 /\ undef1 = 0, {l_11^0 -> x_12^0, len_98^0 -> undef3, rest remain the same}>
16.78/16.82	
16.78/16.82	LOG: Narrow transition size 1
16.78/16.82	invGraph after Narrowing: 
16.78/16.82	Transitions:
16.78/16.82	<l1, l1, 1 <= l_11^0 + len_98^0 /\ 1 <= len_98^0 /\ 1 <= undef5 /\ l_11^0 <= len_98^0 /\ l_11^0 = 0 /\ l_11^0 = undef1 /\ undef1 = 0, {l_11^0 -> x_12^0, len_98^0 -> undef3, rest remain the same}>
16.78/16.82	Variables:
16.78/16.82	l_11^0, len_98^0, x_12^0
16.78/16.82	Checking conditional termination of SCC {l1}...
16.78/16.82	
16.78/16.82	LOG: CALL solveLinear
16.78/16.82	
16.78/16.82	LOG: RETURN solveLinear - Elapsed time: 0.000847s
16.78/16.82	
16.78/16.82	LOG: CALL solveLinear
16.78/16.82	
16.78/16.82	LOG: RETURN solveLinear - Elapsed time: 0.003146s
16.78/16.82	Trying to remove transition: <l1, l1, 1 <= l_11^0 + len_98^0 /\ 1 <= len_98^0 /\ 1 <= undef5 /\ l_11^0 <= len_98^0 /\ l_11^0 = 0 /\ l_11^0 = undef1 /\ undef1 = 0, {l_11^0 -> x_12^0, len_98^0 -> undef3, rest remain the same}>
16.78/16.82	Solving with 1 template(s).
16.78/16.82	
16.78/16.82	LOG: CALL solveNonLinearGetFirstSolution
16.78/16.82	
16.78/16.82	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006702s
16.78/16.82	Time used: 0.006517
16.78/16.82	Solving with 1 template(s).
16.78/16.82	
16.78/16.82	LOG: CALL solveNonLinearGetFirstSolution
16.78/16.82	
16.78/16.82	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011660s
16.78/16.82	Time used: 0.011018
16.78/16.82	Improving Solution with cost 1 ...
16.78/16.82	
16.78/16.82	LOG: CALL solveNonLinearGetNextSolution
16.78/16.82	
16.78/16.82	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.011246s
16.78/16.82	Time used: 0.011241
16.78/16.82	
16.78/16.82	LOG: SAT solveNonLinear - Elapsed time: 0.022905s
16.78/16.82	Cost: 1; Total time: 0.022259
16.78/16.82	Failed at location 1: 1 + x_12^0 <= 0
16.78/16.82	Before Improving: 
16.78/16.82	Quasi-invariant at l1: 1 + x_12^0 <= 0
16.78/16.82	Optimizing invariants...
16.78/16.82	
16.78/16.82	LOG: CALL solveLinear
16.78/16.82	
16.78/16.82	LOG: RETURN solveLinear - Elapsed time: 0.002972s
16.78/16.82	Remaining time after improvement: 0.998333
16.78/16.82	Termination implied by a set of quasi-invariant(s):
16.78/16.82	Quasi-invariant at l1: 1 + x_12^0 <= 0
16.78/16.82	[ Invariant Graph ]
16.78/16.82	Strengthening and disabling transitions...
16.78/16.82	
16.78/16.82	LOG: CALL solverLinear in Graph for feasibility
16.78/16.82	
16.78/16.82	LOG: RETURN solveLinear in Graph for feasibility
16.78/16.82	Strengthening transition (result): 
16.78/16.82	<l1, l1, 1 <= l_11^0 + len_98^0 /\ 1 <= len_98^0 /\ 1 + x_12^0 <= 0 /\ 1 <= undef5 /\ l_11^0 <= len_98^0 /\ l_11^0 = 0 /\ l_11^0 = undef1 /\ undef1 = 0, {l_11^0 -> x_12^0, len_98^0 -> undef3, rest remain the same}>
16.78/16.82	[ Termination Graph ]
16.78/16.82	Strengthening and disabling transitions...
16.78/16.82	
16.78/16.82	LOG: CALL solverLinear in Graph for feasibility
16.78/16.82	
16.78/16.82	LOG: RETURN solveLinear in Graph for feasibility
16.78/16.82	Strengthening transition (result): 
16.78/16.82	<l1, l1, 1 <= l_11^0 + len_98^0 /\ 1 <= len_98^0 /\ 1 + x_12^0 <= 0 /\ 1 <= undef5 /\ l_11^0 <= len_98^0 /\ l_11^0 = 0 /\ l_11^0 = undef1 /\ undef1 = 0, {l_11^0 -> x_12^0, len_98^0 -> undef3, rest remain the same}>
16.78/16.82	Ranking function: l_11^0
16.78/16.82	New Graphs: 
16.78/16.82	Calling Safety with literal 1 + x_12^0 <= 0 and entry <l0, l1, 1 <= l_11^0 + len_98^0 /\ l_11^0 <= len_98^0 /\ l_11^0 = 0, {all remain the same}>
16.78/16.82	
16.78/16.82	LOG: CALL check - Post:1 + x_12^0 <= 0 - Process 5
16.78/16.82	* Exit transition: <l0, l1, 1 <= l_11^0 + len_98^0 /\ l_11^0 <= len_98^0 /\ l_11^0 = 0, {all remain the same}>
16.78/16.82	* Postcondition  : 1 + x_12^0 <= 0
16.78/16.82	
16.78/16.82	LOG: CALL solveLinear
16.78/16.82	
16.78/16.82	LOG: RETURN solveLinear - Elapsed time: 0.000504s
16.78/16.82	> Postcondition is not implied!
16.78/16.82	
16.78/16.82	LOG: RETURN check - Elapsed time: 0.000593s
16.78/16.82	INVARIANTS: 
16.78/16.82	1: 
16.78/16.82	Quasi-INVARIANTS to narrow Graph: 
16.78/16.82	1: 1 + x_12^0 <= 0 , 
16.78/16.82	Narrowing transition: 
16.78/16.82	<l1, l1, 1 <= l_11^0 + len_98^0 /\ 1 <= len_98^0 /\ 1 <= undef5 /\ l_11^0 <= len_98^0 /\ l_11^0 = 0 /\ l_11^0 = undef1 /\ undef1 = 0, {l_11^0 -> x_12^0, len_98^0 -> undef3, rest remain the same}>
16.78/16.82	
16.78/16.82	LOG: Narrow transition size 1
16.78/16.82	invGraph after Narrowing: 
16.78/16.82	Transitions:
16.78/16.82	<l1, l1, 1 <= l_11^0 + len_98^0 /\ 1 <= len_98^0 /\ 1 <= undef5 /\ l_11^0 <= len_98^0 /\ 0 <= x_12^0 /\ l_11^0 = 0 /\ l_11^0 = undef1 /\ undef1 = 0, {l_11^0 -> x_12^0, len_98^0 -> undef3, rest remain the same}>
16.78/16.82	Variables:
16.78/16.82	l_11^0, len_98^0, x_12^0
16.78/16.82	Checking conditional termination of SCC {l1}...
16.78/16.82	
16.78/16.82	LOG: CALL solveLinear
16.78/16.82	
16.78/16.82	LOG: RETURN solveLinear - Elapsed time: 0.000928s
16.78/16.82	
16.78/16.82	LOG: CALL solveLinear
16.78/16.82	
16.78/16.82	LOG: RETURN solveLinear - Elapsed time: 0.003499s
16.78/16.82	Trying to remove transition: <l1, l1, 1 <= l_11^0 + len_98^0 /\ 1 <= len_98^0 /\ 1 <= undef5 /\ l_11^0 <= len_98^0 /\ 0 <= x_12^0 /\ l_11^0 = 0 /\ l_11^0 = undef1 /\ undef1 = 0, {l_11^0 -> x_12^0, len_98^0 -> undef3, rest remain the same}>
16.78/16.82	Solving with 1 template(s).
16.78/16.82	
16.78/16.82	LOG: CALL solveNonLinearGetFirstSolution
16.78/16.82	
16.78/16.82	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006678s
16.78/16.82	Time used: 0.006478
16.78/16.82	Solving with 1 template(s).
16.78/16.82	
16.78/16.82	LOG: CALL solveNonLinearGetFirstSolution
16.78/16.82	
16.78/16.82	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010853s
16.78/16.82	Time used: 0.010187
16.78/16.82	Improving Solution with cost 1 ...
16.78/16.82	
16.78/16.82	LOG: CALL solveNonLinearGetNextSolution
16.78/16.82	
16.78/16.82	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.010981s
16.78/16.82	Time used: 0.010976
16.78/16.82	
16.78/16.82	LOG: SAT solveNonLinear - Elapsed time: 0.021834s
16.78/16.82	Cost: 1; Total time: 0.021163
16.78/16.82	Failed at location 1: 1 <= l_11^0 + x_12^0
16.78/16.82	Before Improving: 
16.78/16.82	Quasi-invariant at l1: 1 <= l_11^0 + x_12^0
16.78/16.82	Optimizing invariants...
16.78/16.82	
16.78/16.82	LOG: CALL solveLinear
16.78/16.82	
16.78/16.82	LOG: RETURN solveLinear - Elapsed time: 0.003280s
16.78/16.82	Remaining time after improvement: 0.998109
16.78/16.82	Termination implied by a set of quasi-invariant(s):
16.78/16.82	Quasi-invariant at l1: 1 <= l_11^0 + x_12^0
16.78/16.82	[ Invariant Graph ]
16.78/16.82	Strengthening and disabling transitions...
16.78/16.82	
16.78/16.82	LOG: CALL solverLinear in Graph for feasibility
16.78/16.82	
16.78/16.82	LOG: RETURN solveLinear in Graph for feasibility
16.78/16.82	Strengthening transition (result): 
16.78/16.82	<l1, l1, 1 <= l_11^0 + len_98^0 /\ 1 <= l_11^0 + x_12^0 /\ 1 <= len_98^0 /\ 1 <= undef5 /\ l_11^0 <= len_98^0 /\ 0 <= x_12^0 /\ l_11^0 = 0 /\ l_11^0 = undef1 /\ undef1 = 0, {l_11^0 -> x_12^0, len_98^0 -> undef3, rest remain the same}>
16.78/16.82	[ Termination Graph ]
16.78/16.82	Strengthening and disabling transitions...
16.78/16.82	
16.78/16.82	LOG: CALL solverLinear in Graph for feasibility
16.78/16.82	
16.78/16.82	LOG: RETURN solveLinear in Graph for feasibility
16.78/16.82	Strengthening transition (result): 
16.78/16.82	<l1, l1, 1 <= l_11^0 + len_98^0 /\ 1 <= l_11^0 + x_12^0 /\ 1 <= len_98^0 /\ 1 <= undef5 /\ l_11^0 <= len_98^0 /\ 0 <= x_12^0 /\ l_11^0 = 0 /\ l_11^0 = undef1 /\ undef1 = 0, {l_11^0 -> x_12^0, len_98^0 -> undef3, rest remain the same}>
16.78/16.82	Ranking function: -l_11^0
16.78/16.82	New Graphs: 
16.78/16.82	Calling Safety with literal 1 <= l_11^0 + x_12^0 and entry <l0, l1, 1 <= l_11^0 + len_98^0 /\ l_11^0 <= len_98^0 /\ 0 <= x_12^0 /\ l_11^0 = 0, {all remain the same}>
16.78/16.82	
16.78/16.82	LOG: CALL check - Post:1 <= l_11^0 + x_12^0 - Process 6
16.78/16.82	* Exit transition: <l0, l1, 1 <= l_11^0 + len_98^0 /\ l_11^0 <= len_98^0 /\ 0 <= x_12^0 /\ l_11^0 = 0, {all remain the same}>
16.78/16.82	* Postcondition  : 1 <= l_11^0 + x_12^0
16.78/16.82	
16.78/16.82	LOG: CALL solveLinear
16.78/16.82	
16.78/16.82	LOG: RETURN solveLinear - Elapsed time: 0.000549s
16.78/16.82	> Postcondition is not implied!
16.78/16.82	
16.78/16.82	LOG: RETURN check - Elapsed time: 0.000682s
16.78/16.82	INVARIANTS: 
16.78/16.82	1: 
16.78/16.82	Quasi-INVARIANTS to narrow Graph: 
16.78/16.82	1: 1 <= l_11^0 + x_12^0 , 
16.78/16.82	Narrowing transition: 
16.78/16.82	<l1, l1, 1 <= l_11^0 + len_98^0 /\ 1 <= len_98^0 /\ 1 <= undef5 /\ l_11^0 <= len_98^0 /\ 0 <= x_12^0 /\ l_11^0 = 0 /\ l_11^0 = undef1 /\ undef1 = 0, {l_11^0 -> x_12^0, len_98^0 -> undef3, rest remain the same}>
16.78/16.82	
16.78/16.82	LOG: Narrow transition size 1
16.78/16.82	invGraph after Narrowing: 
16.78/16.82	Transitions:
16.78/16.82	<l1, l1, 1 <= l_11^0 + len_98^0 /\ 1 <= len_98^0 /\ 1 <= undef5 /\ l_11^0 <= len_98^0 /\ l_11^0 + x_12^0 <= 0 /\ 0 <= x_12^0 /\ l_11^0 = 0 /\ l_11^0 = undef1 /\ undef1 = 0, {l_11^0 -> x_12^0, len_98^0 -> undef3, rest remain the same}>
16.78/16.82	Variables:
16.78/16.82	l_11^0, len_98^0, x_12^0
16.78/16.82	Checking conditional termination of SCC {l1}...
16.78/16.82	
16.78/16.82	LOG: CALL solveLinear
16.78/16.82	
16.78/16.82	LOG: RETURN solveLinear - Elapsed time: 0.000992s
16.78/16.82	
16.78/16.82	LOG: CALL solveLinear
16.78/16.82	
16.78/16.82	LOG: RETURN solveLinear - Elapsed time: 0.003735s
16.78/16.82	Trying to remove transition: <l1, l1, 1 <= l_11^0 + len_98^0 /\ 1 <= len_98^0 /\ 1 <= undef5 /\ l_11^0 <= len_98^0 /\ l_11^0 + x_12^0 <= 0 /\ 0 <= x_12^0 /\ l_11^0 = 0 /\ l_11^0 = undef1 /\ undef1 = 0, {l_11^0 -> x_12^0, len_98^0 -> undef3, rest remain the same}>
16.78/16.82	Solving with 1 template(s).
16.78/16.82	
16.78/16.82	LOG: CALL solveNonLinearGetFirstSolution
16.78/16.82	
16.78/16.82	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007138s
16.78/16.82	Time used: 0.00693
16.78/16.82	Solving with 1 template(s).
16.78/16.82	
16.78/16.82	LOG: CALL solveNonLinearGetFirstSolution
16.78/16.82	
16.78/16.82	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009522s
16.78/16.82	Time used: 0.009015
16.78/16.82	Solving with 2 template(s).
16.78/16.82	
16.78/16.82	LOG: CALL solveNonLinearGetFirstSolution
16.78/16.82	
16.78/16.82	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001727s
16.78/16.82	Time used: 4.00076
16.78/16.82	Solving with 3 template(s).
16.78/16.82	
16.78/16.82	LOG: CALL solveNonLinearGetFirstSolution
16.78/16.82	
16.78/16.82	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.016433s
16.78/16.82	Time used: 1.00063
16.78/16.82	Solving with 1 template(s).
16.78/16.82	
16.78/16.82	LOG: CALL solveNonLinearGetFirstSolution
16.78/16.82	
16.78/16.82	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.014947s
16.78/16.82	Time used: 0.008939
16.78/16.82	
16.78/16.82	Proving non-termination of subgraph 1
16.78/16.82	Transitions:
16.78/16.82	<l1, l1, 1 <= l_11^0 + len_98^0 /\ 1 <= len_98^0 /\ 1 <= undef5 /\ l_11^0 <= len_98^0 /\ l_11^0 + x_12^0 <= 0 /\ 0 <= x_12^0 /\ l_11^0 = 0 /\ l_11^0 = undef1 /\ undef1 = 0, {l_11^0 -> x_12^0, len_98^0 -> undef3, rest remain the same}>
16.78/16.82	Variables:
16.78/16.82	l_11^0, len_98^0, x_12^0
16.78/16.82	
16.78/16.82	Checking that every undef value has an assignment...
16.78/16.82	
16.78/16.82	LOG: CALL solveLinear
16.78/16.82	
16.78/16.82	LOG: RETURN solveLinear - Elapsed time: 0.002151s
16.78/16.82	Checking conditional non-termination of SCC {l1}...
16.78/16.82	EXIT TRANSITIONS:
16.78/16.82	<l1, end, 1 <= l_11^0 /\ 1 + len_98^0 <= l_11^0 /\ 1 <= l_11^0 + len_98^0 /\ 1 <= l_11^0 + x_12^0 /\ 1 <= len_98^0, {all remain the same}>
16.78/16.82	<l1, end, 1 <= l_11^0 /\ 1 + len_98^0 <= l_11^0 /\ 1 <= l_11^0 + len_98^0 /\ 1 <= len_98^0 /\ 1 + x_12^0 <= 0 /\ l_11^0 + x_12^0 <= 0, {all remain the same}>
16.78/16.82	<l1, end, 1 <= l_11^0 /\ 1 <= l_11^0 + len_98^0 /\ 1 <= l_11^0 + x_12^0 /\ 1 <= len_98^0 /\ l_11^0 <= len_98^0 /\ 0 <= x_12^0, {all remain the same}>
16.78/16.82	<l1, end, 1 <= l_11^0 + len_98^0 /\ 1 <= l_11^0 + x_12^0 /\ 1 <= len_98^0 /\ l_11^0 <= 0 /\ l_11^0 <= len_98^0 /\ 0 <= x_12^0, {all remain the same}>
16.78/16.82	<l1, end, 1 <= l_11^0 /\ 1 <= l_11^0 + len_98^0 /\ 1 <= l_11^0 + x_12^0 /\ 1 <= len_98^0 /\ 1 + x_12^0 <= 0 /\ l_11^0 <= len_98^0, {all remain the same}>
16.78/16.82	<l1, end, 1 + l_11^0 <= 0 /\ 1 <= l_11^0 + len_98^0 /\ 1 <= len_98^0 /\ l_11^0 <= len_98^0 /\ l_11^0 + x_12^0 <= 0 /\ 0 <= x_12^0, {all remain the same}>
16.78/16.82	<l1, end, 1 <= l_11^0 /\ 1 <= l_11^0 + len_98^0 /\ 1 <= len_98^0 /\ 1 + x_12^0 <= 0 /\ l_11^0 <= len_98^0 /\ l_11^0 + x_12^0 <= 0, {all remain the same}>
16.78/16.82	<l1, end, 1 <= l_11^0 + len_98^0 /\ 1 <= len_98^0 /\ 1 + x_12^0 <= 0 /\ l_11^0 <= 0 /\ l_11^0 <= len_98^0 /\ l_11^0 + x_12^0 <= 0, {all remain the same}>
16.78/16.82	<l1, end, 1 <= l_11^0 /\ 1 + len_98^0 <= l_11^0 /\ 1 <= l_11^0 + len_98^0 /\ 1 <= l_11^0 + x_12^0 /\ len_98^0 <= 0, {all remain the same}>
16.78/16.82	<l1, end, 1 <= l_11^0 /\ 1 + len_98^0 <= l_11^0 /\ 1 <= l_11^0 + len_98^0 /\ 1 + x_12^0 <= 0 /\ l_11^0 + x_12^0 <= 0 /\ len_98^0 <= 0, {all remain the same}>
16.78/16.82	<l1, end, 1 + l_11^0 <= 0 /\ 1 <= l_11^0 + x_12^0 /\ 1 <= len_98^0 /\ l_11^0 + len_98^0 <= 0 /\ l_11^0 <= len_98^0 /\ 0 <= x_12^0, {all remain the same}>
16.78/16.82	<l1, end, 1 + l_11^0 <= 0 /\ 1 <= len_98^0 /\ l_11^0 + len_98^0 <= 0 /\ l_11^0 <= len_98^0 /\ l_11^0 + x_12^0 <= 0, {all remain the same}>
16.78/16.82	<l1, end, 1 <= l_11^0 /\ 1 + len_98^0 <= l_11^0 /\ 1 <= l_11^0 + x_12^0 /\ l_11^0 + len_98^0 <= 0 /\ len_98^0 <= 0 /\ 0 <= x_12^0, {all remain the same}>
16.78/16.82	<l1, end, 1 + len_98^0 <= l_11^0 /\ 1 <= l_11^0 + x_12^0 /\ l_11^0 <= 0 /\ l_11^0 + len_98^0 <= 0 /\ len_98^0 <= 0 /\ 0 <= x_12^0, {all remain the same}>
16.78/16.82	<l1, end, 1 <= l_11^0 /\ 1 + len_98^0 <= l_11^0 /\ 1 <= l_11^0 + x_12^0 /\ 1 + x_12^0 <= 0 /\ l_11^0 + len_98^0 <= 0 /\ len_98^0 <= 0, {all remain the same}>
16.78/16.82	<l1, end, 1 + len_98^0 <= l_11^0 /\ l_11^0 <= 0 /\ l_11^0 + len_98^0 <= 0 /\ l_11^0 + x_12^0 <= 0 /\ len_98^0 <= 0 /\ 0 <= x_12^0, {all remain the same}>
16.78/16.82	<l1, end, 1 <= l_11^0 /\ 1 + len_98^0 <= l_11^0 /\ 1 + x_12^0 <= 0 /\ l_11^0 + len_98^0 <= 0 /\ l_11^0 + x_12^0 <= 0 /\ len_98^0 <= 0, {all remain the same}>
16.78/16.82	<l1, end, 1 + len_98^0 <= l_11^0 /\ 1 + x_12^0 <= 0 /\ l_11^0 <= 0 /\ l_11^0 + len_98^0 <= 0 /\ l_11^0 + x_12^0 <= 0 /\ len_98^0 <= 0, {all remain the same}>
16.78/16.82	<l1, end, 1 <= l_11^0 + x_12^0 /\ l_11^0 <= 0 /\ l_11^0 + len_98^0 <= 0 /\ l_11^0 <= len_98^0 /\ len_98^0 <= 0 /\ 0 <= x_12^0, {all remain the same}>
16.78/16.82	<l1, end, l_11^0 <= 0 /\ l_11^0 + len_98^0 <= 0 /\ l_11^0 <= len_98^0 /\ l_11^0 + x_12^0 <= 0 /\ len_98^0 <= 0, {all remain the same}>
16.78/16.82	
16.78/16.82	Solving with 1 template(s).
16.78/16.82	
16.78/16.82	LOG: CALL solveNonLinearGetFirstSolution
16.78/16.82	
16.78/16.82	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.148573s
16.78/16.82	Time used: 0.147787
16.78/16.82	Improving Solution with cost 13 ...
16.78/16.82	
16.78/16.82	LOG: CALL solveNonLinearGetNextSolution
16.78/16.82	
16.78/16.82	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.457831s
16.78/16.82	Time used: 0.457669
16.78/16.82	
16.78/16.82	LOG: SAT solveNonLinear - Elapsed time: 0.606404s
16.78/16.82	Cost: 13; Total time: 0.605456
16.78/16.82	Failed at location 1: 1 <= l_11^0 + len_98^0
16.78/16.82	Before Improving: 
16.78/16.82	Quasi-invariant at l1: 1 <= l_11^0 + len_98^0
16.78/16.82	Optimizing invariants...
16.78/16.82	
16.78/16.82	LOG: CALL solveLinear
16.78/16.82	
16.78/16.82	LOG: RETURN solveLinear - Elapsed time: 0.043433s
16.78/16.82	Remaining time after improvement: 0.992152
16.78/16.82	Minimizing number of undef constraints...
16.78/16.82	
16.78/16.82	LOG: CALL solveNonLinear
16.78/16.82	
16.78/16.82	LOG: RETURN solveNonLinear - Elapsed time: 0.013249s
16.78/16.82	Non-termination implied by a set of quasi-invariant(s):
16.78/16.82	Quasi-invariant at l1: 1 <= l_11^0 + len_98^0
16.78/16.82	Constraint over undef '1 + len_98^0 <= undef3' in transition:
16.78/16.82	<l1, l1, 1 <= l_11^0 + len_98^0 /\ 1 <= len_98^0 /\ 1 <= undef5 /\ l_11^0 <= len_98^0 /\ l_11^0 + x_12^0 <= 0 /\ 0 <= x_12^0 /\ l_11^0 = 0 /\ l_11^0 = undef1 /\ undef1 = 0, {l_11^0 -> x_12^0, len_98^0 -> undef3, rest remain the same}>
16.78/16.82	
16.78/16.82	Strengthening and disabling EXIT transitions...
16.78/16.82	Closed exits from l1: 10
16.78/16.82	Strengthening exit transition (result): 
16.78/16.82	<l1, end, 1 <= l_11^0 /\ 1 + len_98^0 <= l_11^0 /\ 1 <= l_11^0 + len_98^0 /\ 1 <= l_11^0 + x_12^0 /\ 1 <= len_98^0, {all remain the same}>
16.78/16.82	Strengthening exit transition (result): 
16.78/16.82	<l1, end, 1 <= l_11^0 /\ 1 + len_98^0 <= l_11^0 /\ 1 <= l_11^0 + len_98^0 /\ 1 <= len_98^0 /\ 1 + x_12^0 <= 0 /\ l_11^0 + x_12^0 <= 0, {all remain the same}>
16.78/16.82	Strengthening exit transition (result): 
16.78/16.82	<l1, end, 1 <= l_11^0 /\ 1 <= l_11^0 + len_98^0 /\ 1 <= l_11^0 + x_12^0 /\ 1 <= len_98^0 /\ l_11^0 <= len_98^0 /\ 0 <= x_12^0, {all remain the same}>
16.78/16.82	Strengthening exit transition (result): 
16.78/16.82	<l1, end, 1 <= l_11^0 + len_98^0 /\ 1 <= l_11^0 + x_12^0 /\ 1 <= len_98^0 /\ l_11^0 <= 0 /\ l_11^0 <= len_98^0 /\ 0 <= x_12^0, {all remain the same}>
16.78/16.82	Strengthening exit transition (result): 
16.78/16.82	<l1, end, 1 <= l_11^0 /\ 1 <= l_11^0 + len_98^0 /\ 1 <= l_11^0 + x_12^0 /\ 1 <= len_98^0 /\ 1 + x_12^0 <= 0 /\ l_11^0 <= len_98^0, {all remain the same}>
16.78/16.82	Strengthening exit transition (result): 
16.78/16.82	<l1, end, 1 + l_11^0 <= 0 /\ 1 <= l_11^0 + len_98^0 /\ 1 <= len_98^0 /\ l_11^0 <= len_98^0 /\ l_11^0 + x_12^0 <= 0 /\ 0 <= x_12^0, {all remain the same}>
16.78/16.82	Strengthening exit transition (result): 
16.78/16.82	<l1, end, 1 <= l_11^0 /\ 1 <= l_11^0 + len_98^0 /\ 1 <= len_98^0 /\ 1 + x_12^0 <= 0 /\ l_11^0 <= len_98^0 /\ l_11^0 + x_12^0 <= 0, {all remain the same}>
16.78/16.82	Strengthening exit transition (result): 
16.78/16.82	<l1, end, 1 <= l_11^0 + len_98^0 /\ 1 <= len_98^0 /\ 1 + x_12^0 <= 0 /\ l_11^0 <= 0 /\ l_11^0 <= len_98^0 /\ l_11^0 + x_12^0 <= 0, {all remain the same}>
16.78/16.82	Strengthening exit transition (result): 
16.78/16.82	<l1, end, 1 <= l_11^0 /\ 1 + len_98^0 <= l_11^0 /\ 1 <= l_11^0 + len_98^0 /\ 1 <= l_11^0 + x_12^0 /\ len_98^0 <= 0, {all remain the same}>
16.78/16.82	Strengthening exit transition (result): 
16.78/16.82	<l1, end, 1 <= l_11^0 /\ 1 + len_98^0 <= l_11^0 /\ 1 <= l_11^0 + len_98^0 /\ 1 + x_12^0 <= 0 /\ l_11^0 + x_12^0 <= 0 /\ len_98^0 <= 0, {all remain the same}>
16.78/16.82	
16.78/16.82	Strengthening and disabling transitions...
16.78/16.82	
16.78/16.82	LOG: CALL solverLinear in Graph for feasibility
16.78/16.82	
16.78/16.82	LOG: RETURN solveLinear in Graph for feasibility
16.78/16.82	Strengthening transition (result): 
16.78/16.82	<l1, l1, 1 <= l_11^0 + len_98^0 /\ 1 + len_98^0 <= undef3 /\ 1 <= len_98^0 /\ 1 <= undef5 /\ l_11^0 <= len_98^0 /\ l_11^0 + x_12^0 <= 0 /\ 0 <= x_12^0 /\ l_11^0 = 0 /\ l_11^0 = undef1 /\ undef1 = 0, {l_11^0 -> x_12^0, len_98^0 -> undef3, rest remain the same}>
16.78/16.82	
16.78/16.82	Checking conditional non-termination of SCC {l1}...
16.78/16.82	EXIT TRANSITIONS:
16.78/16.82	<l1, end, 1 <= l_11^0 /\ 1 + len_98^0 <= l_11^0 /\ 1 <= l_11^0 + len_98^0 /\ 1 <= l_11^0 + x_12^0 /\ 1 <= len_98^0, {all remain the same}>
16.78/16.82	<l1, end, 1 <= l_11^0 /\ 1 + len_98^0 <= l_11^0 /\ 1 <= l_11^0 + len_98^0 /\ 1 <= len_98^0 /\ 1 + x_12^0 <= 0 /\ l_11^0 + x_12^0 <= 0, {all remain the same}>
16.78/16.82	<l1, end, 1 <= l_11^0 /\ 1 <= l_11^0 + len_98^0 /\ 1 <= l_11^0 + x_12^0 /\ 1 <= len_98^0 /\ l_11^0 <= len_98^0 /\ 0 <= x_12^0, {all remain the same}>
16.78/16.82	<l1, end, 1 <= l_11^0 + len_98^0 /\ 1 <= l_11^0 + x_12^0 /\ 1 <= len_98^0 /\ l_11^0 <= 0 /\ l_11^0 <= len_98^0 /\ 0 <= x_12^0, {all remain the same}>
16.78/16.82	<l1, end, 1 <= l_11^0 /\ 1 <= l_11^0 + len_98^0 /\ 1 <= l_11^0 + x_12^0 /\ 1 <= len_98^0 /\ 1 + x_12^0 <= 0 /\ l_11^0 <= len_98^0, {all remain the same}>
16.78/16.82	<l1, end, 1 + l_11^0 <= 0 /\ 1 <= l_11^0 + len_98^0 /\ 1 <= len_98^0 /\ l_11^0 <= len_98^0 /\ l_11^0 + x_12^0 <= 0 /\ 0 <= x_12^0, {all remain the same}>
16.78/16.82	<l1, end, 1 <= l_11^0 /\ 1 <= l_11^0 + len_98^0 /\ 1 <= len_98^0 /\ 1 + x_12^0 <= 0 /\ l_11^0 <= len_98^0 /\ l_11^0 + x_12^0 <= 0, {all remain the same}>
16.78/16.82	<l1, end, 1 <= l_11^0 + len_98^0 /\ 1 <= len_98^0 /\ 1 + x_12^0 <= 0 /\ l_11^0 <= 0 /\ l_11^0 <= len_98^0 /\ l_11^0 + x_12^0 <= 0, {all remain the same}>
16.78/16.82	<l1, end, 1 <= l_11^0 /\ 1 + len_98^0 <= l_11^0 /\ 1 <= l_11^0 + len_98^0 /\ 1 <= l_11^0 + x_12^0 /\ len_98^0 <= 0, {all remain the same}>
16.78/16.82	<l1, end, 1 <= l_11^0 /\ 1 + len_98^0 <= l_11^0 /\ 1 <= l_11^0 + len_98^0 /\ 1 + x_12^0 <= 0 /\ l_11^0 + x_12^0 <= 0 /\ len_98^0 <= 0, {all remain the same}>
16.78/16.82	
16.78/16.82	Solving with 1 template(s).
16.78/16.82	
16.78/16.82	LOG: CALL solveNonLinearGetFirstSolution
16.78/16.82	
16.78/16.82	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.081777s
16.78/16.82	Time used: 0.081084
16.78/16.82	Improving Solution with cost 4 ...
16.78/16.82	
16.78/16.82	LOG: CALL solveNonLinearGetNextSolution
16.78/16.82	
16.78/16.82	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.094017s
16.78/16.82	Time used: 0.094009
16.78/16.82	
16.78/16.82	LOG: SAT solveNonLinear - Elapsed time: 0.175794s
16.78/16.82	Cost: 4; Total time: 0.175093
16.78/16.82	Failed at location 1: l_11^0 <= 0
16.78/16.82	Before Improving: 
16.78/16.82	Quasi-invariant at l1: l_11^0 <= 0
16.78/16.82	Optimizing invariants...
16.78/16.82	
16.78/16.82	LOG: CALL solveLinear
16.78/16.82	
16.78/16.82	LOG: RETURN solveLinear - Elapsed time: 0.033610s
16.78/16.82	Remaining time after improvement: 0.992934
16.78/16.82	Minimizing number of undef constraints...
16.78/16.82	
16.78/16.82	LOG: CALL solveNonLinear
16.78/16.82	
16.78/16.82	LOG: RETURN solveNonLinear - Elapsed time: 0.010495s
16.78/16.82	Number of undef constraints reduced!
16.78/16.82	
16.78/16.82	Non-termination implied by a set of quasi-invariant(s):
16.78/16.82	Quasi-invariant at l1: l_11^0 <= 0
16.78/16.82	
16.78/16.82	Strengthening and disabling EXIT transitions...
16.78/16.82	Closed exits from l1: 7
16.78/16.82	Strengthening exit transition (result): 
16.78/16.82	<l1, end, 1 <= l_11^0 + len_98^0 /\ 1 <= l_11^0 + x_12^0 /\ 1 <= len_98^0 /\ l_11^0 <= 0 /\ l_11^0 <= len_98^0 /\ 0 <= x_12^0, {all remain the same}>
16.78/16.82	Strengthening exit transition (result): 
16.78/16.82	<l1, end, 1 + l_11^0 <= 0 /\ 1 <= l_11^0 + len_98^0 /\ 1 <= len_98^0 /\ l_11^0 <= len_98^0 /\ l_11^0 + x_12^0 <= 0 /\ 0 <= x_12^0, {all remain the same}>
16.78/16.82	Strengthening exit transition (result): 
16.78/16.82	<l1, end, 1 <= l_11^0 + len_98^0 /\ 1 <= len_98^0 /\ 1 + x_12^0 <= 0 /\ l_11^0 <= 0 /\ l_11^0 <= len_98^0 /\ l_11^0 + x_12^0 <= 0, {all remain the same}>
16.78/16.82	
16.78/16.82	Strengthening and disabling transitions...
16.78/16.82	
16.78/16.82	LOG: CALL solverLinear in Graph for feasibility
16.78/16.82	
16.78/16.82	LOG: RETURN solveLinear in Graph for feasibility
16.78/16.82	Strengthening transition (result): 
16.78/16.82	<l1, l1, 1 <= l_11^0 + len_98^0 /\ 1 + len_98^0 <= undef3 /\ 1 <= len_98^0 /\ 1 <= undef5 /\ l_11^0 <= len_98^0 /\ l_11^0 + x_12^0 <= 0 /\ 0 <= x_12^0 /\ l_11^0 = 0 /\ l_11^0 = undef1 /\ undef1 = 0, {l_11^0 -> x_12^0, len_98^0 -> undef3, rest remain the same}>
16.78/16.82	
16.78/16.82	Checking conditional non-termination of SCC {l1}...
16.78/16.82	EXIT TRANSITIONS:
16.78/16.82	<l1, end, 1 <= l_11^0 + len_98^0 /\ 1 <= l_11^0 + x_12^0 /\ 1 <= len_98^0 /\ l_11^0 <= 0 /\ l_11^0 <= len_98^0 /\ 0 <= x_12^0, {all remain the same}>
16.78/16.82	<l1, end, 1 + l_11^0 <= 0 /\ 1 <= l_11^0 + len_98^0 /\ 1 <= len_98^0 /\ l_11^0 <= len_98^0 /\ l_11^0 + x_12^0 <= 0 /\ 0 <= x_12^0, {all remain the same}>
16.78/16.82	<l1, end, 1 <= l_11^0 + len_98^0 /\ 1 <= len_98^0 /\ 1 + x_12^0 <= 0 /\ l_11^0 <= 0 /\ l_11^0 <= len_98^0 /\ l_11^0 + x_12^0 <= 0, {all remain the same}>
16.78/16.82	
16.78/16.82	Solving with 1 template(s).
16.78/16.82	
16.78/16.82	LOG: CALL solveNonLinearGetFirstSolution
16.78/16.82	
16.78/16.82	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.037005s
16.78/16.82	Time used: 0.036453
16.78/16.82	Improving Solution with cost 2 ...
16.78/16.82	
16.78/16.82	LOG: CALL solveNonLinearGetNextSolution
16.78/16.82	
16.78/16.82	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.093547s
16.78/16.82	Time used: 0.093539
16.78/16.82	
16.78/16.82	LOG: SAT solveNonLinear - Elapsed time: 0.130552s
16.78/16.82	Cost: 2; Total time: 0.129992
16.78/16.82	Failed at location 1: x_12^0 <= l_11^0
16.78/16.82	Before Improving: 
16.78/16.82	Quasi-invariant at l1: x_12^0 <= l_11^0
16.78/16.82	Optimizing invariants...
16.78/16.82	
16.78/16.82	LOG: CALL solveLinear
16.78/16.82	
16.78/16.82	LOG: RETURN solveLinear - Elapsed time: 0.023800s
16.78/16.82	Remaining time after improvement: 0.994997
16.78/16.82	Minimizing number of undef constraints...
16.78/16.82	
16.78/16.82	LOG: CALL solveNonLinear
16.78/16.82	
16.78/16.82	LOG: RETURN solveNonLinear - Elapsed time: 0.007113s
16.78/16.82	Number of undef constraints reduced!
16.78/16.82	
16.78/16.82	Non-termination implied by a set of quasi-invariant(s):
16.78/16.82	Quasi-invariant at l1: x_12^0 <= l_11^0
16.78/16.82	
16.78/16.82	Strengthening and disabling EXIT transitions...
16.78/16.82	Closed exits from l1: 2
16.78/16.82	Strengthening exit transition (result): 
16.78/16.82	<l1, end, 1 <= l_11^0 + len_98^0 /\ 1 <= len_98^0 /\ 1 + x_12^0 <= 0 /\ l_11^0 <= 0 /\ l_11^0 <= len_98^0 /\ l_11^0 + x_12^0 <= 0 /\ x_12^0 <= l_11^0, {all remain the same}>
16.78/16.82	
16.78/16.82	Strengthening and disabling transitions...
16.78/16.82	
16.78/16.82	LOG: CALL solverLinear in Graph for feasibility
16.78/16.82	
16.78/16.82	LOG: RETURN solveLinear in Graph for feasibility
16.78/16.82	Strengthening transition (result): 
16.78/16.82	<l1, l1, 1 <= l_11^0 + len_98^0 /\ 1 + len_98^0 <= undef3 /\ 1 <= len_98^0 /\ 1 <= undef5 /\ l_11^0 <= len_98^0 /\ l_11^0 + x_12^0 <= 0 /\ x_12^0 <= l_11^0 /\ 0 <= x_12^0 /\ l_11^0 = 0 /\ l_11^0 = undef1 /\ undef1 = 0, {l_11^0 -> x_12^0, len_98^0 -> undef3, rest remain the same}>
16.78/16.82	
16.78/16.82	Checking conditional non-termination of SCC {l1}...
16.78/16.82	EXIT TRANSITIONS:
16.78/16.82	<l1, end, 1 <= l_11^0 + len_98^0 /\ 1 <= len_98^0 /\ 1 + x_12^0 <= 0 /\ l_11^0 <= 0 /\ l_11^0 <= len_98^0 /\ l_11^0 + x_12^0 <= 0 /\ x_12^0 <= l_11^0, {all remain the same}>
16.78/16.82	
16.78/16.82	Solving with 1 template(s).
16.78/16.82	
16.78/16.82	LOG: CALL solveNonLinearGetFirstSolution
16.78/16.82	
16.78/16.82	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.000663s
16.78/16.82	Time used: 5.00017
16.78/16.82	Solving with 2 template(s).
16.78/16.82	
16.78/16.82	LOG: CALL solveNonLinearGetFirstSolution
16.78/16.82	
16.78/16.82	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.063421s
16.78/16.82	Time used: 5.0022
16.78/16.82	Solving with 3 template(s).
16.78/16.82	
16.78/16.82	LOG: CALL solveNonLinearGetFirstSolution
16.78/16.82	
16.78/16.82	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.134889s
16.78/16.82	Time used: 0.079574
16.78/16.82	Improving Solution with cost 1 ...
16.78/16.82	
16.78/16.82	LOG: CALL solveNonLinearGetNextSolution
16.78/16.82	
16.78/16.82	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.081859s
16.78/16.82	Time used: 0.081852
16.78/16.82	
16.78/16.82	LOG: SAT solveNonLinear - Elapsed time: 0.216748s
16.78/16.82	Cost: 1; Total time: 0.161426
16.78/16.82	Failed at location 1: 0 <= x_12^0
16.78/16.82	Before Improving: 
16.78/16.82	Quasi-invariant at l1: 0 <= x_12^0
16.78/16.82	Optimizing invariants...
16.78/16.82	
16.78/16.82	LOG: CALL solveLinear
16.78/16.82	
16.78/16.82	LOG: RETURN solveLinear - Elapsed time: 0.009060s
16.78/16.82	Remaining time after improvement: 0.995273
16.78/16.82	Minimizing number of undef constraints...
16.78/16.82	
16.78/16.82	LOG: CALL solveNonLinear
16.78/16.82	
16.78/16.82	LOG: RETURN solveNonLinear - Elapsed time: 0.009844s
16.78/16.82	Number of undef constraints reduced!
16.78/16.83	
16.78/16.83	Non-termination implied by a set of quasi-invariant(s):
16.78/16.83	Quasi-invariant at l1: 0 <= x_12^0
16.78/16.83	
16.78/16.83	Strengthening and disabling EXIT transitions...
16.78/16.83	Closed exits from l1: 1
16.78/16.83	
16.78/16.83	Strengthening and disabling transitions...
16.78/16.83	
16.78/16.83	LOG: CALL solverLinear in Graph for feasibility
16.78/16.83	
16.78/16.83	LOG: RETURN solveLinear in Graph for feasibility
16.78/16.83	Strengthening transition (result): 
16.78/16.83	<l1, l1, 1 <= l_11^0 + len_98^0 /\ 1 + len_98^0 <= undef3 /\ 1 <= len_98^0 /\ 1 <= undef5 /\ l_11^0 <= len_98^0 /\ l_11^0 + x_12^0 <= 0 /\ x_12^0 <= l_11^0 /\ 0 <= x_12^0 /\ l_11^0 = 0 /\ l_11^0 = undef1 /\ undef1 = 0, {l_11^0 -> x_12^0, len_98^0 -> undef3, rest remain the same}>
16.78/16.83	
16.78/16.83	Calling reachability with...
16.78/16.83	Transition: <l1, end, true, {all remain the same}>
16.78/16.83	Conditions: 1 <= l_11^0 + len_98^0, l_11^0 <= 0, x_12^0 <= l_11^0, 0 <= x_12^0, 
16.78/16.83	OPEN EXITS: 
16.78/16.83	<l1, end, 1 <= l_11^0 + len_98^0 /\ l_11^0 <= 0 /\ x_12^0 <= l_11^0, {all remain the same}> (condsUp: 0 <= x_12^0)
16.78/16.83	
16.78/16.83	--- Reachability graph ---
16.78/16.83	> Graph without transitions.
16.78/16.83	
16.78/16.83	Calling reachability with...
16.78/16.83	Transition: <l0, l1, true, {all remain the same}>
16.78/16.83	Conditions: 1 <= l_11^0 + len_98^0, l_11^0 <= 0, x_12^0 <= l_11^0, 0 <= x_12^0, 
16.78/16.83	OPEN EXITS: 
16.78/16.83	<l0, l1, 1 <= l_11^0 + len_98^0 /\ l_11^0 <= 0 /\ x_12^0 <= l_11^0 /\ 0 <= x_12^0, {all remain the same}>
16.78/16.83	
16.78/16.83	> Conditions are reachable!
16.78/16.83	
16.78/16.83	Program does NOT terminate
16.78/16.83	/export/starexec/sandbox2/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
16.78/16.83	/export/starexec/sandbox2/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
16.78/16.83	EOF