5.27/4.28	NO
5.27/4.28	
5.27/4.28	Solver Timeout: 4
5.27/4.28	Global Timeout: 300
5.27/4.28	Maximum number of concurrent processes: 900
5.27/4.28	*******************************************************************************************
5.27/4.28	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
5.27/4.28	*******************************************************************************************
5.27/4.28	
5.27/4.28	
5.27/4.28	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
5.27/4.28	
5.27/4.28	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
5.27/4.28	+                                                                  +
5.27/4.28	Init Location: 0
5.27/4.28	Transitions:
5.27/4.28	<l0, l1, true, seq{main__func_return_ -> 0, main_x -> ¿functionCall(__VERIFIER_nondet_int), main_c -> ¿functionCall(__VERIFIER_nondet_int)}>
5.27/4.28	<l1, l2, (main_c = 0)>
5.27/4.28	<l1, l7, not((main_c = 0))>
5.27/4.28	<l2, l3, true>
5.27/4.28	<l3, l6, not((main_x >= 0))>
5.27/4.28	<l3, l4, (main_x >= 0)>
5.27/4.28	<l4, l5, true, seq{main_x -> (main_x + main_c)}>
5.27/4.28	<l5, l3, true>
5.27/4.28	<l6, l7, true>
5.27/4.28	<l7, l8, true, seq{main__func_return_ -> 0}>
5.27/4.28	
5.27/4.28	Fresh variables:
5.27/4.28	
5.27/4.28	Undef variables:
5.27/4.28	
5.27/4.28	Abstraction variables:
5.27/4.28	
5.27/4.28	Exit nodes:
5.27/4.28	
5.27/4.28	Accepting locations:
5.27/4.28	
5.27/4.28	Asserts:
5.27/4.28	
5.27/4.28	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
5.27/4.28	       
5.27/4.28	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
5.27/4.28	       
5.27/4.28	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
5.27/4.28	
5.27/4.28	Init Location: 0
5.27/4.28	Transitions:
5.27/4.28	<l0, l9, true, seq{main__func_return_ -> 0}>
5.27/4.28	<l9, l10, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
5.27/4.28	<l10, l11, true, seq{main_x -> varCall_1}>
5.27/4.28	<l11, l12, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}>
5.27/4.28	<l12, l1, true, seq{main_c -> varCall_2}>
5.27/4.28	<l1, l2, (main_c = 0)>
5.27/4.28	<l1, l7, not((main_c = 0))>
5.27/4.28	<l2, l3, true>
5.27/4.28	<l3, l4, (main_x >= 0)>
5.27/4.28	<l3, l6, not((main_x >= 0))>
5.27/4.28	<l4, l5, true, seq{main_x -> (main_x + main_c)}>
5.27/4.28	<l5, l3, true>
5.27/4.28	<l6, l7, true>
5.27/4.28	<l7, l8, true, seq{main__func_return_ -> 0}>
5.27/4.28	
5.27/4.28	Fresh variables:
5.27/4.28	
5.27/4.28	Undef variables:
5.27/4.28	
5.27/4.28	Abstraction variables:
5.27/4.28	
5.27/4.28	Exit nodes:
5.27/4.28	8, 
5.27/4.28	Accepting locations:
5.27/4.28	
5.27/4.28	Asserts:
5.27/4.28	
5.27/4.28	+                                                                  +
5.27/4.28	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
5.27/4.28	
5.27/4.28	
5.27/4.28	Function Return and Parameters Information [2 functions]:
5.27/4.28	    function name: __VERIFIER_nondet_int [1 return + 0 parameters]        demangled: __VERIFIER_nondet_int
5.27/4.28	        __VERIFIER_nondet_int__func_return_      [function result] : int
5.27/4.28	    function name: main [1 return + 0 parameters]        demangled: main
5.27/4.28	        main__func_return_      [function result] : int
5.27/4.28	
5.27/4.28	
5.27/4.28	AST Ident Scanner Information [4 idents]:
5.27/4.28	__VERIFIER_nondet_int | function | [integer, ()] | <line: 8, col: 1> | <line: 13, col: 6> <line: 14, col: 6>
5.27/4.28	main | function | [integer, ()] | <line: 10, col: 1>
5.27/4.28	c | local variable | integer | <line: 12, col: 5> | <line: 14, col: 2> <line: 15, col: 6> <line: 17, col: 15>
5.27/4.28	x | local variable | integer | <line: 12, col: 5> | <line: 13, col: 2> <line: 16, col: 13> <line: 17, col: 7> <line: 17, col: 11>
5.27/4.28	
5.27/4.28	Main function: main
5.27/4.28	Preprocessed LLVMGraph
5.27/4.28	Init Location: 0
5.27/4.28	Transitions:
5.27/4.28	<l0, l3, (main_c = undef4) /\ (main_x = undef3) /\ (undef4 = 0)>
5.27/4.28	<l0, l8, (main_c = undef4) /\ (main_x = undef3) /\ (undef4 < 0)>
5.27/4.28	<l0, l8, (main_c = undef4) /\ (main_x = undef3) /\ (undef4 > 0)>
5.27/4.28	<l3, l3, (main_x >= 0), par{main_x -> (main_x + main_c)}>
5.27/4.28	<l3, l8, not((main_x >= 0))>
5.27/4.28	
5.27/4.28	Fresh variables:
5.27/4.28	undef3, undef4, 
5.27/4.28	
5.27/4.28	Undef variables:
5.27/4.28	undef3, undef4, 
5.27/4.28	
5.27/4.28	Abstraction variables:
5.27/4.28	
5.27/4.28	Exit nodes:
5.27/4.28	8, 
5.27/4.28	Accepting locations:
5.27/4.28	
5.27/4.28	Asserts:
5.27/4.28	
5.27/4.28	*************************************************************
5.27/4.28	*******************************************************************************************
5.27/4.28	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
5.27/4.28	*******************************************************************************************
5.27/4.28	
5.27/4.28	Init Location: 0
5.27/4.28	Graph 0:
5.27/4.28	Transitions:
5.27/4.28	Variables:
5.27/4.28	
5.27/4.28	Graph 1:
5.27/4.28	Transitions:
5.27/4.28	<l3, l3, 0 <= main_x, {main_x -> main_c + main_x, rest remain the same}>
5.27/4.28	Variables:
5.27/4.28	main_c, main_x
5.27/4.28	
5.27/4.28	Graph 2:
5.27/4.28	Transitions:
5.27/4.28	Variables:
5.27/4.28	
5.27/4.28	Precedence: 
5.27/4.28	Graph 0
5.27/4.28	
5.27/4.28	Graph 1
5.27/4.28	<l0, l3, main_c = undef4 /\ main_x = undef3 /\ undef4 = 0, {all remain the same}>
5.27/4.28	
5.27/4.28	Graph 2
5.27/4.28	<l0, l8, 1 + undef4 <= 0 /\ main_c = undef4 /\ main_x = undef3, {all remain the same}>
5.27/4.28	<l0, l8, 1 <= undef4 /\ main_c = undef4 /\ main_x = undef3, {all remain the same}>
5.27/4.28	<l3, l8, 1 + main_x <= 0, {all remain the same}>
5.27/4.28	
5.27/4.28	Map Locations to Subgraph:
5.27/4.28	( 0 , 0 )
5.27/4.28	( 3 , 1 )
5.27/4.28	( 8 , 2 )
5.27/4.28	
5.27/4.28	*******************************************************************************************
5.27/4.28	********************************    CHECKING ASSERTIONS    ********************************
5.27/4.28	*******************************************************************************************
5.27/4.28	
5.27/4.28	Proving termination of subgraph 0
5.27/4.28	Proving termination of subgraph 1
5.27/4.28	Checking unfeasibility...
5.27/4.28	Time used: 0.002008
5.27/4.28	
5.27/4.28	Checking conditional termination of SCC {l3}...
5.27/4.28	
5.27/4.28	LOG: CALL solveLinear
5.27/4.28	
5.27/4.28	LOG: RETURN solveLinear - Elapsed time: 0.000845s
5.27/4.28	
5.27/4.28	LOG: CALL solveLinear
5.27/4.28	
5.27/4.28	LOG: RETURN solveLinear - Elapsed time: 0.001384s
5.27/4.28	[3373 : 3375]
5.27/4.28	[3373 : 3376]
5.27/4.28	Successful child: 3375
5.27/4.28	[ Invariant Graph ]
5.27/4.28	Strengthening and disabling transitions...
5.27/4.28	
5.27/4.28	LOG: CALL solverLinear in Graph for feasibility
5.27/4.28	
5.27/4.28	LOG: RETURN solveLinear in Graph for feasibility
5.27/4.28	Strengthening transition (result): 
5.27/4.28	<l3, l3, 0 <= main_x /\ 1 + main_c + main_x <= 0, {main_x -> main_c + main_x, rest remain the same}>
5.27/4.28	[ Termination Graph ]
5.27/4.28	Strengthening and disabling transitions...
5.27/4.28	
5.27/4.28	LOG: CALL solverLinear in Graph for feasibility
5.27/4.28	
5.27/4.28	LOG: RETURN solveLinear in Graph for feasibility
5.27/4.28	Strengthening transition (result): 
5.27/4.28	<l3, l3, 0 <= main_x /\ 1 + main_c + main_x <= 0, {main_x -> main_c + main_x, rest remain the same}>
5.27/4.28	Ranking function: main_x
5.27/4.28	New Graphs: 
5.27/4.28	
5.27/4.28	LOG: CALL check - Post:1 + main_c + main_x <= 0 - Process 1
5.27/4.28	* Exit transition: <l0, l3, main_c = undef4 /\ main_x = undef3 /\ undef4 = 0, {all remain the same}>
5.27/4.28	* Postcondition  : 1 + main_c + main_x <= 0
5.27/4.28	
5.27/4.28	LOG: CALL solveLinear
5.27/4.28	
5.27/4.28	LOG: RETURN solveLinear - Elapsed time: 0.000530s
5.27/4.28	> Postcondition is not implied!
5.27/4.28	
5.27/4.28	LOG: RETURN check - Elapsed time: 0.000636s
5.27/4.28	INVARIANTS: 
5.27/4.28	3: 
5.27/4.28	Quasi-INVARIANTS to narrow Graph: 
5.27/4.28	3: 1 + main_c + main_x <= 0 , 
5.27/4.28	Narrowing transition: 
5.27/4.28	<l3, l3, 0 <= main_x, {main_x -> main_c + main_x, rest remain the same}>
5.27/4.28	
5.27/4.28	LOG: Narrow transition size 1
5.27/4.28	invGraph after Narrowing: 
5.27/4.28	Transitions:
5.27/4.28	<l3, l3, 0 <= main_c + main_x /\ 0 <= main_x, {main_x -> main_c + main_x, rest remain the same}>
5.27/4.28	Variables:
5.27/4.28	main_c, main_x
5.27/4.28	Checking conditional termination of SCC {l3}...
5.27/4.28	
5.27/4.28	LOG: CALL solveLinear
5.27/4.28	
5.27/4.28	LOG: RETURN solveLinear - Elapsed time: 0.000544s
5.27/4.28	
5.27/4.28	LOG: CALL solveLinear
5.27/4.28	
5.27/4.28	LOG: RETURN solveLinear - Elapsed time: 0.001739s
5.27/4.28	[3373 : 3380]
5.27/4.28	[3373 : 3381]
5.27/4.28	Solving with 1 template(s).
5.27/4.28	
5.27/4.28	LOG: CALL solveNonLinearGetFirstSolution
5.27/4.28	
5.27/4.28	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005173s
5.27/4.28	Time used: 0.004858
5.27/4.28	
5.27/4.28	[3373 : 3385]
5.27/4.28	[3373 : 3389]
5.27/4.28	Successful child: 3385
5.27/4.28	
5.27/4.28	Program does NOT terminate
5.27/4.28	EOF