18.72/8.44	NO
18.72/8.44	
18.72/8.45	Solver Timeout: 4
18.72/8.45	Global Timeout: 300
18.72/8.45	Maximum number of concurrent processes: 900
18.72/8.45	*******************************************************************************************
18.72/8.45	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
18.72/8.45	*******************************************************************************************
18.72/8.45	
18.72/8.45	
18.72/8.45	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
18.72/8.45	
18.72/8.45	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
18.72/8.45	+                                                                  +
18.72/8.45	Init Location: 0
18.72/8.45	Transitions:
18.72/8.45	<l0, l1, true, seq{main__func_return_ -> 0, main_c -> 5, main_x -> ¿functionCall(__VERIFIER_nondet_int)}>
18.72/8.45	<l1, l2, true>
18.72/8.45	<l2, l5, not((main_x >= 0))>
18.72/8.45	<l2, l3, (main_x >= 0)>
18.72/8.45	<l3, l4, true, seq{main_x -> (main_x + main_c)}>
18.72/8.45	<l4, l2, true>
18.72/8.45	<l5, l6, true, seq{main__func_return_ -> 0}>
18.72/8.45	
18.72/8.45	Fresh variables:
18.72/8.45	
18.72/8.45	Undef variables:
18.72/8.45	
18.72/8.45	Abstraction variables:
18.72/8.45	
18.72/8.45	Exit nodes:
18.72/8.45	
18.72/8.45	Accepting locations:
18.72/8.45	
18.72/8.45	Asserts:
18.72/8.45	
18.72/8.45	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
18.72/8.45	       
18.72/8.45	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
18.72/8.45	       
18.72/8.45	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
18.72/8.45	
18.72/8.45	Init Location: 0
18.72/8.45	Transitions:
18.72/8.45	<l0, l7, true, seq{main__func_return_ -> 0, main_c -> 5}>
18.72/8.45	<l7, l8, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
18.72/8.45	<l8, l1, true, seq{main_x -> varCall_1}>
18.72/8.45	<l1, l2, true>
18.72/8.45	<l2, l3, (main_x >= 0)>
18.72/8.45	<l2, l5, not((main_x >= 0))>
18.72/8.45	<l3, l4, true, seq{main_x -> (main_x + main_c)}>
18.72/8.45	<l4, l2, true>
18.72/8.45	<l5, l6, true, seq{main__func_return_ -> 0}>
18.72/8.45	
18.72/8.45	Fresh variables:
18.72/8.45	
18.72/8.45	Undef variables:
18.72/8.45	
18.72/8.45	Abstraction variables:
18.72/8.45	
18.72/8.45	Exit nodes:
18.72/8.45	6, 
18.72/8.45	Accepting locations:
18.72/8.45	
18.72/8.45	Asserts:
18.72/8.45	
18.72/8.45	+                                                                  +
18.72/8.45	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
18.72/8.45	
18.72/8.45	
18.72/8.45	Function Return and Parameters Information [2 functions]:
18.72/8.45	    function name: __VERIFIER_nondet_int [1 return + 0 parameters]        demangled: __VERIFIER_nondet_int
18.72/8.45	        __VERIFIER_nondet_int__func_return_      [function result] : int
18.72/8.45	    function name: main [1 return + 0 parameters]        demangled: main
18.72/8.45	        main__func_return_      [function result] : int
18.72/8.45	
18.72/8.45	
18.72/8.45	AST Ident Scanner Information [4 idents]:
18.72/8.45	__VERIFIER_nondet_int | function | [integer, ()] | <line: 8, col: 1> | <line: 14, col: 9>
18.72/8.45	main | function | [integer, ()] | <line: 10, col: 1>
18.72/8.45	c | local variable | integer | <line: 12, col: 2> | <line: 13, col: 5> <line: 16, col: 11>
18.72/8.45	x | local variable | integer | <line: 12, col: 2> | <line: 14, col: 5> <line: 15, col: 9> <line: 16, col: 3> <line: 16, col: 7>
18.72/8.45	
18.72/8.45	Main function: main
18.72/8.45	Preprocessed LLVMGraph
18.72/8.45	Init Location: 0
18.72/8.45	Transitions:
18.72/8.45	<l0, l2, (5 = 5) /\ (main_x = undef2)>
18.72/8.45	<l2, l2, (main_x >= 0), par{main_x -> (main_x + 5)}>
18.72/8.45	<l2, l6, not((main_x >= 0))>
18.72/8.45	
18.72/8.45	Fresh variables:
18.72/8.45	undef2, 
18.72/8.45	
18.72/8.45	Undef variables:
18.72/8.45	undef2, 
18.72/8.45	
18.72/8.45	Abstraction variables:
18.72/8.45	
18.72/8.45	Exit nodes:
18.72/8.45	6, 
18.72/8.45	Accepting locations:
18.72/8.45	
18.72/8.45	Asserts:
18.72/8.45	
18.72/8.45	*************************************************************
18.72/8.45	*******************************************************************************************
18.72/8.45	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
18.72/8.45	*******************************************************************************************
18.72/8.45	
18.72/8.45	Init Location: 0
18.72/8.45	Graph 0:
18.72/8.45	Transitions:
18.72/8.45	Variables:
18.72/8.45	
18.72/8.45	Graph 1:
18.72/8.45	Transitions:
18.72/8.45	<l2, l2, 0 <= main_x, {main_x -> 5 + main_x, rest remain the same}>
18.72/8.45	Variables:
18.72/8.45	main_x
18.72/8.45	
18.72/8.45	Graph 2:
18.72/8.45	Transitions:
18.72/8.45	Variables:
18.72/8.45	
18.72/8.45	Precedence: 
18.72/8.45	Graph 0
18.72/8.45	
18.72/8.45	Graph 1
18.72/8.45	<l0, l2, main_x = undef2, {all remain the same}>
18.72/8.45	
18.72/8.45	Graph 2
18.72/8.45	<l2, l6, 1 + main_x <= 0, {all remain the same}>
18.72/8.45	
18.72/8.45	Map Locations to Subgraph:
18.72/8.45	( 0 , 0 )
18.72/8.45	( 2 , 1 )
18.72/8.45	( 6 , 2 )
18.72/8.45	
18.72/8.45	*******************************************************************************************
18.72/8.45	********************************    CHECKING ASSERTIONS    ********************************
18.72/8.45	*******************************************************************************************
18.72/8.45	
18.72/8.45	Proving termination of subgraph 0
18.72/8.45	Proving termination of subgraph 1
18.72/8.45	Checking unfeasibility...
18.72/8.45	Time used: 0.001542
18.72/8.45	
18.72/8.45	Checking conditional termination of SCC {l2}...
18.72/8.45	
18.72/8.45	LOG: CALL solveLinear
18.72/8.45	
18.72/8.45	LOG: RETURN solveLinear - Elapsed time: 0.000637s
18.72/8.45	
18.72/8.45	LOG: CALL solveLinear
18.72/8.45	
18.72/8.45	LOG: RETURN solveLinear - Elapsed time: 0.001186s
18.72/8.45	[28279 : 28281]
18.72/8.45	[28279 : 28282]
18.72/8.45	Successful child: 28281
18.72/8.45	[ Invariant Graph ]
18.72/8.45	Strengthening and disabling transitions...
18.72/8.45	
18.72/8.45	LOG: CALL solverLinear in Graph for feasibility
18.72/8.45	
18.72/8.45	LOG: RETURN solveLinear in Graph for feasibility
18.72/8.45	It's unfeasible. Removing transition: 
18.72/8.45	<l2, l2, 0 <= main_x, {main_x -> 5 + main_x, rest remain the same}>
18.72/8.45	[ Termination Graph ]
18.72/8.45	Strengthening and disabling transitions...
18.72/8.45	
18.72/8.45	LOG: CALL solverLinear in Graph for feasibility
18.72/8.45	
18.72/8.45	LOG: RETURN solveLinear in Graph for feasibility
18.72/8.45	It's unfeasible. Removing transition: 
18.72/8.45	<l2, l2, 0 <= main_x, {main_x -> 5 + main_x, rest remain the same}>
18.72/8.45	New Graphs: 
18.72/8.45	
18.72/8.45	LOG: CALL check - Post:1 + main_x <= 0 - Process 1
18.72/8.45	* Exit transition: <l0, l2, main_x = undef2, {all remain the same}>
18.72/8.45	* Postcondition  : 1 + main_x <= 0
18.72/8.45	
18.72/8.45	LOG: CALL solveLinear
18.72/8.45	
18.72/8.45	LOG: RETURN solveLinear - Elapsed time: 0.000352s
18.72/8.45	> Postcondition is not implied!
18.72/8.45	
18.72/8.45	LOG: RETURN check - Elapsed time: 0.000430s
18.72/8.45	INVARIANTS: 
18.72/8.45	2: 
18.72/8.45	Quasi-INVARIANTS to narrow Graph: 
18.72/8.45	2: 1 + main_x <= 0 , 
18.72/8.45	Narrowing transition: 
18.72/8.45	<l2, l2, 0 <= main_x, {main_x -> 5 + main_x, rest remain the same}>
18.72/8.45	
18.72/8.45	LOG: Narrow transition size 1
18.72/8.45	invGraph after Narrowing: 
18.72/8.45	Transitions:
18.72/8.45	<l2, l2, 0 <= main_x, {main_x -> 5 + main_x, rest remain the same}>
18.72/8.45	Variables:
18.72/8.45	main_x
18.72/8.45	Checking conditional termination of SCC {l2}...
18.72/8.45	
18.72/8.45	LOG: CALL solveLinear
18.72/8.45	
18.72/8.45	LOG: RETURN solveLinear - Elapsed time: 0.000645s
18.72/8.45	
18.72/8.45	LOG: CALL solveLinear
18.72/8.45	
18.72/8.45	LOG: RETURN solveLinear - Elapsed time: 0.001275s
18.72/8.45	[28279 : 28286]
18.72/8.45	[28279 : 28287]
18.72/8.45	Solving with 1 template(s).
18.72/8.45	
18.72/8.45	LOG: CALL solveNonLinearGetFirstSolution
18.72/8.45	
18.72/8.45	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005764s
18.72/8.45	Time used: 0.005467
18.72/8.45	Improving Solution with cost 1 ...
18.72/8.45	
18.72/8.45	LOG: CALL solveNonLinearGetNextSolution
18.72/8.45	
18.72/8.45	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.019119s
18.72/8.45	Time used: 0.019113
18.72/8.45	
18.72/8.45	LOG: SAT solveNonLinear - Elapsed time: 0.024883s
18.72/8.45	Cost: 1; Total time: 0.02458
18.72/8.45	Termination implied by a set of invariant(s):
18.72/8.45	Invariant at l2: 0 <= 1 + main_x
18.72/8.45	[ Invariant Graph ]
18.72/8.45	Strengthening and disabling transitions...
18.72/8.45	
18.72/8.45	LOG: CALL solverLinear in Graph for feasibility
18.72/8.45	
18.72/8.45	LOG: RETURN solveLinear in Graph for feasibility
18.72/8.45	Strengthening transition (result): 
18.72/8.45	<l2, l2, 0 <= main_x, {main_x -> 5 + main_x, rest remain the same}>
18.72/8.45	[ Termination Graph ]
18.72/8.45	Strengthening and disabling transitions...
18.72/8.45	
18.72/8.45	LOG: CALL solverLinear in Graph for feasibility
18.72/8.45	
18.72/8.45	LOG: RETURN solveLinear in Graph for feasibility
18.72/8.45	Strengthening transition (result): 
18.72/8.45	<l2, l2, 0 <= main_x, {main_x -> 5 + main_x, rest remain the same}>
18.72/8.45	Quasi-ranking function: 50000 - main_x
18.72/8.45	New Graphs: 
18.72/8.45	Transitions:
18.72/8.45	<l2, l2, 50001 <= main_x, {main_x -> 5 + main_x, rest remain the same}>
18.72/8.45	Variables:
18.72/8.45	main_x
18.72/8.45	Checking conditional termination of SCC {l2}...
18.72/8.45	
18.72/8.45	LOG: CALL solveLinear
18.72/8.45	
18.72/8.45	LOG: RETURN solveLinear - Elapsed time: 0.000394s
18.72/8.45	
18.72/8.45	LOG: CALL solveLinear
18.72/8.45	
18.72/8.45	LOG: RETURN solveLinear - Elapsed time: 0.001212s
18.72/8.45	[28279 : 28291]
18.72/8.45	[28279 : 28292]
18.72/8.45	Solving with 1 template(s).
18.72/8.45	
18.72/8.45	LOG: CALL solveNonLinearGetFirstSolution
18.72/8.45	
18.72/8.45	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005212s
18.72/8.45	Time used: 0.004903
18.72/8.45	
18.72/8.45	[28279 : 28296]
18.72/8.45	[28279 : 28300]
18.72/8.45	Successful child: 28296
18.72/8.45	
18.72/8.45	Program does NOT terminate
18.72/8.45	EOF