26.05/26.11	NO
26.05/26.11	
26.05/26.11	Solver Timeout: 4
26.05/26.11	Global Timeout: 300
26.05/26.11	No parsing errors!
26.05/26.11	Init Location: 0
26.05/26.11	Transitions:
26.05/26.11	<l0, l4, true>
26.05/26.11	<l1, l2, (arg1 > 0) /\ (arg2 > ~(1)), par{arg1 -> arg2, arg2 -> undef2}>
26.05/26.11	<l2, l3, (arg1 < 10), par{arg2 -> undef4}>
26.05/26.11	<l2, l2, (0 = arg1), par{arg1 -> 1, arg2 -> undef6}>
26.05/26.11	<l3, l3, (arg1 > 0) /\ ((arg1 + 1) > arg1), par{arg1 -> (arg1 + 1), arg2 -> undef8}>
26.05/26.11	<l4, l1, true, par{arg1 -> undef9, arg2 -> undef10}>
26.05/26.11	
26.05/26.11	Fresh variables:
26.05/26.11	undef2, undef4, undef6, undef8, undef9, undef10, 
26.05/26.11	
26.05/26.11	Undef variables:
26.05/26.11	undef2, undef4, undef6, undef8, undef9, undef10, 
26.05/26.11	
26.05/26.11	Abstraction variables:
26.05/26.11	
26.05/26.11	Exit nodes:
26.05/26.11	
26.05/26.11	Accepting locations:
26.05/26.11	
26.05/26.11	Asserts:
26.05/26.11	
26.05/26.11	Preprocessed LLVMGraph
26.05/26.11	Init Location: 0
26.05/26.11	Transitions:
26.05/26.11	<l0, l2, (arg1 = undef10) /\ (undef9 > 0) /\ (undef10 > ~(1))>
26.05/26.11	<l2, l3, (arg1 < 10)>
26.05/26.11	<l2, l2, (0 = arg1), par{arg1 -> 1}>
26.05/26.11	<l3, l3, (arg1 > 0) /\ ((arg1 + 1) > arg1), par{arg1 -> (arg1 + 1)}>
26.05/26.11	
26.05/26.11	Fresh variables:
26.05/26.11	undef2, undef4, undef6, undef8, undef9, undef10, 
26.05/26.11	
26.05/26.11	Undef variables:
26.05/26.11	undef2, undef4, undef6, undef8, undef9, undef10, 
26.05/26.11	
26.05/26.11	Abstraction variables:
26.05/26.11	
26.05/26.11	Exit nodes:
26.05/26.11	
26.05/26.11	Accepting locations:
26.05/26.11	
26.05/26.11	Asserts:
26.05/26.11	
26.05/26.11	*************************************************************
26.05/26.11	*******************************************************************************************
26.05/26.11	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
26.05/26.11	*******************************************************************************************
26.05/26.11	
26.05/26.11	Init Location: 0
26.05/26.11	Graph 0:
26.05/26.11	Transitions:
26.05/26.11	Variables:
26.05/26.11	
26.05/26.11	Graph 1:
26.05/26.11	Transitions:
26.05/26.11	<l2, l2, arg1 = 0, {arg1 -> 1, rest remain the same}>
26.05/26.11	Variables:
26.05/26.11	arg1
26.05/26.11	
26.05/26.11	Graph 2:
26.05/26.11	Transitions:
26.05/26.11	<l3, l3, 1 <= arg1, {arg1 -> 1 + arg1, rest remain the same}>
26.05/26.11	Variables:
26.05/26.11	arg1
26.05/26.11	
26.05/26.11	Precedence: 
26.05/26.11	Graph 0
26.05/26.11	
26.05/26.11	Graph 1
26.05/26.11	<l0, l2, 0 <= undef10 /\ 1 <= undef9 /\ arg1 = undef10, {all remain the same}>
26.05/26.11	
26.05/26.11	Graph 2
26.05/26.11	<l2, l3, arg1 <= 9, {all remain the same}>
26.05/26.11	
26.05/26.11	Map Locations to Subgraph:
26.05/26.11	( 0 , 0 )
26.05/26.11	( 2 , 1 )
26.05/26.11	( 3 , 2 )
26.05/26.11	
26.05/26.11	*******************************************************************************************
26.05/26.11	********************************    CHECKING ASSERTIONS    ********************************
26.05/26.11	*******************************************************************************************
26.05/26.11	
26.05/26.11	Proving termination of subgraph 0
26.05/26.11	Proving termination of subgraph 1
26.05/26.11	Checking unfeasibility...
26.05/26.11	Time used: 0.001661
26.05/26.11	
26.05/26.11	Checking conditional termination of SCC {l2}...
26.05/26.11	
26.05/26.11	LOG: CALL solveLinear
26.05/26.11	
26.05/26.11	LOG: RETURN solveLinear - Elapsed time: 0.000469s
26.05/26.11	Ranking function: -arg1
26.05/26.11	New Graphs: 
26.05/26.11	Proving termination of subgraph 2
26.05/26.11	Checking unfeasibility...
26.05/26.11	Time used: 0.001287
26.05/26.11	
26.05/26.11	Checking conditional termination of SCC {l3}...
26.05/26.11	
26.05/26.11	LOG: CALL solveLinear
26.05/26.11	
26.05/26.11	LOG: RETURN solveLinear - Elapsed time: 0.000539s
26.05/26.11	
26.05/26.11	LOG: CALL solveLinear
26.05/26.11	
26.05/26.11	LOG: RETURN solveLinear - Elapsed time: 0.001301s
26.05/26.11	Trying to remove transition: <l3, l3, 1 <= arg1, {arg1 -> 1 + arg1, rest remain the same}>
26.05/26.11	Solving with 1 template(s).
26.05/26.11	
26.05/26.11	LOG: CALL solveNonLinearGetFirstSolution
26.05/26.11	
26.05/26.11	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003757s
26.05/26.11	Time used: 0.003634
26.05/26.11	Solving with 1 template(s).
26.05/26.11	
26.05/26.11	LOG: CALL solveNonLinearGetFirstSolution
26.05/26.11	
26.05/26.11	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004933s
26.05/26.11	Time used: 0.004666
26.05/26.11	Improving Solution with cost 1 ...
26.05/26.11	
26.05/26.11	LOG: CALL solveNonLinearGetNextSolution
26.05/26.11	
26.05/26.11	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.012231s
26.05/26.11	Time used: 1.01223
26.05/26.11	
26.05/26.11	LOG: SAT solveNonLinear - Elapsed time: 1.017165s
26.05/26.11	Cost: 1; Total time: 1.0169
26.05/26.11	Failed at location 3: arg1 <= 0
26.05/26.11	Before Improving: 
26.05/26.11	Quasi-invariant at l3: arg1 <= 0
26.05/26.11	Optimizing invariants...
26.05/26.11	
26.05/26.11	LOG: CALL solveLinear
26.05/26.11	
26.05/26.11	LOG: RETURN solveLinear - Elapsed time: 0.004600s
26.05/26.11	Remaining time after improvement: 0.999005
26.05/26.11	Termination implied by a set of quasi-invariant(s):
26.05/26.11	Quasi-invariant at l3: arg1 <= 0
26.05/26.11	[ Invariant Graph ]
26.05/26.11	Strengthening and disabling transitions...
26.05/26.11	
26.05/26.11	LOG: CALL solverLinear in Graph for feasibility
26.05/26.11	
26.05/26.11	LOG: RETURN solveLinear in Graph for feasibility
26.05/26.11	It's unfeasible. Removing transition: 
26.05/26.11	<l3, l3, 1 <= arg1, {arg1 -> 1 + arg1, rest remain the same}>
26.05/26.11	[ Termination Graph ]
26.05/26.11	Strengthening and disabling transitions...
26.05/26.11	
26.05/26.11	LOG: CALL solverLinear in Graph for feasibility
26.05/26.11	
26.05/26.11	LOG: RETURN solveLinear in Graph for feasibility
26.05/26.11	It's unfeasible. Removing transition: 
26.05/26.11	<l3, l3, 1 <= arg1, {arg1 -> 1 + arg1, rest remain the same}>
26.05/26.11	New Graphs: 
26.05/26.11	Calling Safety with literal arg1 <= 0 and entry <l2, l3, arg1 <= 9, {all remain the same}>
26.05/26.11	
26.05/26.11	LOG: CALL check - Post:arg1 <= 0 - Process 1
26.05/26.11	* Exit transition: <l2, l3, arg1 <= 9, {all remain the same}>
26.05/26.11	* Postcondition  : arg1 <= 0
26.05/26.11	Quasi-invariants: 
26.05/26.11	Location 2: arg1 <= 0 ; 1 <= 0 ; 
26.05/26.11	Postcondition: arg1 <= 0
26.05/26.11	
26.05/26.11	LOG: CALL check - Post:arg1 <= 0 - Process 2
26.05/26.11	* Exit transition: <l0, l2, 0 <= undef10 /\ 1 <= undef9 /\ arg1 = undef10, {all remain the same}>
26.05/26.11	* Postcondition  : arg1 <= 0
26.05/26.11	
26.05/26.11	LOG: CALL solveLinear
26.05/26.11	
26.05/26.11	LOG: RETURN solveLinear - Elapsed time: 0.000422s
26.05/26.11	> Postcondition is not implied!
26.05/26.11	
26.05/26.11	LOG: RETURN check - Elapsed time: 0.000512s
26.05/26.11	Postcondition: 1 <= 0
26.05/26.11	
26.05/26.11	LOG: CALL check - Post:1 <= 0 - Process 3
26.05/26.11	* Exit transition: <l0, l2, 0 <= undef10 /\ 1 <= undef9 /\ arg1 = undef10, {all remain the same}>
26.05/26.11	* Postcondition  : 1 <= 0
26.05/26.11	
26.05/26.11	LOG: CALL solveLinear
26.05/26.11	
26.05/26.11	LOG: RETURN solveLinear - Elapsed time: 0.000390s
26.05/26.11	> Postcondition is not implied!
26.05/26.11	
26.05/26.11	LOG: RETURN check - Elapsed time: 0.000470s
26.05/26.11	
26.05/26.11	LOG: NarrowEntry size 2
26.05/26.11	Narrowing transition: 
26.05/26.11	<l2, l2, arg1 = 0, {arg1 -> 1, rest remain the same}>
26.05/26.11	
26.05/26.11	LOG: Narrow transition size 2
26.05/26.11	ENTRIES:
26.05/26.11	<l0, l2, 0 <= 0 /\ arg1 <= 0 /\ 0 <= undef10 /\ 1 <= undef9 /\ arg1 = undef10, {all remain the same}>
26.05/26.11	<l0, l2, 0 <= undef10 /\ 1 <= arg1 /\ 1 <= undef9 /\ arg1 = undef10, {all remain the same}>
26.05/26.11	END ENTRIES:
26.05/26.11	GRAPH:
26.05/26.11	<l2, l2, 0 <= 0 /\ arg1 = 0, {arg1 -> 1, rest remain the same}>
26.05/26.11	END GRAPH:
26.05/26.11	EXIT: <l2, l3, arg1 <= 9, {all remain the same}>
26.05/26.11	POST: arg1 <= 0
26.05/26.11	
26.05/26.11	
26.05/26.11	LOG: Try proving POST
26.05/26.11	Solving with 1 template(s).
26.05/26.11	
26.05/26.11	LOG: CALL solveNonLinearGetFirstSolution
26.05/26.11	
26.05/26.11	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005140s
26.05/26.11	Time used: 0.004965
26.05/26.11	Improving Solution with cost 51 ...
26.05/26.11	
26.05/26.11	LOG: CALL solveNonLinearGetNextSolution
26.05/26.11	
26.05/26.11	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.013914s
26.05/26.11	Time used: 0.013903
26.05/26.11	Improving Solution with cost 2 ...
26.05/26.11	
26.05/26.11	LOG: CALL solveNonLinearGetNextSolution
26.05/26.11	
26.05/26.11	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.014719s
26.05/26.11	Time used: 0.014716
26.05/26.11	
26.05/26.11	LOG: SAT solveNonLinear - Elapsed time: 0.033773s
26.05/26.11	Cost: 2; Total time: 0.033584
26.05/26.11	Failed at location 2: 12 <= arg1
26.05/26.11	Failed at location 2: 12 <= arg1
26.05/26.11	Before Improving: 
26.05/26.11	Quasi-invariant at l2: 12 <= arg1
26.05/26.11	Optimizing invariants...
26.05/26.11	
26.05/26.11	LOG: CALL solveLinear
26.05/26.11	
26.05/26.11	LOG: RETURN solveLinear - Elapsed time: 0.002002s
26.05/26.11	Remaining time after improvement: 0.998976
26.05/26.11	Postcondition implied by a set of quasi-invariant(s):
26.05/26.11	Quasi-invariant at l2: 12 <= arg1
26.05/26.11	Postcondition: 12 <= arg1
26.05/26.11	
26.05/26.11	LOG: CALL check - Post:12 <= arg1 - Process 4
26.05/26.11	* Exit transition: <l0, l2, 0 <= 0 /\ arg1 <= 0 /\ 0 <= undef10 /\ 1 <= undef9 /\ arg1 = undef10, {all remain the same}>
26.05/26.11	* Postcondition  : 12 <= arg1
26.05/26.11	
26.05/26.11	LOG: CALL solveLinear
26.05/26.11	
26.05/26.11	LOG: RETURN solveLinear - Elapsed time: 0.000591s
26.05/26.11	> Postcondition is not implied!
26.05/26.11	
26.05/26.11	LOG: RETURN check - Elapsed time: 0.000702s
26.05/26.11	Postcondition: 12 <= arg1
26.05/26.11	
26.05/26.11	LOG: CALL check - Post:12 <= arg1 - Process 5
26.05/26.11	* Exit transition: <l0, l2, 0 <= undef10 /\ 1 <= arg1 /\ 1 <= undef9 /\ arg1 = undef10, {all remain the same}>
26.05/26.11	* Postcondition  : 12 <= arg1
26.05/26.11	
26.05/26.11	LOG: CALL solveLinear
26.05/26.11	
26.05/26.11	LOG: RETURN solveLinear - Elapsed time: 0.000532s
26.05/26.11	> Postcondition is not implied!
26.05/26.11	
26.05/26.11	LOG: RETURN check - Elapsed time: 0.000627s
26.05/26.11	
26.05/26.11	LOG: NarrowEntry size 1
26.05/26.11	
26.05/26.11	LOG: NarrowEntry size 1
26.05/26.11	INVARIANTS: 
26.05/26.11	2: 
26.05/26.11	Quasi-INVARIANTS to narrow Graph: 
26.05/26.11	2: 12 <= arg1 , 
26.05/26.11	Narrowing transition: 
26.05/26.11	<l2, l2, 0 <= 0 /\ arg1 = 0, {arg1 -> 1, rest remain the same}>
26.05/26.11	
26.05/26.11	LOG: Narrow transition size 1
26.05/26.11	ENTRIES:
26.05/26.11	<l0, l2, 0 <= 0 /\ arg1 <= 0 /\ 0 <= undef10 /\ 1 <= undef9 /\ arg1 = undef10, {all remain the same}>
26.05/26.11	<l0, l2, 0 <= undef10 /\ 1 <= arg1 /\ 1 <= undef9 /\ arg1 <= 11 /\ arg1 = undef10, {all remain the same}>
26.05/26.11	END ENTRIES:
26.05/26.11	GRAPH:
26.05/26.11	<l2, l2, 0 <= 0 /\ arg1 = 0, {arg1 -> 1, rest remain the same}>
26.05/26.11	END GRAPH:
26.05/26.11	EXIT: <l2, l3, arg1 <= 9, {all remain the same}>
26.05/26.11	POST: arg1 <= 0
26.05/26.11	
26.05/26.11	
26.05/26.11	LOG: Try proving POST
26.05/26.11	Solving with 1 template(s).
26.05/26.11	
26.05/26.11	LOG: CALL solveNonLinearGetFirstSolution
26.05/26.11	
26.05/26.11	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.051965s
26.05/26.11	Time used: 0.051795
26.05/26.11	Improving Solution with cost 2 ...
26.05/26.11	
26.05/26.11	LOG: CALL solveNonLinearGetNextSolution
26.05/26.11	
26.05/26.11	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.011199s
26.05/26.11	Time used: 0.011196
26.05/26.11	
26.05/26.11	LOG: SAT solveNonLinear - Elapsed time: 0.063164s
26.05/26.11	Cost: 2; Total time: 0.062991
26.05/26.11	Failed at location 2: 10 <= arg1
26.05/26.11	Failed at location 2: 10 <= arg1
26.05/26.11	Before Improving: 
26.05/26.11	Quasi-invariant at l2: 10 <= arg1
26.05/26.11	Optimizing invariants...
26.05/26.11	
26.05/26.11	LOG: CALL solveLinear
26.05/26.11	
26.05/26.11	LOG: RETURN solveLinear - Elapsed time: 0.002130s
26.05/26.11	Remaining time after improvement: 0.998554
26.05/26.11	Postcondition implied by a set of quasi-invariant(s):
26.05/26.11	Quasi-invariant at l2: 10 <= arg1
26.05/26.11	Postcondition: 10 <= arg1
26.05/26.11	
26.05/26.11	LOG: CALL check - Post:10 <= arg1 - Process 6
26.05/26.11	* Exit transition: <l0, l2, 0 <= 0 /\ arg1 <= 0 /\ 0 <= undef10 /\ 1 <= undef9 /\ arg1 = undef10, {all remain the same}>
26.05/26.11	* Postcondition  : 10 <= arg1
26.05/26.11	
26.05/26.11	LOG: CALL solveLinear
26.05/26.11	
26.05/26.11	LOG: RETURN solveLinear - Elapsed time: 0.000614s
26.05/26.11	> Postcondition is not implied!
26.05/26.11	
26.05/26.11	LOG: RETURN check - Elapsed time: 0.000717s
26.05/26.11	Postcondition: 10 <= arg1
26.05/26.11	
26.05/26.11	LOG: CALL check - Post:10 <= arg1 - Process 7
26.05/26.11	* Exit transition: <l0, l2, 0 <= undef10 /\ 1 <= arg1 /\ 1 <= undef9 /\ arg1 <= 11 /\ arg1 = undef10, {all remain the same}>
26.05/26.11	* Postcondition  : 10 <= arg1
26.05/26.11	
26.05/26.11	LOG: CALL solveLinear
26.05/26.11	
26.05/26.11	LOG: RETURN solveLinear - Elapsed time: 0.000570s
26.05/26.11	> Postcondition is not implied!
26.05/26.11	
26.05/26.11	LOG: RETURN check - Elapsed time: 0.000675s
26.05/26.11	
26.05/26.11	LOG: NarrowEntry size 1
26.05/26.11	
26.05/26.11	LOG: NarrowEntry size 1
26.05/26.11	INVARIANTS: 
26.05/26.11	2: 
26.05/26.11	Quasi-INVARIANTS to narrow Graph: 
26.05/26.11	2: 10 <= arg1 , 
26.05/26.11	Narrowing transition: 
26.05/26.11	<l2, l2, 0 <= 0 /\ arg1 = 0, {arg1 -> 1, rest remain the same}>
26.05/26.11	
26.05/26.11	LOG: Narrow transition size 1
26.05/26.11	ENTRIES:
26.05/26.11	<l0, l2, 0 <= 0 /\ arg1 <= 0 /\ 0 <= undef10 /\ 1 <= undef9 /\ arg1 = undef10, {all remain the same}>
26.05/26.11	<l0, l2, 0 <= undef10 /\ 1 <= arg1 /\ 1 <= undef9 /\ arg1 <= 9 /\ arg1 = undef10, {all remain the same}>
26.05/26.11	END ENTRIES:
26.05/26.11	GRAPH:
26.05/26.11	<l2, l2, 0 <= 0 /\ arg1 = 0, {arg1 -> 1, rest remain the same}>
26.05/26.11	END GRAPH:
26.05/26.11	EXIT: <l2, l3, arg1 <= 9, {all remain the same}>
26.05/26.11	POST: arg1 <= 0
26.05/26.11	
26.05/26.11	
26.05/26.11	LOG: Try proving POST
26.05/26.11	Solving with 1 template(s).
26.05/26.11	
26.05/26.11	LOG: CALL solveNonLinearGetFirstSolution
26.05/26.11	
26.05/26.11	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.045073s
26.05/26.11	Time used: 0.044974
26.05/26.11	Solving with 2 template(s).
26.05/26.11	
26.05/26.11	LOG: CALL solveNonLinearGetFirstSolution
26.05/26.11	
26.05/26.11	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.684325s
26.05/26.11	Time used: 0.683893
26.05/26.11	Solving with 3 template(s).
26.05/26.11	
26.05/26.11	LOG: CALL solveNonLinearGetFirstSolution
26.05/26.11	
26.05/26.11	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.001734s
26.05/26.11	Time used: 1.00028
26.05/26.11	
26.05/26.11	LOG: Postcondition is not implied - no solution
26.05/26.11	> Postcondition is not implied!
26.05/26.11	
26.05/26.11	LOG: RETURN check - Elapsed time: 1.848206s
26.05/26.11	INVARIANTS: 
26.05/26.11	3: 
26.05/26.11	Quasi-INVARIANTS to narrow Graph: 
26.05/26.11	3: arg1 <= 0 , 
26.05/26.11	Narrowing transition: 
26.05/26.11	<l3, l3, 1 <= arg1, {arg1 -> 1 + arg1, rest remain the same}>
26.05/26.11	
26.05/26.11	LOG: Narrow transition size 1
26.05/26.11	invGraph after Narrowing: 
26.05/26.11	Transitions:
26.05/26.11	<l3, l3, 1 <= arg1, {arg1 -> 1 + arg1, rest remain the same}>
26.05/26.11	Variables:
26.05/26.11	arg1
26.05/26.11	Checking conditional termination of SCC {l3}...
26.05/26.11	
26.05/26.11	LOG: CALL solveLinear
26.05/26.11	
26.05/26.11	LOG: RETURN solveLinear - Elapsed time: 0.000544s
26.05/26.11	
26.05/26.11	LOG: CALL solveLinear
26.05/26.11	
26.05/26.11	LOG: RETURN solveLinear - Elapsed time: 0.001370s
26.05/26.11	Trying to remove transition: <l3, l3, 1 <= arg1, {arg1 -> 1 + arg1, rest remain the same}>
26.05/26.11	Solving with 1 template(s).
26.05/26.11	
26.05/26.11	LOG: CALL solveNonLinearGetFirstSolution
26.05/26.11	
26.05/26.11	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003573s
26.05/26.11	Time used: 0.003441
26.05/26.11	Solving with 1 template(s).
26.05/26.11	
26.05/26.11	LOG: CALL solveNonLinearGetFirstSolution
26.05/26.11	
26.05/26.11	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001270s
26.05/26.11	Time used: 4.00082
26.05/26.11	Solving with 2 template(s).
26.05/26.11	
26.05/26.11	LOG: CALL solveNonLinearGetFirstSolution
26.05/26.11	
26.05/26.11	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005729s
26.05/26.11	Time used: 4.00169
26.05/26.11	Solving with 3 template(s).
26.05/26.11	
26.05/26.11	LOG: CALL solveNonLinearGetFirstSolution
26.05/26.11	
26.05/26.11	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.046252s
26.05/26.11	Time used: 1.00095
26.05/26.11	Solving with 1 template(s).
26.05/26.11	
26.05/26.11	LOG: CALL solveNonLinearGetFirstSolution
26.05/26.11	
26.05/26.11	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009939s
26.05/26.11	Time used: 0.00619
26.05/26.11	Improving Solution with cost 1 ...
26.05/26.11	
26.05/26.11	LOG: CALL solveNonLinearGetNextSolution
26.05/26.11	
26.05/26.11	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000725s
26.05/26.11	Time used: 1.00072
26.05/26.11	
26.05/26.11	LOG: SAT solveNonLinear - Elapsed time: 1.010664s
26.05/26.11	Cost: 1; Total time: 1.00691
26.05/26.11	Termination implied by a set of invariant(s):
26.05/26.11	Invariant at l3: 0 <= 1 + arg1
26.05/26.11	[ Invariant Graph ]
26.05/26.11	Strengthening and disabling transitions...
26.05/26.11	
26.05/26.11	LOG: CALL solverLinear in Graph for feasibility
26.05/26.11	
26.05/26.11	LOG: RETURN solveLinear in Graph for feasibility
26.05/26.11	Strengthening transition (result): 
26.05/26.11	<l3, l3, 1 <= arg1, {arg1 -> 1 + arg1, rest remain the same}>
26.05/26.11	[ Termination Graph ]
26.05/26.11	Strengthening and disabling transitions...
26.05/26.11	
26.05/26.11	LOG: CALL solverLinear in Graph for feasibility
26.05/26.11	
26.05/26.11	LOG: RETURN solveLinear in Graph for feasibility
26.05/26.11	Strengthening transition (result): 
26.05/26.11	<l3, l3, 1 <= arg1, {arg1 -> 1 + arg1, rest remain the same}>
26.05/26.11	Quasi-ranking function: 50000 - arg1
26.05/26.11	New Graphs: 
26.05/26.11	Transitions:
26.05/26.11	<l3, l3, 50001 <= arg1, {arg1 -> 1 + arg1, rest remain the same}>
26.05/26.11	Variables:
26.05/26.11	arg1
26.05/26.11	Checking conditional termination of SCC {l3}...
26.05/26.11	
26.05/26.11	LOG: CALL solveLinear
26.05/26.11	
26.05/26.11	LOG: RETURN solveLinear - Elapsed time: 0.000440s
26.05/26.11	
26.05/26.11	LOG: CALL solveLinear
26.05/26.11	
26.05/26.11	LOG: RETURN solveLinear - Elapsed time: 0.001341s
26.05/26.11	Trying to remove transition: <l3, l3, 50001 <= arg1, {arg1 -> 1 + arg1, rest remain the same}>
26.05/26.11	Solving with 1 template(s).
26.05/26.11	
26.05/26.11	LOG: CALL solveNonLinearGetFirstSolution
26.05/26.11	
26.05/26.11	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003963s
26.05/26.11	Time used: 0.003831
26.05/26.11	Solving with 1 template(s).
26.05/26.11	
26.05/26.11	LOG: CALL solveNonLinearGetFirstSolution
26.05/26.11	
26.05/26.11	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001713s
26.05/26.11	Time used: 4.00125
26.05/26.11	Solving with 2 template(s).
26.05/26.11	
26.05/26.11	LOG: CALL solveNonLinearGetFirstSolution
26.05/26.11	
26.05/26.11	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.007041s
26.05/26.11	Time used: 4.00124
26.05/26.11	Solving with 3 template(s).
26.05/26.11	
26.05/26.11	LOG: CALL solveNonLinearGetFirstSolution
26.05/26.11	
26.05/26.11	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.007643s
26.05/26.11	Time used: 1.00112
26.05/26.11	Solving with 1 template(s).
26.05/26.11	
26.05/26.11	LOG: CALL solveNonLinearGetFirstSolution
26.05/26.11	
26.05/26.11	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005920s
26.05/26.11	Time used: 4.00164
26.05/26.11	
26.05/26.11	Proving non-termination of subgraph 2
26.05/26.11	Transitions:
26.05/26.11	<l3, l3, 1 <= arg1, {arg1 -> 1 + arg1, rest remain the same}>
26.05/26.11	Variables:
26.05/26.11	arg1
26.05/26.11	
26.05/26.11	Checking conditional non-termination of SCC {l3}...
26.05/26.11	EXIT TRANSITIONS:
26.05/26.11	<l3, end, arg1 <= 0, {all remain the same}>
26.05/26.11	
26.05/26.11	Solving with 1 template(s).
26.05/26.11	
26.05/26.11	LOG: CALL solveNonLinearGetFirstSolution
26.05/26.11	
26.05/26.11	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003655s
26.05/26.11	Time used: 0.003495
26.05/26.11	Improving Solution with cost 1 ...
26.05/26.11	
26.05/26.11	LOG: CALL solveNonLinearGetNextSolution
26.05/26.11	
26.05/26.11	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.004702s
26.05/26.11	Time used: 0.004697
26.05/26.11	
26.05/26.11	LOG: SAT solveNonLinear - Elapsed time: 0.008357s
26.05/26.11	Cost: 1; Total time: 0.008192
26.05/26.11	Failed at location 3: 1 <= arg1
26.05/26.11	Before Improving: 
26.05/26.11	Quasi-invariant at l3: 1 <= arg1
26.05/26.11	Optimizing invariants...
26.05/26.11	
26.05/26.11	LOG: CALL solveLinear
26.05/26.11	
26.05/26.11	LOG: RETURN solveLinear - Elapsed time: 0.001580s
26.05/26.11	Remaining time after improvement: 0.998879
26.05/26.11	Non-termination implied by a set of quasi-invariant(s):
26.05/26.11	Quasi-invariant at l3: 1 <= arg1
26.05/26.11	
26.05/26.11	Strengthening and disabling EXIT transitions...
26.05/26.11	Closed exits from l3: 1
26.05/26.11	
26.05/26.11	Strengthening and disabling transitions...
26.05/26.11	
26.05/26.11	LOG: CALL solverLinear in Graph for feasibility
26.05/26.11	
26.05/26.11	LOG: RETURN solveLinear in Graph for feasibility
26.05/26.11	Strengthening transition (result): 
26.05/26.11	<l3, l3, 1 <= arg1, {arg1 -> 1 + arg1, rest remain the same}>
26.05/26.11	
26.05/26.11	Calling reachability with...
26.05/26.11	Transition: <l3, end, true, {all remain the same}>
26.05/26.11	Conditions: 1 <= arg1, 
26.05/26.11	OPEN EXITS: 
26.05/26.11	<l3, end, 1 <= arg1, {all remain the same}>
26.05/26.11	
26.05/26.11	--- Reachability graph ---
26.05/26.11	> Graph without transitions.
26.05/26.11	
26.05/26.11	Calling reachability with...
26.05/26.11	Transition: <l2, l3, arg1 <= 9, {all remain the same}>
26.05/26.11	Conditions: 1 <= arg1, 
26.05/26.11	OPEN EXITS: 
26.05/26.11	<l2, l3, 1 <= arg1 /\ arg1 <= 9, {all remain the same}>
26.05/26.11	
26.05/26.11	--- Reachability graph ---
26.05/26.11	> Graph without transitions.
26.05/26.11	
26.05/26.11	Calling reachability with...
26.05/26.11	Transition: <l0, l2, 0 <= undef10 /\ 1 <= undef9 /\ arg1 = undef10, {all remain the same}>
26.05/26.11	Conditions: 1 <= arg1, arg1 <= 9, 
26.05/26.11	OPEN EXITS: 
26.05/26.11	<l0, l2, 0 <= undef10 /\ 1 <= arg1 /\ 1 <= undef9 /\ arg1 <= 9 /\ arg1 = undef10, {all remain the same}>
26.05/26.11	
26.05/26.11	> Conditions are reachable!
26.05/26.11	
26.05/26.11	Program does NOT terminate
26.05/26.11	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
26.05/26.11	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
26.05/26.11	EOF