0.00/0.07	NO
0.00/0.07	
0.00/0.07	Solver Timeout: 4
0.00/0.07	Global Timeout: 300
0.00/0.07	Maximum number of concurrent processes: 900
0.00/0.07	*******************************************************************************************
0.00/0.07	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
0.00/0.07	*******************************************************************************************
0.00/0.07	
0.00/0.07	
0.00/0.07	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
0.00/0.07	
0.00/0.07	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
0.00/0.07	+                                                                  +
0.00/0.07	Init Location: 0
0.00/0.07	Transitions:
0.00/0.07	<l0, l1, true, seq{main__func_return_ -> 0, main_i -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.07	<l1, l2, true>
0.00/0.07	<l2, l3, (main_i > 0)>
0.00/0.07	<l2, l5, not((main_i > 0))>
0.00/0.07	<l3, l4, true, seq{main_i -> (main_i - 1)}>
0.00/0.07	<l4, l5, true>
0.00/0.07	<l5, l6, (main_i < 0)>
0.00/0.07	<l5, l8, not((main_i < 0))>
0.00/0.07	<l6, l7, true, seq{main_i -> (main_i + 1)}>
0.00/0.07	<l7, l8, true>
0.00/0.07	<l8, l2, true>
0.00/0.07	
0.00/0.07	Fresh variables:
0.00/0.07	
0.00/0.07	Undef variables:
0.00/0.07	
0.00/0.07	Abstraction variables:
0.00/0.07	
0.00/0.07	Exit nodes:
0.00/0.07	
0.00/0.07	Accepting locations:
0.00/0.07	
0.00/0.07	Asserts:
0.00/0.07	
0.00/0.07	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
0.00/0.07	       
0.00/0.07	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
0.00/0.07	       
0.00/0.07	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
0.00/0.07	
0.00/0.07	Init Location: 0
0.00/0.07	Transitions:
0.00/0.07	<l0, l9, true, seq{main__func_return_ -> 0}>
0.00/0.07	<l9, l10, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.07	<l10, l1, true, seq{main_i -> varCall_1}>
0.00/0.07	<l1, l2, true>
0.00/0.07	<l2, l3, (main_i > 0)>
0.00/0.07	<l2, l5, not((main_i > 0))>
0.00/0.07	<l3, l4, true, seq{main_i -> (main_i - 1)}>
0.00/0.07	<l4, l5, true>
0.00/0.07	<l5, l6, (main_i < 0)>
0.00/0.07	<l5, l8, not((main_i < 0))>
0.00/0.07	<l6, l7, true, seq{main_i -> (main_i + 1)}>
0.00/0.07	<l7, l8, true>
0.00/0.07	<l8, l2, true>
0.00/0.07	
0.00/0.07	Fresh variables:
0.00/0.07	
0.00/0.07	Undef variables:
0.00/0.07	
0.00/0.07	Abstraction variables:
0.00/0.07	
0.00/0.07	Exit nodes:
0.00/0.07	
0.00/0.07	Accepting locations:
0.00/0.07	
0.00/0.07	Asserts:
0.00/0.07	
0.00/0.07	+                                                                  +
0.00/0.07	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
0.00/0.07	
0.00/0.07	
0.00/0.07	Function Return and Parameters Information [2 functions]:
0.00/0.07	    function name: __VERIFIER_nondet_int [1 return + 0 parameters]        demangled: __VERIFIER_nondet_int
0.00/0.08	        __VERIFIER_nondet_int__func_return_      [function result] : int
0.00/0.08	    function name: main [1 return + 0 parameters]        demangled: main
0.00/0.08	        main__func_return_      [function result] : int
0.00/0.08	
0.00/0.08	
0.00/0.08	AST Ident Scanner Information [3 idents]:
0.00/0.08	__VERIFIER_nondet_int | function | [integer, ()] | <line: 3, col: 1> | <line: 7, col: 9>
0.00/0.08	main | function | [integer, ()] | <line: 5, col: 1>
0.00/0.08	i | local variable | integer | <line: 6, col: 5> | <line: 7, col: 5> <line: 10, col: 13> <line: 11, col: 13> <line: 11, col: 17> <line: 13, col: 13> <line: 14, col: 13> <line: 14, col: 17>
0.00/0.08	
0.00/0.08	Main function: main
0.00/0.08	Preprocessed LLVMGraph
0.00/0.08	Init Location: 0
0.00/0.08	Transitions:
0.00/0.08	<l0, l2, (main_i = undef2)>
0.00/0.08	<l2, l2, (main_i > 0) /\ not(((main_i - 1) < 0)), par{main_i -> (main_i - 1)}>
0.00/0.08	<l2, l2, not((main_i > 0)) /\ (main_i < 0), par{main_i -> (main_i + 1)}>
0.00/0.08	<l2, l2, not((main_i > 0)) /\ not((main_i < 0))>
0.00/0.08	
0.00/0.08	Fresh variables:
0.00/0.08	undef2, 
0.00/0.08	
0.00/0.08	Undef variables:
0.00/0.08	undef2, 
0.00/0.08	
0.00/0.08	Abstraction variables:
0.00/0.08	
0.00/0.08	Exit nodes:
0.00/0.08	
0.00/0.08	Accepting locations:
0.00/0.08	
0.00/0.08	Asserts:
0.00/0.08	
0.00/0.08	*************************************************************
0.00/0.08	*******************************************************************************************
0.00/0.08	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.00/0.08	*******************************************************************************************
0.00/0.08	
0.00/0.08	Init Location: 0
0.00/0.08	Graph 0:
0.00/0.08	Transitions:
0.00/0.08	Variables:
0.00/0.08	
0.00/0.08	Graph 1:
0.00/0.08	Transitions:
0.00/0.08	<l2, l2, 1 <= main_i, {main_i -> -1 + main_i, rest remain the same}>
0.00/0.08	<l2, l2, 1 + main_i <= 0, {main_i -> 1 + main_i, rest remain the same}>
0.00/0.08	<l2, l2, main_i = 0, {all remain the same}>
0.00/0.08	Variables:
0.00/0.08	main_i
0.00/0.08	
0.00/0.08	Precedence: 
0.00/0.08	Graph 0
0.00/0.08	
0.00/0.08	Graph 1
0.00/0.08	<l0, l2, main_i = undef2, {all remain the same}>
0.00/0.08	
0.00/0.08	Map Locations to Subgraph:
0.00/0.08	( 0 , 0 )
0.00/0.08	( 2 , 1 )
0.00/0.08	
0.00/0.08	*******************************************************************************************
0.00/0.08	********************************    CHECKING ASSERTIONS    ********************************
0.00/0.08	*******************************************************************************************
0.00/0.08	
0.00/0.08	Proving termination of subgraph 0
0.00/0.08	Proving termination of subgraph 1
0.00/0.08	Checking unfeasibility...
0.00/0.08	Time used: 0.003422
0.00/0.08	
0.00/0.08	Checking conditional termination of SCC {l2}...
0.00/0.08	
0.00/0.08	LOG: CALL solveLinear
0.00/0.08	
0.00/0.08	LOG: RETURN solveLinear - Elapsed time: 0.000713s
0.00/0.08	
0.00/0.08	LOG: CALL solveLinear
0.00/0.08	
0.00/0.08	LOG: RETURN solveLinear - Elapsed time: 0.006742s
0.00/0.08	[45625 : 45627]
0.00/0.08	[45625 : 45628]
0.00/0.08	Successful child: 45628
0.00/0.08	Ranking function: -main_i
0.00/0.08	Ranking function and negation of Quasi-Invariant applied
0.00/0.08	New Graphs: 
0.00/0.08	Transitions:
0.00/0.08	<l2, l2, 1 <= main_i, {main_i -> -1 + main_i, rest remain the same}>
0.00/0.08	<l2, l2, main_i = 0, {all remain the same}>
0.00/0.08	Variables:
0.00/0.08	main_i
0.00/0.08	Checking conditional termination of SCC {l2}...
0.00/0.08	
0.00/0.08	LOG: CALL solveLinear
0.00/0.08	
0.00/0.08	LOG: RETURN solveLinear - Elapsed time: 0.000587s
0.00/0.08	Ranking function: -1 + main_i
0.00/0.08	New Graphs: 
0.00/0.08	Transitions:
0.00/0.08	<l2, l2, main_i = 0, {all remain the same}>
0.00/0.08	Variables:
0.00/0.08	main_i
0.00/0.08	> No variable changes in termination graph.
0.00/0.08	Checking conditional unfeasibility...
0.00/0.08	Termination failed. Trying to show unreachability...
0.00/0.08	Proving unreachability of entry: <l0, l2, main_i = undef2, {all remain the same}>
0.00/0.08	
0.00/0.08	LOG: CALL check - Post:1 <= 0 - Process 1
0.00/0.08	* Exit transition: <l0, l2, main_i = undef2, {all remain the same}>
0.00/0.08	* Postcondition  : 1 <= 0
0.00/0.08	
0.00/0.08	LOG: CALL solveLinear
0.00/0.08	
0.00/0.08	LOG: RETURN solveLinear - Elapsed time: 0.000328s
0.00/0.08	> Postcondition is not implied!
0.00/0.08	
0.00/0.08	LOG: RETURN check - Elapsed time: 0.000398s
0.00/0.08	Cannot prove unreachability
0.00/0.08	
0.00/0.08	[45625 : 45632]
0.00/0.08	[45625 : 45633]
0.00/0.08	Successful child: 45632
0.00/0.08	
0.00/0.08	Program does NOT terminate
0.00/0.08	EOF