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