0.00/0.26	YES
0.00/0.26	
0.00/0.27	Solver Timeout: 4
0.00/0.27	Global Timeout: 300
0.00/0.27	Maximum number of concurrent processes: 900
0.00/0.27	*******************************************************************************************
0.00/0.27	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
0.00/0.27	*******************************************************************************************
0.00/0.27	
0.00/0.27	
0.00/0.27	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
0.00/0.27	
0.00/0.27	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
0.00/0.27	+                                                                  +
0.00/0.27	Init Location: 0
0.00/0.27	Transitions:
0.00/0.27	<l0, l1, true, seq{main__func_return_ -> 0, main_i -> ¿functionCall(__VERIFIER_nondet_int), main_x -> ¿functionCall(__VERIFIER_nondet_int), main_n -> ¿functionCall(__VERIFIER_nondet_int), main_b -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.27	<l1, l2, (main_b >= 1)>
0.00/0.27	<l1, l4, not((main_b >= 1))>
0.00/0.27	<l2, l3, true, seq{main_t -> 1}>
0.00/0.27	<l3, l6, true>
0.00/0.27	<l4, l5, true, seq{main_t -> ~(1)}>
0.00/0.27	<l5, l6, true>
0.00/0.27	<l6, l7, true>
0.00/0.27	<l7, l14, not((main_x <= main_n))>
0.00/0.27	<l7, l8, (main_x <= main_n)>
0.00/0.27	<l8, l9, (main_b >= 1)>
0.00/0.27	<l8, l11, not((main_b >= 1))>
0.00/0.27	<l9, l10, true, seq{main_x -> (main_x + main_t)}>
0.00/0.27	<l10, l13, true>
0.00/0.27	<l11, l12, true, seq{main_x -> (main_x - main_t)}>
0.00/0.27	<l12, l13, true>
0.00/0.27	<l13, l7, true>
0.00/0.27	<l14, l15, true, seq{main__func_return_ -> 0}>
0.00/0.27	
0.00/0.27	Fresh variables:
0.00/0.27	
0.00/0.27	Undef variables:
0.00/0.27	
0.00/0.27	Abstraction variables:
0.00/0.27	
0.00/0.27	Exit nodes:
0.00/0.27	
0.00/0.27	Accepting locations:
0.00/0.27	
0.00/0.27	Asserts:
0.00/0.27	
0.00/0.27	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
0.00/0.27	       
0.00/0.27	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
0.00/0.27	       
0.00/0.27	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
0.00/0.27	
0.00/0.27	Init Location: 0
0.00/0.27	Transitions:
0.00/0.27	<l0, l16, true, seq{main__func_return_ -> 0}>
0.00/0.27	<l16, l17, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.27	<l17, l18, true, seq{main_i -> varCall_1}>
0.00/0.27	<l18, l19, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.27	<l19, l20, true, seq{main_x -> varCall_2}>
0.00/0.27	<l20, l21, true, seq{varCall_3 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.27	<l21, l22, true, seq{main_n -> varCall_3}>
0.00/0.27	<l22, l23, true, seq{varCall_4 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.27	<l23, l1, true, seq{main_b -> varCall_4}>
0.00/0.27	<l1, l2, (main_b >= 1)>
0.00/0.27	<l1, l4, not((main_b >= 1))>
0.00/0.27	<l2, l3, true, seq{main_t -> 1}>
0.00/0.27	<l3, l6, true>
0.00/0.27	<l4, l5, true, seq{main_t -> ~(1)}>
0.00/0.27	<l5, l6, true>
0.00/0.27	<l6, l7, true>
0.00/0.27	<l7, l8, (main_x <= main_n)>
0.00/0.27	<l7, l14, not((main_x <= main_n))>
0.00/0.27	<l8, l9, (main_b >= 1)>
0.00/0.27	<l8, l11, not((main_b >= 1))>
0.00/0.27	<l9, l10, true, seq{main_x -> (main_x + main_t)}>
0.00/0.27	<l10, l13, true>
0.00/0.27	<l11, l12, true, seq{main_x -> (main_x - main_t)}>
0.00/0.27	<l12, l13, true>
0.00/0.27	<l13, l7, true>
0.00/0.27	<l14, l15, true, seq{main__func_return_ -> 0}>
0.00/0.27	
0.00/0.27	Fresh variables:
0.00/0.27	
0.00/0.27	Undef variables:
0.00/0.27	
0.00/0.27	Abstraction variables:
0.00/0.27	
0.00/0.27	Exit nodes:
0.00/0.27	15, 
0.00/0.27	Accepting locations:
0.00/0.27	
0.00/0.27	Asserts:
0.00/0.27	
0.00/0.27	+                                                                  +
0.00/0.27	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
0.00/0.27	
0.00/0.27	
0.00/0.27	Function Return and Parameters Information [2 functions]:
0.00/0.27	    function name: __VERIFIER_nondet_int [1 return + 0 parameters]        demangled: __VERIFIER_nondet_int
0.00/0.27	        __VERIFIER_nondet_int__func_return_      [function result] : int
0.00/0.27	    function name: main [1 return + 0 parameters]        demangled: main
0.00/0.27	        main__func_return_      [function result] : int
0.00/0.27	
0.00/0.27	
0.00/0.27	AST Ident Scanner Information [7 idents]:
0.00/0.27	__VERIFIER_nondet_int | function | [integer, ()] | <line: 11, col: 1> | <line: 15, col: 6> <line: 16, col: 6> <line: 17, col: 6> <line: 18, col: 6>
0.00/0.27	main | function | [integer, ()] | <line: 13, col: 1>
0.00/0.27	i | local variable | integer | <line: 14, col: 5> | <line: 15, col: 2>
0.00/0.27	x | local variable | integer | <line: 14, col: 5> | <line: 16, col: 2> <line: 24, col: 9> <line: 26, col: 4> <line: 26, col: 8> <line: 28, col: 4> <line: 28, col: 8>
0.00/0.27	n | local variable | integer | <line: 14, col: 5> | <line: 17, col: 2> <line: 24, col: 14>
0.00/0.27	b | local variable | integer | <line: 14, col: 5> | <line: 18, col: 2> <line: 19, col: 6> <line: 25, col: 7>
0.00/0.27	t | local variable | integer | <line: 14, col: 5> | <line: 20, col: 3> <line: 22, col: 3> <line: 26, col: 12> <line: 28, col: 12>
0.00/0.27	
0.00/0.27	Main function: main
0.00/0.27	Preprocessed LLVMGraph
0.00/0.27	Init Location: 0
0.00/0.27	Transitions:
0.00/0.27	<l0, l7, (main_x = undef6) /\ (main_n = undef7) /\ (main_b = undef8) /\ (undef8 >= 1), par{main_t -> 1}>
0.00/0.27	<l0, l7, (main_x = undef6) /\ (main_n = undef7) /\ (main_b = undef8) /\ not((undef8 >= 1)), par{main_t -> ~(1)}>
0.00/0.27	<l7, l7, (main_x <= main_n) /\ (main_b >= 1), par{main_x -> (main_x + main_t)}>
0.00/0.27	<l7, l7, (main_x <= main_n) /\ not((main_b >= 1)), par{main_x -> (main_x - main_t)}>
0.00/0.27	<l7, l15, not((main_x <= main_n))>
0.00/0.27	
0.00/0.27	Fresh variables:
0.00/0.27	undef5, undef6, undef7, undef8, 
0.00/0.27	
0.00/0.27	Undef variables:
0.00/0.27	undef5, undef6, undef7, undef8, 
0.00/0.27	
0.00/0.27	Abstraction variables:
0.00/0.27	
0.00/0.27	Exit nodes:
0.00/0.27	15, 
0.00/0.27	Accepting locations:
0.00/0.27	
0.00/0.27	Asserts:
0.00/0.27	
0.00/0.27	*************************************************************
0.00/0.27	*******************************************************************************************
0.00/0.27	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.00/0.27	*******************************************************************************************
0.00/0.27	
0.00/0.27	Init Location: 0
0.00/0.27	Graph 0:
0.00/0.27	Transitions:
0.00/0.27	Variables:
0.00/0.27	
0.00/0.27	Graph 1:
0.00/0.27	Transitions:
0.00/0.27	<l7, l7, main_x <= main_n /\ 1 <= main_b, {main_x -> main_x + main_t, rest remain the same}>
0.00/0.27	<l7, l7, main_x <= main_n /\ main_b <= 0, {main_x -> main_x - main_t, rest remain the same}>
0.00/0.27	Variables:
0.00/0.27	main_x, main_n, main_b, main_t
0.00/0.27	
0.00/0.27	Graph 2:
0.00/0.27	Transitions:
0.00/0.27	Variables:
0.00/0.27	
0.00/0.27	Precedence: 
0.00/0.27	Graph 0
0.00/0.27	
0.00/0.27	Graph 1
0.00/0.27	<l0, l7, 1 <= undef8 /\ main_x = undef6 /\ main_n = undef7 /\ main_b = undef8, {main_t -> 1, rest remain the same}>
0.00/0.27	<l0, l7, undef8 <= 0 /\ main_x = undef6 /\ main_n = undef7 /\ main_b = undef8, {main_t -> -1, rest remain the same}>
0.00/0.27	
0.00/0.27	Graph 2
0.00/0.27	<l7, l15, 1 + main_n <= main_x, {all remain the same}>
0.00/0.27	
0.00/0.27	Map Locations to Subgraph:
0.00/0.27	( 0 , 0 )
0.00/0.27	( 7 , 1 )
0.00/0.27	( 15 , 2 )
0.00/0.27	
0.00/0.27	*******************************************************************************************
0.00/0.27	********************************    CHECKING ASSERTIONS    ********************************
0.00/0.27	*******************************************************************************************
0.00/0.27	
0.00/0.27	Proving termination of subgraph 0
0.00/0.27	Proving termination of subgraph 1
0.00/0.27	Checking unfeasibility...
0.00/0.27	Time used: 0.006356
0.00/0.27	
0.00/0.27	Checking conditional termination of SCC {l7}...
0.00/0.27	
0.00/0.27	LOG: CALL solveLinear
0.00/0.27	
0.00/0.27	LOG: RETURN solveLinear - Elapsed time: 0.001840s
0.00/0.27	
0.00/0.27	LOG: CALL solveLinear
0.00/0.27	
0.00/0.27	LOG: RETURN solveLinear - Elapsed time: 0.003915s
0.00/0.27	[50291 : 50293]
0.00/0.27	[50291 : 50294]
0.00/0.27	Successful child: 50293
0.00/0.27	[ Invariant Graph ]
0.00/0.27	Strengthening and disabling transitions...
0.00/0.27	
0.00/0.27	LOG: CALL solverLinear in Graph for feasibility
0.00/0.27	
0.00/0.27	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.27	Strengthening transition (result): 
0.00/0.27	<l7, l7, main_x <= main_n /\ 1 <= main_b, {main_x -> main_x + main_t, rest remain the same}>
0.00/0.27	
0.00/0.27	LOG: CALL solverLinear in Graph for feasibility
0.00/0.27	
0.00/0.27	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.27	It's unfeasible. Removing transition: 
0.00/0.27	<l7, l7, main_x <= main_n /\ main_b <= 0, {main_x -> main_x - main_t, rest remain the same}>
0.00/0.27	[ Termination Graph ]
0.00/0.27	Strengthening and disabling transitions...
0.00/0.27	> It's unfeasible. Removing transition: 
0.00/0.27	<l7, l7, main_x <= main_n /\ main_b <= 0, {main_x -> main_x - main_t, rest remain the same}>
0.00/0.27	
0.00/0.27	LOG: CALL solverLinear in Graph for feasibility
0.00/0.27	
0.00/0.27	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.27	Strengthening transition (result): 
0.00/0.27	<l7, l7, main_x <= main_n /\ 1 <= main_b, {main_x -> main_x + main_t, rest remain the same}>
0.00/0.27	New Graphs: 
0.00/0.27	Transitions:
0.00/0.27	<l7, l7, main_x <= main_n /\ 1 <= main_b, {main_x -> main_x + main_t, rest remain the same}>
0.00/0.27	Variables:
0.00/0.27	main_x, main_n, main_b, main_t
0.00/0.27	Checking conditional termination of SCC {l7}...
0.00/0.27	
0.00/0.27	LOG: CALL solveLinear
0.00/0.27	
0.00/0.27	LOG: RETURN solveLinear - Elapsed time: 0.000982s
0.00/0.27	
0.00/0.27	LOG: CALL solveLinear
0.00/0.27	
0.00/0.27	LOG: RETURN solveLinear - Elapsed time: 0.002592s
0.00/0.27	[50291 : 50298]
0.00/0.27	[50291 : 50299]
0.00/0.27	Successful child: 50298
0.00/0.27	[ Invariant Graph ]
0.00/0.27	Strengthening and disabling transitions...
0.00/0.27	
0.00/0.27	LOG: CALL solverLinear in Graph for feasibility
0.00/0.27	
0.00/0.27	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.27	Strengthening transition (result): 
0.00/0.27	<l7, l7, main_x <= main_n /\ 1 <= main_b /\ 1 <= main_t, {main_x -> main_x + main_t, rest remain the same}>
0.00/0.27	[ Termination Graph ]
0.00/0.27	Strengthening and disabling transitions...
0.00/0.27	
0.00/0.27	LOG: CALL solverLinear in Graph for feasibility
0.00/0.27	
0.00/0.27	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.27	Strengthening transition (result): 
0.00/0.27	<l7, l7, main_x <= main_n /\ 1 <= main_b /\ 1 <= main_t, {main_x -> main_x + main_t, rest remain the same}>
0.00/0.27	Ranking function: -main_x + main_n
0.00/0.27	New Graphs: 
0.00/0.27	
0.00/0.27	LOG: CALL check - Post:1 <= main_b - Process 1
0.00/0.27	* Exit transition: <l0, l7, undef8 <= 0 /\ main_x = undef6 /\ main_n = undef7 /\ main_b = undef8, {main_t -> -1, rest remain the same}>
0.00/0.27	* Postcondition  : 1 <= main_b
0.00/0.27	
0.00/0.27	LOG: CALL solveLinear
0.00/0.27	
0.00/0.27	LOG: RETURN solveLinear - Elapsed time: 0.000679s
0.00/0.27	> Postcondition is not implied!
0.00/0.27	
0.00/0.27	LOG: RETURN check - Elapsed time: 0.000795s
0.00/0.27	INVARIANTS: 
0.00/0.27	7: 
0.00/0.27	Quasi-INVARIANTS to narrow Graph: 
0.00/0.27	7: 1 <= main_b , 
0.00/0.27	
0.00/0.27	LOG: CALL check - Post:1 <= main_t - Process 2
0.00/0.27	* Exit transition: <l0, l7, undef8 <= 0 /\ main_x = undef6 /\ main_n = undef7 /\ main_b = undef8, {main_t -> -1, rest remain the same}>
0.00/0.27	* Postcondition  : 1 <= main_t
0.00/0.27	
0.00/0.27	LOG: CALL solveLinear
0.00/0.27	
0.00/0.27	LOG: RETURN solveLinear - Elapsed time: 0.000596s
0.00/0.27	> Postcondition is not implied!
0.00/0.27	
0.00/0.27	LOG: RETURN check - Elapsed time: 0.000697s
0.00/0.27	INVARIANTS: 
0.00/0.27	7: 
0.00/0.27	Quasi-INVARIANTS to narrow Graph: 
0.00/0.27	7: 1 <= main_t , 
0.00/0.27	Narrowing transition: 
0.00/0.27	<l7, l7, main_x <= main_n /\ 1 <= main_b, {main_x -> main_x + main_t, rest remain the same}>
0.00/0.27	
0.00/0.27	LOG: Narrow transition size 2
0.00/0.27	Narrowing transition: 
0.00/0.27	<l7, l7, main_x <= main_n /\ main_b <= 0, {main_x -> main_x - main_t, rest remain the same}>
0.00/0.27	
0.00/0.27	LOG: Narrow transition size 2
0.00/0.27	invGraph after Narrowing: 
0.00/0.27	Transitions:
0.00/0.27	<l7, l7, main_x <= main_n /\ main_t <= 0 /\ 1 <= main_b, {main_x -> main_x + main_t, rest remain the same}>
0.00/0.27	<l7, l7, main_x <= main_n /\ main_b <= 0, {main_x -> main_x - main_t, rest remain the same}>
0.00/0.27	Variables:
0.00/0.27	main_x, main_n, main_b, main_t
0.00/0.27	Checking conditional termination of SCC {l7}...
0.00/0.27	
0.00/0.27	LOG: CALL solveLinear
0.00/0.27	
0.00/0.27	LOG: RETURN solveLinear - Elapsed time: 0.001774s
0.00/0.27	
0.00/0.27	LOG: CALL solveLinear
0.00/0.27	
0.00/0.27	LOG: RETURN solveLinear - Elapsed time: 0.004814s
0.00/0.27	[50291 : 50303]
0.00/0.27	[50291 : 50304]
0.00/0.27	Successful child: 50303
0.00/0.27	[ Invariant Graph ]
0.00/0.27	Strengthening and disabling transitions...
0.00/0.27	
0.00/0.27	LOG: CALL solverLinear in Graph for feasibility
0.00/0.27	
0.00/0.27	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.27	It's unfeasible. Removing transition: 
0.00/0.27	<l7, l7, main_x <= main_n /\ main_t <= 0 /\ 1 <= main_b, {main_x -> main_x + main_t, rest remain the same}>
0.00/0.27	
0.00/0.27	LOG: CALL solverLinear in Graph for feasibility
0.00/0.27	
0.00/0.27	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.27	Strengthening transition (result): 
0.00/0.27	<l7, l7, main_x <= main_n /\ main_b <= 0, {main_x -> main_x - main_t, rest remain the same}>
0.00/0.27	[ Termination Graph ]
0.00/0.27	Strengthening and disabling transitions...
0.00/0.27	> It's unfeasible. Removing transition: 
0.00/0.27	<l7, l7, main_x <= main_n /\ main_t <= 0 /\ 1 <= main_b, {main_x -> main_x + main_t, rest remain the same}>
0.00/0.27	
0.00/0.27	LOG: CALL solverLinear in Graph for feasibility
0.00/0.27	
0.00/0.27	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.27	Strengthening transition (result): 
0.00/0.27	<l7, l7, main_x <= main_n /\ main_b <= 0, {main_x -> main_x - main_t, rest remain the same}>
0.00/0.27	New Graphs: 
0.00/0.27	Transitions:
0.00/0.27	<l7, l7, main_x <= main_n /\ main_b <= 0, {main_x -> main_x - main_t, rest remain the same}>
0.00/0.27	Variables:
0.00/0.27	main_x, main_n, main_b, main_t
0.00/0.27	Checking conditional termination of SCC {l7}...
0.00/0.27	
0.00/0.27	LOG: CALL solveLinear
0.00/0.27	
0.00/0.27	LOG: RETURN solveLinear - Elapsed time: 0.000940s
0.00/0.27	
0.00/0.27	LOG: CALL solveLinear
0.00/0.27	
0.00/0.27	LOG: RETURN solveLinear - Elapsed time: 0.002484s
0.00/0.27	[50291 : 50308]
0.00/0.27	[50291 : 50309]
0.00/0.27	Successful child: 50308
0.00/0.27	[ Invariant Graph ]
0.00/0.27	Strengthening and disabling transitions...
0.00/0.27	
0.00/0.27	LOG: CALL solverLinear in Graph for feasibility
0.00/0.27	
0.00/0.27	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.27	Strengthening transition (result): 
0.00/0.27	<l7, l7, main_x <= main_n /\ main_b <= 0 /\ 1 + main_t <= 0, {main_x -> main_x - main_t, rest remain the same}>
0.00/0.27	[ Termination Graph ]
0.00/0.27	Strengthening and disabling transitions...
0.00/0.27	
0.00/0.27	LOG: CALL solverLinear in Graph for feasibility
0.00/0.27	
0.00/0.27	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.27	Strengthening transition (result): 
0.00/0.27	<l7, l7, main_x <= main_n /\ main_b <= 0 /\ 1 + main_t <= 0, {main_x -> main_x - main_t, rest remain the same}>
0.00/0.27	Ranking function: -main_x + main_n - main_t
0.00/0.27	New Graphs: 
0.00/0.27	INVARIANTS: 
0.00/0.27	7: main_b <= 0 , 
0.00/0.27	Quasi-INVARIANTS to narrow Graph: 
0.00/0.27	7: 
0.00/0.27	INVARIANTS: 
0.00/0.27	7: 1 + main_t <= 0 , 
0.00/0.27	Quasi-INVARIANTS to narrow Graph: 
0.00/0.27	7: 
0.00/0.27	Proving termination of subgraph 2
0.00/0.27	Analyzing SCC {l15}...
0.00/0.27	No cycles found.
0.00/0.27	
0.00/0.27	Program Terminates
0.00/0.27	EOF