5.19/4.25	NO
5.19/4.25	
5.19/4.25	Solver Timeout: 4
5.19/4.25	Global Timeout: 300
5.19/4.25	Maximum number of concurrent processes: 900
5.19/4.25	*******************************************************************************************
5.19/4.25	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
5.19/4.25	*******************************************************************************************
5.19/4.25	
5.19/4.25	
5.19/4.25	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
5.19/4.25	
5.19/4.25	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
5.19/4.25	+                                                                  +
5.19/4.25	Init Location: 0
5.19/4.25	Transitions:
5.19/4.25	<l0, l1, true, seq{main__func_return_ -> 0, main_i -> ¿functionCall(__VERIFIER_nondet_int)}>
5.19/4.25	<l1, l2, true>
5.19/4.25	<l2, l13, (main_i = 0)>
5.19/4.25	<l2, l3, not((main_i = 0))>
5.19/4.25	<l3, l12, not((main_i > ~(5)))>
5.19/4.25	<l3, l4, (main_i > ~(5))>
5.19/4.25	<l4, l5, (main_i < 5)>
5.19/4.25	<l4, l12, not((main_i < 5))>
5.19/4.25	<l5, l6, (main_i < 0)>
5.19/4.25	<l5, l8, not((main_i < 0))>
5.19/4.25	<l6, l7, true, seq{main_i -> (main_i + 1)}>
5.19/4.25	<l7, l8, true>
5.19/4.25	<l8, l9, (main_i > 0)>
5.19/4.25	<l8, l11, not((main_i > 0))>
5.19/4.25	<l9, l10, true, seq{main_i -> (main_i - 1)}>
5.19/4.26	<l10, l11, true>
5.19/4.26	<l11, l12, true>
5.19/4.26	<l12, l2, true>
5.19/4.26	<l13, l14, true, seq{main__func_return_ -> 0}>
5.19/4.26	
5.19/4.26	Fresh variables:
5.19/4.26	
5.19/4.26	Undef variables:
5.19/4.26	
5.19/4.26	Abstraction variables:
5.19/4.26	
5.19/4.26	Exit nodes:
5.19/4.26	
5.19/4.26	Accepting locations:
5.19/4.26	
5.19/4.26	Asserts:
5.19/4.26	
5.19/4.26	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
5.19/4.26	       
5.19/4.26	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
5.19/4.26	       
5.19/4.26	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
5.19/4.26	
5.19/4.26	Init Location: 0
5.19/4.26	Transitions:
5.19/4.26	<l0, l15, true, seq{main__func_return_ -> 0}>
5.19/4.26	<l15, l16, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
5.19/4.26	<l16, l1, true, seq{main_i -> varCall_1}>
5.19/4.26	<l1, l2, true>
5.19/4.26	<l2, l13, (main_i = 0)>
5.19/4.26	<l2, l3, not((main_i = 0))>
5.19/4.26	<l3, l4, (main_i > ~(5))>
5.19/4.26	<l3, l12, not((main_i > ~(5)))>
5.19/4.26	<l4, l5, (main_i < 5)>
5.19/4.26	<l4, l12, not((main_i < 5))>
5.19/4.26	<l5, l6, (main_i < 0)>
5.19/4.26	<l5, l8, not((main_i < 0))>
5.19/4.26	<l6, l7, true, seq{main_i -> (main_i + 1)}>
5.19/4.26	<l7, l8, true>
5.19/4.26	<l8, l9, (main_i > 0)>
5.19/4.26	<l8, l11, not((main_i > 0))>
5.19/4.26	<l9, l10, true, seq{main_i -> (main_i - 1)}>
5.19/4.26	<l10, l11, true>
5.19/4.26	<l11, l12, true>
5.19/4.26	<l12, l2, true>
5.19/4.26	<l13, l14, true, seq{main__func_return_ -> 0}>
5.19/4.26	
5.19/4.26	Fresh variables:
5.19/4.26	
5.19/4.26	Undef variables:
5.19/4.26	
5.19/4.26	Abstraction variables:
5.19/4.26	
5.19/4.26	Exit nodes:
5.19/4.26	14, 
5.19/4.26	Accepting locations:
5.19/4.26	
5.19/4.26	Asserts:
5.19/4.26	
5.19/4.26	+                                                                  +
5.19/4.26	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
5.19/4.26	
5.19/4.26	
5.19/4.26	Function Return and Parameters Information [2 functions]:
5.19/4.26	    function name: __VERIFIER_nondet_int [1 return + 0 parameters]        demangled: __VERIFIER_nondet_int
5.19/4.26	        __VERIFIER_nondet_int__func_return_      [function result] : int
5.19/4.26	    function name: main [1 return + 0 parameters]        demangled: main
5.19/4.26	        main__func_return_      [function result] : int
5.19/4.26	
5.19/4.26	
5.19/4.26	AST Ident Scanner Information [3 idents]:
5.19/4.26	__VERIFIER_nondet_int | function | [integer, ()] | <line: 3, col: 1> | <line: 7, col: 9>
5.19/4.26	main | function | [integer, ()] | <line: 5, col: 1>
5.19/4.26	i | local variable | integer | <line: 6, col: 5> | <line: 7, col: 5> <line: 9, col: 12> <line: 10, col: 13> <line: 10, col: 23> <line: 11, col: 17> <line: 12, col: 17> <line: 12, col: 21> <line: 14, col: 17> <line: 15, col: 17> <line: 15, col: 21>
5.19/4.26	
5.19/4.26	Main function: main
5.19/4.26	Preprocessed LLVMGraph
5.19/4.26	Init Location: 0
5.19/4.26	Transitions:
5.19/4.26	<l0, l2, (main_i = undef2)>
5.19/4.26	<l2, l14, (main_i = 0)>
5.19/4.26	<l2, l2, (main_i < 0) /\ (main_i > ~(5)) /\ (main_i < 5) /\ (main_i < 0) /\ not(((main_i + 1) > 0)), par{main_i -> (main_i + 1)}>
5.19/4.26	<l2, l2, (main_i < 0) /\ not((main_i > ~(5)))>
5.19/4.26	<l2, l2, (main_i > 0) /\ (main_i > ~(5)) /\ (main_i < 5) /\ not((main_i < 0)) /\ (main_i > 0), par{main_i -> (main_i - 1)}>
5.19/4.26	<l2, l2, (main_i > 0) /\ (main_i > ~(5)) /\ not((main_i < 5))>
5.19/4.26	
5.19/4.26	Fresh variables:
5.19/4.26	undef2, 
5.19/4.26	
5.19/4.26	Undef variables:
5.19/4.26	undef2, 
5.19/4.26	
5.19/4.26	Abstraction variables:
5.19/4.26	
5.19/4.26	Exit nodes:
5.19/4.26	14, 
5.19/4.26	Accepting locations:
5.19/4.26	
5.19/4.26	Asserts:
5.19/4.26	
5.19/4.26	*************************************************************
5.19/4.26	*******************************************************************************************
5.19/4.26	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
5.19/4.26	*******************************************************************************************
5.19/4.26	
5.19/4.26	Init Location: 0
5.19/4.26	Graph 0:
5.19/4.26	Transitions:
5.19/4.26	Variables:
5.19/4.26	
5.19/4.26	Graph 1:
5.19/4.26	Transitions:
5.19/4.26	<l2, l2, 1 + main_i <= 0 /\ 0 <= 4 + main_i, {main_i -> 1 + main_i, rest remain the same}>
5.19/4.26	<l2, l2, 5 + main_i <= 0, {all remain the same}>
5.19/4.26	<l2, l2, 1 <= main_i /\ main_i <= 4, {main_i -> -1 + main_i, rest remain the same}>
5.19/4.26	<l2, l2, 5 <= main_i, {all remain the same}>
5.19/4.26	Variables:
5.19/4.26	main_i
5.19/4.26	
5.19/4.26	Graph 2:
5.19/4.26	Transitions:
5.19/4.26	Variables:
5.19/4.26	
5.19/4.26	Precedence: 
5.19/4.26	Graph 0
5.19/4.26	
5.19/4.26	Graph 1
5.19/4.26	<l0, l2, main_i = undef2, {all remain the same}>
5.19/4.26	
5.19/4.26	Graph 2
5.19/4.26	<l2, l14, main_i = 0, {all remain the same}>
5.19/4.26	
5.19/4.26	Map Locations to Subgraph:
5.19/4.26	( 0 , 0 )
5.19/4.26	( 2 , 1 )
5.19/4.26	( 14 , 2 )
5.19/4.26	
5.19/4.26	*******************************************************************************************
5.19/4.26	********************************    CHECKING ASSERTIONS    ********************************
5.19/4.26	*******************************************************************************************
5.19/4.26	
5.19/4.26	Proving termination of subgraph 0
5.19/4.26	Proving termination of subgraph 1
5.19/4.26	Checking unfeasibility...
5.19/4.26	Time used: 0.005113
5.19/4.26	
5.19/4.26	Checking conditional termination of SCC {l2}...
5.19/4.26	
5.19/4.26	LOG: CALL solveLinear
5.19/4.26	
5.19/4.26	LOG: RETURN solveLinear - Elapsed time: 0.000942s
5.19/4.26	
5.19/4.26	LOG: CALL solveLinear
5.19/4.26	
5.19/4.26	LOG: RETURN solveLinear - Elapsed time: 0.014515s
5.19/4.26	[33434 : 33436]
5.19/4.26	[33434 : 33437]
5.19/4.26	Successful child: 33437
5.19/4.26	Ranking function: main_i
5.19/4.26	Ranking function and negation of Quasi-Invariant applied
5.19/4.26	New Graphs: 
5.19/4.26	Transitions:
5.19/4.26	<l2, l2, 1 + main_i <= 0 /\ 0 <= 4 + main_i, {main_i -> 1 + main_i, rest remain the same}>
5.19/4.26	<l2, l2, 5 + main_i <= 0, {all remain the same}>
5.19/4.26	<l2, l2, 5 <= main_i, {all remain the same}>
5.19/4.26	Variables:
5.19/4.26	main_i
5.19/4.26	Checking conditional termination of SCC {l2}...
5.19/4.26	
5.19/4.26	LOG: CALL solveLinear
5.19/4.26	
5.19/4.26	LOG: RETURN solveLinear - Elapsed time: 0.000689s
5.19/4.26	Ranking function: -1 - main_i
5.19/4.26	New Graphs: 
5.19/4.26	Transitions:
5.19/4.26	<l2, l2, 5 + main_i <= 0, {all remain the same}>
5.19/4.26	<l2, l2, 5 <= main_i, {all remain the same}>
5.19/4.26	Variables:
5.19/4.26	main_i
5.19/4.26	> No variable changes in termination graph.
5.19/4.26	Checking conditional unfeasibility...
5.19/4.26	Calling Safety with literal 0 <= 4 + main_i and entry <l2, l2, true, {all remain the same}>
5.19/4.26	
5.19/4.26	LOG: CALL check - Post:0 <= 4 + main_i - Process 1
5.19/4.26	* Exit transition: <l2, l2, true, {all remain the same}>
5.19/4.26	* Postcondition  : 0 <= 4 + main_i
5.19/4.26	Quasi-invariants: 
5.19/4.26	Location 2: 0 <= 4 + main_i ; 
5.19/4.26	
5.19/4.26	LOG: CALL check - Post:0 <= 4 + main_i - Process 2
5.19/4.26	* Exit transition: <l0, l2, main_i = undef2, {all remain the same}>
5.19/4.26	* Postcondition  : 0 <= 4 + main_i
5.19/4.26	
5.19/4.26	LOG: CALL solveLinear
5.19/4.26	
5.19/4.26	LOG: RETURN solveLinear - Elapsed time: 0.000382s
5.19/4.26	> Postcondition is not implied!
5.19/4.26	
5.19/4.26	LOG: RETURN check - Elapsed time: 0.000459s
5.19/4.26	
5.19/4.26	LOG: NarrowEntry size 1
5.19/4.26	It's unfeasible. Removing transition: 
5.19/4.26	<l2, l2, 1 + main_i <= 0 /\ 0 <= 4 + main_i, {main_i -> 1 + main_i, rest remain the same}>
5.19/4.26	Narrowing transition: 
5.19/4.26	<l2, l2, 5 + main_i <= 0, {all remain the same}>
5.19/4.26	
5.19/4.26	LOG: Narrow transition size 1
5.19/4.26	It's unfeasible. Removing transition: 
5.19/4.26	<l2, l2, 1 <= main_i /\ main_i <= 4, {main_i -> -1 + main_i, rest remain the same}>
5.19/4.26	It's unfeasible. Removing transition: 
5.19/4.26	<l2, l2, 5 <= main_i, {all remain the same}>
5.19/4.26	ENTRIES:
5.19/4.26	<l0, l2, 5 + main_i <= 0 /\ main_i = undef2, {all remain the same}>
5.19/4.26	END ENTRIES:
5.19/4.26	GRAPH:
5.19/4.26	<l2, l2, 5 + main_i <= 0, {all remain the same}>
5.19/4.26	END GRAPH:
5.19/4.26	EXIT: <l2, l2, true, {all remain the same}>
5.19/4.26	POST: 0 <= 4 + main_i
5.19/4.26	
5.19/4.26	
5.19/4.26	LOG: Try proving POST
5.19/4.26	[33434 : 33441]
5.19/4.26	[33434 : 33442]
5.19/4.26	[33434 : 33443]
5.19/4.26	
5.19/4.26	LOG: Postcondition is not implied - no solution
5.19/4.26	> Postcondition is not implied!
5.19/4.26	
5.19/4.26	LOG: RETURN check - Elapsed time: 4.123243s
5.19/4.26	
5.19/4.26	[33434 : 33444]
5.19/4.26	[33434 : 33448]
5.19/4.26	Successful child: 33448
5.19/4.26	
5.19/4.26	Program does NOT terminate
5.19/4.26	EOF