18.73/8.41	NO
18.73/8.41	
18.73/8.41	Solver Timeout: 4
18.73/8.41	Global Timeout: 300
18.73/8.41	Maximum number of concurrent processes: 900
18.73/8.41	*******************************************************************************************
18.73/8.41	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
18.73/8.41	*******************************************************************************************
18.73/8.41	
18.73/8.41	
18.73/8.41	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
18.73/8.41	
18.73/8.41	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
18.73/8.41	+                                                                  +
18.73/8.41	Init Location: 0
18.73/8.41	Transitions:
18.73/8.41	<l0, l1, true, seq{main__func_return_ -> 0, main_i -> ¿functionCall(__VERIFIER_nondet_int)}>
18.73/8.41	<l1, l2, true>
18.73/8.41	<l2, l3, (main_i <= 0)>
18.73/8.41	<l2, l5, not((main_i <= 0))>
18.73/8.41	<l3, l4, true, seq{main_i -> (main_i - 1)}>
18.73/8.41	<l4, l7, true>
18.73/8.41	<l5, l6, true, seq{main_i -> (main_i + 1)}>
18.73/8.41	<l6, l7, true>
18.73/8.41	<l7, l2, true>
18.73/8.41	
18.73/8.41	Fresh variables:
18.73/8.41	
18.73/8.41	Undef variables:
18.73/8.41	
18.73/8.41	Abstraction variables:
18.73/8.41	
18.73/8.41	Exit nodes:
18.73/8.41	
18.73/8.41	Accepting locations:
18.73/8.41	
18.73/8.41	Asserts:
18.73/8.41	
18.73/8.41	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
18.73/8.41	       
18.73/8.41	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
18.73/8.41	       
18.73/8.41	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
18.73/8.41	
18.73/8.41	Init Location: 0
18.73/8.41	Transitions:
18.73/8.41	<l0, l8, true, seq{main__func_return_ -> 0}>
18.73/8.41	<l8, l9, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
18.73/8.41	<l9, l1, true, seq{main_i -> varCall_1}>
18.73/8.41	<l1, l2, true>
18.73/8.41	<l2, l3, (main_i <= 0)>
18.73/8.41	<l2, l5, not((main_i <= 0))>
18.73/8.41	<l3, l4, true, seq{main_i -> (main_i - 1)}>
18.73/8.41	<l4, l7, true>
18.73/8.41	<l5, l6, true, seq{main_i -> (main_i + 1)}>
18.73/8.41	<l6, l7, true>
18.73/8.41	<l7, l2, true>
18.73/8.41	
18.73/8.41	Fresh variables:
18.73/8.41	
18.73/8.41	Undef variables:
18.73/8.41	
18.73/8.41	Abstraction variables:
18.73/8.41	
18.73/8.41	Exit nodes:
18.73/8.41	
18.73/8.41	Accepting locations:
18.73/8.41	
18.73/8.41	Asserts:
18.73/8.41	
18.73/8.41	+                                                                  +
18.73/8.41	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
18.73/8.41	
18.73/8.41	
18.73/8.41	Function Return and Parameters Information [2 functions]:
18.73/8.41	    function name: __VERIFIER_nondet_int [1 return + 0 parameters]        demangled: __VERIFIER_nondet_int
18.73/8.41	        __VERIFIER_nondet_int__func_return_      [function result] : int
18.73/8.41	    function name: main [1 return + 0 parameters]        demangled: main
18.73/8.41	        main__func_return_      [function result] : int
18.73/8.41	
18.73/8.41	
18.73/8.41	AST Ident Scanner Information [3 idents]:
18.73/8.41	__VERIFIER_nondet_int | function | [integer, ()] | <line: 3, col: 1> | <line: 7, col: 9>
18.73/8.41	main | function | [integer, ()] | <line: 5, col: 1>
18.73/8.41	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: 13, col: 17>
18.73/8.41	
18.73/8.41	Main function: main
18.73/8.41	Preprocessed LLVMGraph
18.73/8.41	Init Location: 0
18.73/8.41	Transitions:
18.73/8.41	<l0, l2, (main_i = undef2)>
18.73/8.41	<l2, l2, (main_i <= 0), par{main_i -> (main_i - 1)}>
18.73/8.41	<l2, l2, not((main_i <= 0)), par{main_i -> (main_i + 1)}>
18.73/8.41	
18.73/8.41	Fresh variables:
18.73/8.41	undef2, 
18.73/8.41	
18.73/8.41	Undef variables:
18.73/8.41	undef2, 
18.73/8.41	
18.73/8.41	Abstraction variables:
18.73/8.41	
18.73/8.41	Exit nodes:
18.73/8.41	
18.73/8.41	Accepting locations:
18.73/8.41	
18.73/8.41	Asserts:
18.73/8.41	
18.73/8.41	*************************************************************
18.73/8.41	*******************************************************************************************
18.73/8.41	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
18.73/8.41	*******************************************************************************************
18.73/8.41	
18.73/8.41	Init Location: 0
18.73/8.41	Graph 0:
18.73/8.41	Transitions:
18.73/8.41	Variables:
18.73/8.41	
18.73/8.41	Graph 1:
18.73/8.41	Transitions:
18.73/8.41	<l2, l2, main_i <= 0, {main_i -> -1 + main_i, rest remain the same}>
18.73/8.41	<l2, l2, 1 <= main_i, {main_i -> 1 + main_i, rest remain the same}>
18.73/8.41	Variables:
18.73/8.41	main_i
18.73/8.41	
18.73/8.41	Precedence: 
18.73/8.41	Graph 0
18.73/8.41	
18.73/8.41	Graph 1
18.73/8.41	<l0, l2, main_i = undef2, {all remain the same}>
18.73/8.41	
18.73/8.41	Map Locations to Subgraph:
18.73/8.41	( 0 , 0 )
18.73/8.41	( 2 , 1 )
18.73/8.41	
18.73/8.41	*******************************************************************************************
18.73/8.41	********************************    CHECKING ASSERTIONS    ********************************
18.73/8.41	*******************************************************************************************
18.73/8.41	
18.73/8.41	Proving termination of subgraph 0
18.73/8.41	Proving termination of subgraph 1
18.73/8.41	Checking unfeasibility...
18.73/8.41	Time used: 0.002359
18.73/8.41	
18.73/8.41	Checking conditional termination of SCC {l2}...
18.73/8.41	
18.73/8.41	LOG: CALL solveLinear
18.73/8.41	
18.73/8.41	LOG: RETURN solveLinear - Elapsed time: 0.000921s
18.73/8.41	
18.73/8.41	LOG: CALL solveLinear
18.73/8.41	
18.73/8.41	LOG: RETURN solveLinear - Elapsed time: 0.002537s
18.73/8.41	[33945 : 33947]
18.73/8.41	[33945 : 33948]
18.73/8.41	Successful child: 33947
18.73/8.41	[ Invariant Graph ]
18.73/8.41	Strengthening and disabling transitions...
18.73/8.41	
18.73/8.41	LOG: CALL solverLinear in Graph for feasibility
18.73/8.41	
18.73/8.41	LOG: RETURN solveLinear in Graph for feasibility
18.73/8.41	It's unfeasible. Removing transition: 
18.73/8.41	<l2, l2, main_i <= 0, {main_i -> -1 + main_i, rest remain the same}>
18.73/8.41	
18.73/8.41	LOG: CALL solverLinear in Graph for feasibility
18.73/8.41	
18.73/8.41	LOG: RETURN solveLinear in Graph for feasibility
18.73/8.41	Strengthening transition (result): 
18.73/8.41	<l2, l2, 1 <= main_i, {main_i -> 1 + main_i, rest remain the same}>
18.73/8.41	[ Termination Graph ]
18.73/8.41	Strengthening and disabling transitions...
18.73/8.41	
18.73/8.41	LOG: CALL solverLinear in Graph for feasibility
18.73/8.41	
18.73/8.41	LOG: RETURN solveLinear in Graph for feasibility
18.73/8.41	It's unfeasible. Removing transition: 
18.73/8.41	<l2, l2, main_i <= 0, {main_i -> -1 + main_i, rest remain the same}>
18.73/8.41	
18.73/8.41	LOG: CALL solverLinear in Graph for feasibility
18.73/8.41	
18.73/8.41	LOG: RETURN solveLinear in Graph for feasibility
18.73/8.41	Strengthening transition (result): 
18.73/8.41	<l2, l2, 1 <= main_i, {main_i -> 1 + main_i, rest remain the same}>
18.73/8.41	New Graphs: 
18.73/8.41	Transitions:
18.73/8.41	<l2, l2, 1 <= main_i, {main_i -> 1 + main_i, rest remain the same}>
18.73/8.41	Variables:
18.73/8.41	main_i
18.73/8.41	Checking conditional termination of SCC {l2}...
18.73/8.41	
18.73/8.41	LOG: CALL solveLinear
18.73/8.41	
18.73/8.41	LOG: RETURN solveLinear - Elapsed time: 0.000564s
18.73/8.41	
18.73/8.41	LOG: CALL solveLinear
18.73/8.41	
18.73/8.41	LOG: RETURN solveLinear - Elapsed time: 0.001351s
18.73/8.41	[33945 : 33952]
18.73/8.41	[33945 : 33953]
18.73/8.41	Solving with 1 template(s).
18.73/8.41	
18.73/8.41	LOG: CALL solveNonLinearGetFirstSolution
18.73/8.41	
18.73/8.41	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004938s
18.73/8.41	Time used: 0.004623
18.73/8.41	Improving Solution with cost 1 ...
18.73/8.41	
18.73/8.41	LOG: CALL solveNonLinearGetNextSolution
18.73/8.41	
18.73/8.41	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.010581s
18.73/8.41	Time used: 0.010576
18.73/8.41	
18.73/8.41	LOG: SAT solveNonLinear - Elapsed time: 0.015519s
18.73/8.41	Cost: 1; Total time: 0.015199
18.73/8.41	Quasi-ranking function: 50000 - main_i
18.73/8.41	New Graphs: 
18.73/8.41	Transitions:
18.73/8.41	<l2, l2, 50001 <= main_i, {main_i -> 1 + main_i, rest remain the same}>
18.73/8.41	Variables:
18.73/8.41	main_i
18.73/8.41	Checking conditional termination of SCC {l2}...
18.73/8.41	
18.73/8.41	LOG: CALL solveLinear
18.73/8.41	
18.73/8.41	LOG: RETURN solveLinear - Elapsed time: 0.000387s
18.73/8.41	
18.73/8.41	LOG: CALL solveLinear
18.73/8.41	
18.73/8.41	LOG: RETURN solveLinear - Elapsed time: 0.001199s
18.73/8.41	[33945 : 33957]
18.73/8.41	[33945 : 33958]
18.73/8.41	Solving with 1 template(s).
18.73/8.41	
18.73/8.41	LOG: CALL solveNonLinearGetFirstSolution
18.73/8.41	
18.73/8.41	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004171s
18.73/8.41	Time used: 0.003848
18.73/8.41	Termination failed. Trying to show unreachability...
18.73/8.41	Proving unreachability of entry: <l0, l2, main_i = undef2, {all remain the same}>
18.73/8.41	
18.73/8.41	LOG: CALL check - Post:1 <= 0 - Process 1
18.73/8.41	* Exit transition: <l0, l2, main_i = undef2, {all remain the same}>
18.73/8.41	* Postcondition  : 1 <= 0
18.73/8.41	
18.73/8.41	LOG: CALL solveLinear
18.73/8.41	
18.73/8.41	LOG: RETURN solveLinear - Elapsed time: 0.000559s
18.73/8.41	> Postcondition is not implied!
18.73/8.41	
18.73/8.41	LOG: RETURN check - Elapsed time: 0.000635s
18.73/8.41	Cannot prove unreachability
18.73/8.41	
18.73/8.41	[33945 : 33962]
18.73/8.41	[33945 : 33963]
18.73/8.41	Successful child: 33962
18.73/8.41	
18.73/8.41	Program does NOT terminate
18.73/8.41	EOF