46.62/20.95	NO
46.62/20.95	
46.62/20.95	Solver Timeout: 4
46.62/20.95	Global Timeout: 300
46.62/20.95	Maximum number of concurrent processes: 900
46.62/20.95	*******************************************************************************************
46.62/20.95	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
46.62/20.95	*******************************************************************************************
46.62/20.95	
46.62/20.95	
46.62/20.95	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
46.62/20.95	
46.62/20.95	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
46.62/20.95	+                                                                  +
46.62/20.95	Init Location: 0
46.62/20.95	Transitions:
46.62/20.95	<l0, l1, true, seq{main__func_return_ -> 0, main_x -> ¿functionCall(__VERIFIER_nondet_int), main_y -> ¿functionCall(__VERIFIER_nondet_int)}>
46.62/20.95	<l1, l2, true>
46.62/20.95	<l2, l5, not((main_x >= 0))>
46.62/20.95	<l2, l3, (main_x >= 0)>
46.62/20.95	<l3, l4, true, seq{main_x -> (main_x + main_y), main_y -> (main_y + 1)}>
46.62/20.95	<l4, l2, true>
46.62/20.95	<l5, l6, true, seq{main__func_return_ -> 0}>
46.62/20.95	
46.62/20.95	Fresh variables:
46.62/20.95	
46.62/20.95	Undef variables:
46.62/20.95	
46.62/20.95	Abstraction variables:
46.62/20.95	
46.62/20.95	Exit nodes:
46.62/20.95	
46.62/20.95	Accepting locations:
46.62/20.95	
46.62/20.95	Asserts:
46.62/20.95	
46.62/20.95	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
46.62/20.95	       
46.62/20.95	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
46.62/20.95	       
46.62/20.95	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
46.62/20.95	
46.62/20.95	Init Location: 0
46.62/20.95	Transitions:
46.62/20.95	<l0, l7, true, seq{main__func_return_ -> 0}>
46.62/20.95	<l7, l8, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
46.62/20.95	<l8, l9, true, seq{main_x -> varCall_1}>
46.62/20.95	<l9, l10, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}>
46.62/20.95	<l10, l1, true, seq{main_y -> varCall_2}>
46.62/20.95	<l1, l2, true>
46.62/20.95	<l2, l3, (main_x >= 0)>
46.62/20.95	<l2, l5, not((main_x >= 0))>
46.62/20.95	<l3, l4, true, seq{main_x -> (main_x + main_y), main_y -> (main_y + 1)}>
46.62/20.95	<l4, l2, true>
46.62/20.95	<l5, l6, true, seq{main__func_return_ -> 0}>
46.62/20.95	
46.62/20.95	Fresh variables:
46.62/20.95	
46.62/20.95	Undef variables:
46.62/20.95	
46.62/20.95	Abstraction variables:
46.62/20.95	
46.62/20.95	Exit nodes:
46.62/20.95	6, 
46.62/20.95	Accepting locations:
46.62/20.95	
46.62/20.95	Asserts:
46.62/20.95	
46.62/20.95	+                                                                  +
46.62/20.95	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
46.62/20.95	
46.62/20.95	
46.62/20.95	Function Return and Parameters Information [2 functions]:
46.62/20.95	    function name: __VERIFIER_nondet_int [1 return + 0 parameters]        demangled: __VERIFIER_nondet_int
46.62/20.95	        __VERIFIER_nondet_int__func_return_      [function result] : int
46.62/20.95	    function name: main [1 return + 0 parameters]        demangled: main
46.62/20.95	        main__func_return_      [function result] : int
46.62/20.95	
46.62/20.95	
46.62/20.95	AST Ident Scanner Information [4 idents]:
46.62/20.95	__VERIFIER_nondet_int | function | [integer, ()] | <line: 11, col: 1> | <line: 17, col: 9> <line: 18, col: 9>
46.62/20.95	main | function | [integer, ()] | <line: 13, col: 1>
46.62/20.95	x | local variable | integer | <line: 15, col: 5> | <line: 17, col: 5> <line: 19, col: 9> <line: 20, col: 3> <line: 20, col: 7>
46.62/20.95	y | local variable | integer | <line: 16, col: 5> | <line: 18, col: 5> <line: 20, col: 11> <line: 21, col: 3> <line: 21, col: 7>
46.62/20.95	
46.62/20.95	Main function: main
46.62/20.95	Preprocessed LLVMGraph
46.62/20.95	Init Location: 0
46.62/20.95	Transitions:
46.62/20.95	<l0, l2, (main_x = undef3) /\ (main_y = undef4)>
46.62/20.95	<l2, l2, (main_x >= 0), par{main_x -> (main_x + main_y), main_y -> (main_y + 1)}>
46.62/20.95	<l2, l6, not((main_x >= 0))>
46.62/20.95	
46.62/20.95	Fresh variables:
46.62/20.95	undef3, undef4, 
46.62/20.95	
46.62/20.95	Undef variables:
46.62/20.95	undef3, undef4, 
46.62/20.95	
46.62/20.95	Abstraction variables:
46.62/20.95	
46.62/20.95	Exit nodes:
46.62/20.95	6, 
46.62/20.95	Accepting locations:
46.62/20.95	
46.62/20.95	Asserts:
46.62/20.95	
46.62/20.95	*************************************************************
46.62/20.95	*******************************************************************************************
46.62/20.95	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
46.62/20.95	*******************************************************************************************
46.62/20.95	
46.62/20.95	Init Location: 0
46.62/20.95	Graph 0:
46.62/20.95	Transitions:
46.62/20.95	Variables:
46.62/20.95	
46.62/20.95	Graph 1:
46.62/20.95	Transitions:
46.62/20.95	<l2, l2, 0 <= main_x, {main_x -> main_x + main_y, main_y -> 1 + main_y, rest remain the same}>
46.62/20.95	Variables:
46.62/20.95	main_x, main_y
46.62/20.95	
46.62/20.95	Graph 2:
46.62/20.95	Transitions:
46.62/20.95	Variables:
46.62/20.95	
46.62/20.95	Precedence: 
46.62/20.95	Graph 0
46.62/20.95	
46.62/20.95	Graph 1
46.62/20.95	<l0, l2, main_x = undef3 /\ main_y = undef4, {all remain the same}>
46.62/20.95	
46.62/20.95	Graph 2
46.62/20.95	<l2, l6, 1 + main_x <= 0, {all remain the same}>
46.62/20.95	
46.62/20.95	Map Locations to Subgraph:
46.62/20.95	( 0 , 0 )
46.62/20.95	( 2 , 1 )
46.62/20.95	( 6 , 2 )
46.62/20.95	
46.62/20.95	*******************************************************************************************
46.62/20.96	********************************    CHECKING ASSERTIONS    ********************************
46.62/20.96	*******************************************************************************************
46.62/20.96	
46.62/20.96	Proving termination of subgraph 0
46.62/20.96	Proving termination of subgraph 1
46.62/20.96	Checking unfeasibility...
46.62/20.96	Time used: 0.001976
46.62/20.96	
46.62/20.96	Checking conditional termination of SCC {l2}...
46.62/20.96	
46.62/20.96	LOG: CALL solveLinear
46.62/20.96	
46.62/20.96	LOG: RETURN solveLinear - Elapsed time: 0.000825s
46.62/20.96	
46.62/20.96	LOG: CALL solveLinear
46.62/20.96	
46.62/20.96	LOG: RETURN solveLinear - Elapsed time: 0.001548s
46.62/20.96	[32396 : 32397]
46.62/20.96	[32396 : 32398]
46.62/20.96	Successful child: 32397
46.62/20.96	[ Invariant Graph ]
46.62/20.96	Strengthening and disabling transitions...
46.62/20.96	
46.62/20.96	LOG: CALL solverLinear in Graph for feasibility
46.62/20.96	
46.62/20.96	LOG: RETURN solveLinear in Graph for feasibility
46.62/20.96	It's unfeasible. Removing transition: 
46.62/20.96	<l2, l2, 0 <= main_x, {main_x -> main_x + main_y, main_y -> 1 + main_y, rest remain the same}>
46.62/20.96	[ Termination Graph ]
46.62/20.96	Strengthening and disabling transitions...
46.62/20.96	> It's unfeasible. Removing transition: 
46.62/20.96	<l2, l2, 0 <= main_x, {main_x -> main_x + main_y, main_y -> 1 + main_y, rest remain the same}>
46.62/20.96	New Graphs: 
46.62/20.96	
46.62/20.96	LOG: CALL check - Post:1 + main_x <= 0 - Process 1
46.62/20.96	* Exit transition: <l0, l2, main_x = undef3 /\ main_y = undef4, {all remain the same}>
46.62/20.96	* Postcondition  : 1 + main_x <= 0
46.62/20.96	
46.62/20.96	LOG: CALL solveLinear
46.62/20.96	
46.62/20.96	LOG: RETURN solveLinear - Elapsed time: 0.000467s
46.62/20.96	> Postcondition is not implied!
46.62/20.96	
46.62/20.96	LOG: RETURN check - Elapsed time: 0.000559s
46.62/20.96	INVARIANTS: 
46.62/20.96	2: 
46.62/20.96	Quasi-INVARIANTS to narrow Graph: 
46.62/20.96	2: 1 + main_x <= 0 , 
46.62/20.96	Narrowing transition: 
46.62/20.96	<l2, l2, 0 <= main_x, {main_x -> main_x + main_y, main_y -> 1 + main_y, rest remain the same}>
46.62/20.96	
46.62/20.96	LOG: Narrow transition size 1
46.62/20.96	invGraph after Narrowing: 
46.62/20.96	Transitions:
46.62/20.96	<l2, l2, 0 <= main_x, {main_x -> main_x + main_y, main_y -> 1 + main_y, rest remain the same}>
46.62/20.96	Variables:
46.62/20.96	main_x, main_y
46.62/20.96	Checking conditional termination of SCC {l2}...
46.62/20.96	
46.62/20.96	LOG: CALL solveLinear
46.62/20.96	
46.62/20.96	LOG: RETURN solveLinear - Elapsed time: 0.000823s
46.62/20.96	
46.62/20.96	LOG: CALL solveLinear
46.62/20.96	
46.62/20.96	LOG: RETURN solveLinear - Elapsed time: 0.001665s
46.62/20.96	[32396 : 32403]
46.62/20.96	[32396 : 32404]
46.62/20.96	Successful child: 32403
46.62/20.96	[ Invariant Graph ]
46.62/20.96	Strengthening and disabling transitions...
46.62/20.96	
46.62/20.96	LOG: CALL solverLinear in Graph for feasibility
46.62/20.96	
46.62/20.96	LOG: RETURN solveLinear in Graph for feasibility
46.62/20.96	Strengthening transition (result): 
46.62/20.96	<l2, l2, 0 <= main_x /\ 1 + main_x + main_y <= 0, {main_x -> main_x + main_y, main_y -> 1 + main_y, rest remain the same}>
46.62/20.96	[ Termination Graph ]
46.62/20.96	Strengthening and disabling transitions...
46.62/20.96	
46.62/20.96	LOG: CALL solverLinear in Graph for feasibility
46.62/20.96	
46.62/20.96	LOG: RETURN solveLinear in Graph for feasibility
46.62/20.96	Strengthening transition (result): 
46.62/20.96	<l2, l2, 0 <= main_x /\ 1 + main_x + main_y <= 0, {main_x -> main_x + main_y, main_y -> 1 + main_y, rest remain the same}>
46.62/20.96	Ranking function: 6 - 2*main_y
46.62/20.96	New Graphs: 
46.62/20.96	
46.62/20.96	LOG: CALL check - Post:1 + main_x + main_y <= 0 - Process 2
46.62/20.96	* Exit transition: <l0, l2, 0 <= main_x /\ main_x = undef3 /\ main_y = undef4, {all remain the same}>
46.62/20.96	* Postcondition  : 1 + main_x + main_y <= 0
46.62/20.96	
46.62/20.96	LOG: CALL solveLinear
46.62/20.96	
46.62/20.96	LOG: RETURN solveLinear - Elapsed time: 0.000516s
46.62/20.96	> Postcondition is not implied!
46.62/20.96	
46.62/20.96	LOG: RETURN check - Elapsed time: 0.000617s
46.62/20.96	INVARIANTS: 
46.62/20.96	2: 
46.62/20.96	Quasi-INVARIANTS to narrow Graph: 
46.62/20.96	2: 1 + main_x + main_y <= 0 , 
46.62/20.96	Narrowing transition: 
46.62/20.96	<l2, l2, 0 <= main_x, {main_x -> main_x + main_y, main_y -> 1 + main_y, rest remain the same}>
46.62/20.96	
46.62/20.96	LOG: Narrow transition size 1
46.62/20.96	invGraph after Narrowing: 
46.62/20.96	Transitions:
46.62/20.96	<l2, l2, 0 <= main_x /\ 0 <= main_x + main_y, {main_x -> main_x + main_y, main_y -> 1 + main_y, rest remain the same}>
46.62/20.96	Variables:
46.62/20.96	main_x, main_y
46.62/20.96	Checking conditional termination of SCC {l2}...
46.62/20.96	
46.62/20.96	LOG: CALL solveLinear
46.62/20.96	
46.62/20.96	LOG: RETURN solveLinear - Elapsed time: 0.000584s
46.62/20.96	
46.62/20.96	LOG: CALL solveLinear
46.62/20.96	
46.62/20.96	LOG: RETURN solveLinear - Elapsed time: 0.001835s
46.62/20.96	[32396 : 32408]
46.62/20.96	[32396 : 32409]
46.62/20.96	Solving with 1 template(s).
46.62/20.96	
46.62/20.96	LOG: CALL solveNonLinearGetFirstSolution
46.62/20.96	
46.62/20.96	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006907s
46.62/20.96	Time used: 0.006483
46.62/20.96	Improving Solution with cost 1 ...
46.62/20.96	
46.62/20.96	LOG: CALL solveNonLinearGetNextSolution
46.62/20.96	
46.62/20.96	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.012905s
46.62/20.96	Time used: 0.0129
46.62/20.96	
46.62/20.96	LOG: SAT solveNonLinear - Elapsed time: 0.019813s
46.62/20.96	Cost: 1; Total time: 0.019383
46.62/20.96	Quasi-ranking function: 50000 - main_y
46.62/20.96	New Graphs: 
46.62/20.96	Transitions:
46.62/20.96	<l2, l2, 0 <= main_x /\ 0 <= main_x + main_y /\ 50001 <= main_y, {main_x -> main_x + main_y, main_y -> 1 + main_y, rest remain the same}>
46.62/20.96	Variables:
46.62/20.96	main_x, main_y
46.62/20.96	Checking conditional termination of SCC {l2}...
46.62/20.96	
46.62/20.96	LOG: CALL solveLinear
46.62/20.96	
46.62/20.96	LOG: RETURN solveLinear - Elapsed time: 0.000599s
46.62/20.96	
46.62/20.96	LOG: CALL solveLinear
46.62/20.96	
46.62/20.96	LOG: RETURN solveLinear - Elapsed time: 0.002460s
46.62/20.96	[32396 : 32413]
46.62/20.96	[32396 : 32414]
46.62/20.96	Solving with 1 template(s).
46.62/20.96	
46.62/20.96	LOG: CALL solveNonLinearGetFirstSolution
46.62/20.96	
46.62/20.96	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007899s
46.62/20.96	Time used: 0.007432
46.62/20.96	Improving Solution with cost 1 ...
46.62/20.96	
46.62/20.96	LOG: CALL solveNonLinearGetNextSolution
46.62/20.96	
46.62/20.96	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.011378s
46.62/20.96	Time used: 0.011373
46.62/20.96	
46.62/20.96	LOG: SAT solveNonLinear - Elapsed time: 0.019277s
46.62/20.96	Cost: 1; Total time: 0.018805
46.62/20.96	Termination implied by a set of invariant(s):
46.62/20.96	Invariant at l2: 0 <= main_x
46.62/20.96	[ Invariant Graph ]
46.62/20.96	Strengthening and disabling transitions...
46.62/20.96	
46.62/20.96	LOG: CALL solverLinear in Graph for feasibility
46.62/20.96	
46.62/20.96	LOG: RETURN solveLinear in Graph for feasibility
46.62/20.96	Strengthening transition (result): 
46.62/20.96	<l2, l2, 0 <= main_x /\ 0 <= main_x + main_y, {main_x -> main_x + main_y, main_y -> 1 + main_y, rest remain the same}>
46.62/20.96	[ Termination Graph ]
46.62/20.96	Strengthening and disabling transitions...
46.62/20.96	
46.62/20.96	LOG: CALL solverLinear in Graph for feasibility
46.62/20.96	
46.62/20.96	LOG: RETURN solveLinear in Graph for feasibility
46.62/20.96	Strengthening transition (result): 
46.62/20.96	<l2, l2, 0 <= main_x /\ 0 <= main_x + main_y /\ 50001 <= main_y, {main_x -> main_x + main_y, main_y -> 1 + main_y, rest remain the same}>
46.62/20.96	Quasi-ranking function: 50000 - main_x
46.62/20.96	New Graphs: 
46.62/20.96	Transitions:
46.62/20.96	<l2, l2, 0 <= main_x + main_y /\ 50001 <= main_x /\ 50001 <= main_y, {main_x -> main_x + main_y, main_y -> 1 + main_y, rest remain the same}>
46.62/20.96	Variables:
46.62/20.96	main_x, main_y
46.62/20.96	Checking conditional termination of SCC {l2}...
46.62/20.96	
46.62/20.96	LOG: CALL solveLinear
46.62/20.96	
46.62/20.96	LOG: RETURN solveLinear - Elapsed time: 0.000622s
46.62/20.96	
46.62/20.96	LOG: CALL solveLinear
46.62/20.96	
46.62/20.96	LOG: RETURN solveLinear - Elapsed time: 0.003271s
46.62/20.96	[32396 : 32418]
46.62/20.96	[32396 : 32419]
46.62/20.96	Solving with 1 template(s).
46.62/20.96	
46.62/20.96	LOG: CALL solveNonLinearGetFirstSolution
46.62/20.96	
46.62/20.96	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008027s
46.62/20.96	Time used: 0.007513
46.62/20.96	Improving Solution with cost 1 ...
46.62/20.96	
46.62/20.96	LOG: CALL solveNonLinearGetNextSolution
46.62/20.96	
46.62/20.96	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.013157s
46.62/20.96	Time used: 0.013152
46.62/20.96	
46.62/20.96	LOG: SAT solveNonLinear - Elapsed time: 0.021184s
46.62/20.96	Cost: 1; Total time: 0.020665
46.62/20.96	Termination implied by a set of invariant(s):
46.62/20.96	Invariant at l2: 0 <= main_x
46.62/20.96	[ Invariant Graph ]
46.62/20.96	Strengthening and disabling transitions...
46.62/20.96	
46.62/20.96	LOG: CALL solverLinear in Graph for feasibility
46.62/20.96	
46.62/20.96	LOG: RETURN solveLinear in Graph for feasibility
46.62/20.96	Strengthening transition (result): 
46.62/20.96	<l2, l2, 0 <= main_x /\ 0 <= main_x + main_y, {main_x -> main_x + main_y, main_y -> 1 + main_y, rest remain the same}>
46.62/20.96	[ Termination Graph ]
46.62/20.96	Strengthening and disabling transitions...
46.62/20.96	
46.62/20.96	LOG: CALL solverLinear in Graph for feasibility
46.62/20.96	
46.62/20.96	LOG: RETURN solveLinear in Graph for feasibility
46.62/20.96	Strengthening transition (result): 
46.62/20.96	<l2, l2, 0 <= main_x + main_y /\ 50001 <= main_x /\ 50001 <= main_y, {main_x -> main_x + main_y, main_y -> 1 + main_y, rest remain the same}>
46.62/20.96	Quasi-ranking function: 50000 - main_x + main_y
46.62/20.96	New Graphs: 
46.62/20.96	Transitions:
46.62/20.96	<l2, l2, 0 <= main_x + main_y /\ 50001 <= main_x /\ 50001 + main_y <= main_x /\ 50001 <= main_y, {main_x -> main_x + main_y, main_y -> 1 + main_y, rest remain the same}>
46.62/20.96	Variables:
46.62/20.96	main_x, main_y
46.62/20.96	Checking conditional termination of SCC {l2}...
46.62/20.96	
46.62/20.96	LOG: CALL solveLinear
46.62/20.96	
46.62/20.96	LOG: RETURN solveLinear - Elapsed time: 0.000699s
46.62/20.96	
46.62/20.96	LOG: CALL solveLinear
46.62/20.96	
46.62/20.96	LOG: RETURN solveLinear - Elapsed time: 0.004472s
46.62/20.96	[32396 : 32423]
46.62/20.96	[32396 : 32424]
46.62/20.96	Solving with 1 template(s).
46.62/20.96	
46.62/20.96	LOG: CALL solveNonLinearGetFirstSolution
46.62/20.96	
46.62/20.96	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009548s
46.62/20.96	Time used: 0.008984
46.62/20.96	Improving Solution with cost 1 ...
46.62/20.96	
46.62/20.96	LOG: CALL solveNonLinearGetNextSolution
46.62/20.96	
46.62/20.96	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.013931s
46.62/20.96	Time used: 0.013925
46.62/20.96	
46.62/20.96	LOG: SAT solveNonLinear - Elapsed time: 0.023480s
46.62/20.96	Cost: 1; Total time: 0.022909
46.62/20.96	Termination implied by a set of invariant(s):
46.62/20.96	Invariant at l2: 0 <= main_x
46.62/20.96	[ Invariant Graph ]
46.62/20.96	Strengthening and disabling transitions...
46.62/20.96	
46.62/20.96	LOG: CALL solverLinear in Graph for feasibility
46.62/20.96	
46.62/20.96	LOG: RETURN solveLinear in Graph for feasibility
46.62/20.96	Strengthening transition (result): 
46.62/20.96	<l2, l2, 0 <= main_x /\ 0 <= main_x + main_y, {main_x -> main_x + main_y, main_y -> 1 + main_y, rest remain the same}>
46.62/20.96	[ Termination Graph ]
46.62/20.96	Strengthening and disabling transitions...
46.62/20.96	
46.62/20.96	LOG: CALL solverLinear in Graph for feasibility
46.62/20.96	
46.62/20.96	LOG: RETURN solveLinear in Graph for feasibility
46.62/20.96	Strengthening transition (result): 
46.62/20.96	<l2, l2, 0 <= main_x + main_y /\ 50001 <= main_x /\ 50001 + main_y <= main_x /\ 50001 <= main_y, {main_x -> main_x + main_y, main_y -> 1 + main_y, rest remain the same}>
46.62/20.96	Quasi-ranking function: 50000 - main_x - main_y
46.62/20.96	New Graphs: 
46.62/20.96	Transitions:
46.62/20.96	<l2, l2, 50001 <= main_x /\ 50001 + main_y <= main_x /\ 50001 <= main_x + main_y /\ 50001 <= main_y, {main_x -> main_x + main_y, main_y -> 1 + main_y, rest remain the same}>
46.62/20.96	Variables:
46.62/20.96	main_x, main_y
46.62/20.96	Checking conditional termination of SCC {l2}...
46.62/20.96	
46.62/20.96	LOG: CALL solveLinear
46.62/20.96	
46.62/20.96	LOG: RETURN solveLinear - Elapsed time: 0.000729s
46.62/20.96	
46.62/20.96	LOG: CALL solveLinear
46.62/20.96	
46.62/20.96	LOG: RETURN solveLinear - Elapsed time: 0.003988s
46.62/20.96	[32396 : 32431]
46.62/20.96	[32396 : 32432]
46.62/20.96	Solving with 1 template(s).
46.62/20.96	
46.62/20.96	LOG: CALL solveNonLinearGetFirstSolution
46.62/20.96	
46.62/20.96	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007898s
46.62/20.96	Time used: 0.007419
46.62/20.96	
46.62/20.96	[32396 : 32436]
46.62/20.96	[32396 : 32440]
46.62/20.96	Successful child: 32436
46.62/20.96	
46.62/20.96	Program does NOT terminate
46.62/20.96	EOF