65.42/25.15	NO
65.42/25.15	
65.42/25.15	Solver Timeout: 4
65.42/25.15	Global Timeout: 300
65.42/25.15	Maximum number of concurrent processes: 900
65.42/25.15	*******************************************************************************************
65.42/25.15	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
65.42/25.15	*******************************************************************************************
65.42/25.15	
65.42/25.15	
65.42/25.15	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
65.42/25.15	
65.42/25.15	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
65.42/25.15	+                                                                  +
65.42/25.15	Init Location: 0
65.42/25.15	Transitions:
65.42/25.15	<l0, l1, true, seq{main__func_return_ -> 0, main_i -> ¿functionCall(__VERIFIER_nondet_int)}>
65.42/25.15	<l1, l2, true>
65.42/25.15	<l2, l12, not((main_i > 10))>
65.42/25.15	<l2, l3, (main_i > 10)>
65.42/25.15	<l3, l4, (main_i = 25)>
65.42/25.15	<l3, l6, not((main_i = 25))>
65.42/25.15	<l4, l5, true, seq{main_i -> 30}>
65.42/25.15	<l5, l6, true>
65.42/25.15	<l6, l7, (main_i <= 30)>
65.42/25.15	<l6, l9, not((main_i <= 30))>
65.42/25.15	<l7, l8, true, seq{main_i -> (main_i - 1)}>
65.42/25.15	<l8, l11, true>
65.42/25.15	<l9, l10, true, seq{main_i -> 20}>
65.42/25.15	<l10, l11, true>
65.42/25.15	<l11, l2, true>
65.42/25.15	<l12, l13, true, seq{main__func_return_ -> 0}>
65.42/25.15	
65.42/25.15	Fresh variables:
65.42/25.15	
65.42/25.15	Undef variables:
65.42/25.15	
65.42/25.15	Abstraction variables:
65.42/25.15	
65.42/25.15	Exit nodes:
65.42/25.15	
65.42/25.15	Accepting locations:
65.42/25.15	
65.42/25.15	Asserts:
65.42/25.15	
65.42/25.15	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
65.42/25.15	       
65.42/25.15	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
65.42/25.15	       
65.42/25.15	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
65.42/25.15	
65.42/25.15	Init Location: 0
65.42/25.15	Transitions:
65.42/25.15	<l0, l14, true, seq{main__func_return_ -> 0}>
65.42/25.15	<l14, l15, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
65.42/25.15	<l15, l1, true, seq{main_i -> varCall_1}>
65.42/25.15	<l1, l2, true>
65.42/25.15	<l2, l3, (main_i > 10)>
65.42/25.15	<l2, l12, not((main_i > 10))>
65.42/25.15	<l3, l4, (main_i = 25)>
65.42/25.15	<l3, l6, not((main_i = 25))>
65.42/25.15	<l4, l5, true, seq{main_i -> 30}>
65.42/25.15	<l5, l6, true>
65.42/25.15	<l6, l7, (main_i <= 30)>
65.42/25.15	<l6, l9, not((main_i <= 30))>
65.42/25.15	<l7, l8, true, seq{main_i -> (main_i - 1)}>
65.42/25.15	<l8, l11, true>
65.42/25.15	<l9, l10, true, seq{main_i -> 20}>
65.42/25.15	<l10, l11, true>
65.42/25.15	<l11, l2, true>
65.42/25.15	<l12, l13, true, seq{main__func_return_ -> 0}>
65.42/25.15	
65.42/25.15	Fresh variables:
65.42/25.15	
65.42/25.15	Undef variables:
65.42/25.15	
65.42/25.15	Abstraction variables:
65.42/25.15	
65.42/25.15	Exit nodes:
65.42/25.15	13, 
65.42/25.15	Accepting locations:
65.42/25.15	
65.42/25.15	Asserts:
65.42/25.15	
65.42/25.15	+                                                                  +
65.42/25.15	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
65.42/25.15	
65.42/25.15	
65.42/25.15	Function Return and Parameters Information [2 functions]:
65.42/25.15	    function name: __VERIFIER_nondet_int [1 return + 0 parameters]        demangled: __VERIFIER_nondet_int
65.42/25.15	        __VERIFIER_nondet_int__func_return_      [function result] : int
65.42/25.15	    function name: main [1 return + 0 parameters]        demangled: main
65.42/25.15	        main__func_return_      [function result] : int
65.42/25.15	
65.42/25.15	
65.42/25.15	AST Ident Scanner Information [3 idents]:
65.42/25.15	__VERIFIER_nondet_int | function | [integer, ()] | <line: 3, col: 1> | <line: 7, col: 9>
65.42/25.15	main | function | [integer, ()] | <line: 5, col: 1>
65.42/25.15	i | local variable | integer | <line: 6, col: 5> | <line: 7, col: 5> <line: 9, col: 12> <line: 10, col: 13> <line: 11, col: 13> <line: 13, col: 13> <line: 14, col: 13> <line: 14, col: 17> <line: 16, col: 13>
65.42/25.15	
65.42/25.15	Main function: main
65.42/25.15	Preprocessed LLVMGraph
65.42/25.15	Init Location: 0
65.42/25.15	Transitions:
65.42/25.15	<l0, l2, (main_i = undef2)>
65.42/25.15	<l2, l2, (main_i > 10) /\ (main_i = 25) /\ (30 <= 30), par{main_i -> (30 - 1)}>
65.42/25.15	<l2, l2, (main_i > 10) /\ (main_i < 25) /\ (main_i <= 30), par{main_i -> (main_i - 1)}>
65.42/25.15	<l2, l2, (main_i > 10) /\ (main_i > 25) /\ (main_i <= 30), par{main_i -> (main_i - 1)}>
65.42/25.15	<l2, l2, (main_i > 10) /\ (main_i > 25) /\ not((main_i <= 30)), par{main_i -> 20}>
65.42/25.15	<l2, l13, not((main_i > 10))>
65.42/25.15	
65.42/25.15	Fresh variables:
65.42/25.15	undef2, 
65.42/25.15	
65.42/25.15	Undef variables:
65.42/25.15	undef2, 
65.42/25.15	
65.42/25.15	Abstraction variables:
65.42/25.15	
65.42/25.15	Exit nodes:
65.42/25.15	13, 
65.42/25.15	Accepting locations:
65.42/25.15	
65.42/25.15	Asserts:
65.42/25.15	
65.42/25.15	*************************************************************
65.42/25.15	*******************************************************************************************
65.42/25.15	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
65.42/25.15	*******************************************************************************************
65.42/25.15	
65.42/25.15	Init Location: 0
65.42/25.15	Graph 0:
65.42/25.15	Transitions:
65.42/25.15	Variables:
65.42/25.15	
65.42/25.15	Graph 1:
65.42/25.15	Transitions:
65.42/25.15	<l2, l2, main_i = 25, {main_i -> 29, rest remain the same}>
65.42/25.15	<l2, l2, 11 <= main_i /\ main_i <= 24, {main_i -> -1 + main_i, rest remain the same}>
65.42/25.15	<l2, l2, main_i <= 30 /\ 26 <= main_i, {main_i -> -1 + main_i, rest remain the same}>
65.42/25.15	<l2, l2, 31 <= main_i, {main_i -> 20, rest remain the same}>
65.42/25.15	Variables:
65.42/25.15	main_i
65.42/25.15	
65.42/25.15	Graph 2:
65.42/25.15	Transitions:
65.42/25.15	Variables:
65.42/25.15	
65.42/25.15	Precedence: 
65.42/25.15	Graph 0
65.42/25.15	
65.42/25.15	Graph 1
65.42/25.15	<l0, l2, main_i = undef2, {all remain the same}>
65.42/25.15	
65.42/25.15	Graph 2
65.42/25.15	<l2, l13, main_i <= 10, {all remain the same}>
65.42/25.15	
65.42/25.15	Map Locations to Subgraph:
65.42/25.15	( 0 , 0 )
65.42/25.15	( 2 , 1 )
65.42/25.15	( 13 , 2 )
65.42/25.15	
65.42/25.15	*******************************************************************************************
65.42/25.15	********************************    CHECKING ASSERTIONS    ********************************
65.42/25.15	*******************************************************************************************
65.42/25.15	
65.42/25.15	Proving termination of subgraph 0
65.42/25.15	Proving termination of subgraph 1
65.42/25.15	Checking unfeasibility...
65.42/25.15	Time used: 0.005564
65.42/25.15	
65.42/25.15	Checking conditional termination of SCC {l2}...
65.42/25.15	
65.42/25.15	LOG: CALL solveLinear
65.42/25.15	
65.42/25.15	LOG: RETURN solveLinear - Elapsed time: 0.001392s
65.42/25.15	
65.42/25.15	LOG: CALL solveLinear
65.42/25.15	
65.42/25.15	LOG: RETURN solveLinear - Elapsed time: 0.010479s
65.42/25.15	Piecewise ranking function: min(-682 + 62*main_i,806)
65.42/25.15	New Graphs: 
65.42/25.15	Transitions:
65.42/25.15	<l2, l2, main_i = 25, {main_i -> 29, rest remain the same}>
65.42/25.15	<l2, l2, main_i <= 30 /\ 26 <= main_i, {main_i -> -1 + main_i, rest remain the same}>
65.42/25.15	Variables:
65.42/25.15	main_i
65.42/25.15	Checking conditional termination of SCC {l2}...
65.42/25.15	
65.42/25.15	LOG: CALL solveLinear
65.42/25.15	
65.42/25.15	LOG: RETURN solveLinear - Elapsed time: 0.000692s
65.42/25.15	
65.42/25.15	LOG: CALL solveLinear
65.42/25.15	
65.42/25.15	LOG: RETURN solveLinear - Elapsed time: 0.010229s
65.42/25.15	[64218 : 64220]
65.42/25.15	[64218 : 64221]
65.42/25.15	Successful child: 64220
65.42/25.15	[ Invariant Graph ]
65.42/25.15	Strengthening and disabling transitions...
65.42/25.15	
65.42/25.15	LOG: CALL solverLinear in Graph for feasibility
65.42/25.15	
65.42/25.15	LOG: RETURN solveLinear in Graph for feasibility
65.42/25.15	It's unfeasible. Removing transition: 
65.42/25.15	<l2, l2, main_i = 25, {main_i -> 29, rest remain the same}>
65.42/25.15	
65.42/25.15	LOG: CALL solverLinear in Graph for feasibility
65.42/25.15	
65.42/25.15	LOG: RETURN solveLinear in Graph for feasibility
65.42/25.15	It's unfeasible. Removing transition: 
65.42/25.15	<l2, l2, 11 <= main_i /\ main_i <= 24, {main_i -> -1 + main_i, rest remain the same}>
65.42/25.15	
65.42/25.15	LOG: CALL solverLinear in Graph for feasibility
65.42/25.15	
65.42/25.15	LOG: RETURN solveLinear in Graph for feasibility
65.42/25.15	It's unfeasible. Removing transition: 
65.42/25.15	<l2, l2, main_i <= 30 /\ 26 <= main_i, {main_i -> -1 + main_i, rest remain the same}>
65.42/25.15	
65.42/25.15	LOG: CALL solverLinear in Graph for feasibility
65.42/25.15	
65.42/25.15	LOG: RETURN solveLinear in Graph for feasibility
65.42/25.15	It's unfeasible. Removing transition: 
65.42/25.15	<l2, l2, 31 <= main_i, {main_i -> 20, rest remain the same}>
65.42/25.15	[ Termination Graph ]
65.42/25.15	Strengthening and disabling transitions...
65.42/25.15	
65.42/25.15	LOG: CALL solverLinear in Graph for feasibility
65.42/25.15	
65.42/25.15	LOG: RETURN solveLinear in Graph for feasibility
65.42/25.15	It's unfeasible. Removing transition: 
65.42/25.15	<l2, l2, main_i = 25, {main_i -> 29, rest remain the same}>
65.42/25.15	
65.42/25.15	LOG: CALL solverLinear in Graph for feasibility
65.42/25.15	
65.42/25.15	LOG: RETURN solveLinear in Graph for feasibility
65.42/25.15	It's unfeasible. Removing transition: 
65.42/25.15	<l2, l2, main_i <= 30 /\ 26 <= main_i, {main_i -> -1 + main_i, rest remain the same}>
65.42/25.15	New Graphs: 
65.42/25.15	
65.42/25.15	LOG: CALL check - Post:main_i <= 6 - Process 1
65.42/25.15	* Exit transition: <l0, l2, main_i = undef2, {all remain the same}>
65.42/25.15	* Postcondition  : main_i <= 6
65.42/25.15	
65.42/25.15	LOG: CALL solveLinear
65.42/25.15	
65.42/25.15	LOG: RETURN solveLinear - Elapsed time: 0.000490s
65.42/25.15	> Postcondition is not implied!
65.42/25.15	
65.42/25.15	LOG: RETURN check - Elapsed time: 0.000572s
65.42/25.15	INVARIANTS: 
65.42/25.15	2: 
65.42/25.15	Quasi-INVARIANTS to narrow Graph: 
65.42/25.15	2: main_i <= 6 , 
65.42/25.15	Narrowing transition: 
65.42/25.15	<l2, l2, main_i = 25, {main_i -> 29, rest remain the same}>
65.42/25.15	
65.42/25.15	LOG: Narrow transition size 1
65.42/25.15	Narrowing transition: 
65.42/25.15	<l2, l2, 11 <= main_i /\ main_i <= 24, {main_i -> -1 + main_i, rest remain the same}>
65.42/25.15	
65.42/25.15	LOG: Narrow transition size 1
65.42/25.15	Narrowing transition: 
65.42/25.15	<l2, l2, main_i <= 30 /\ 26 <= main_i, {main_i -> -1 + main_i, rest remain the same}>
65.42/25.15	
65.42/25.15	LOG: Narrow transition size 1
65.42/25.15	Narrowing transition: 
65.42/25.15	<l2, l2, 31 <= main_i, {main_i -> 20, rest remain the same}>
65.42/25.15	
65.42/25.15	LOG: Narrow transition size 1
65.42/25.15	invGraph after Narrowing: 
65.42/25.15	Transitions:
65.42/25.15	<l2, l2, main_i = 25, {main_i -> 29, rest remain the same}>
65.42/25.15	<l2, l2, 11 <= main_i /\ main_i <= 24, {main_i -> -1 + main_i, rest remain the same}>
65.42/25.15	<l2, l2, main_i <= 30 /\ 26 <= main_i, {main_i -> -1 + main_i, rest remain the same}>
65.42/25.15	<l2, l2, 31 <= main_i, {main_i -> 20, rest remain the same}>
65.42/25.15	Variables:
65.42/25.15	main_i
65.42/25.15	Checking conditional termination of SCC {l2}...
65.42/25.15	
65.42/25.15	LOG: CALL solveLinear
65.42/25.15	
65.42/25.15	LOG: RETURN solveLinear - Elapsed time: 0.001301s
65.42/25.15	
65.42/25.15	LOG: CALL solveLinear
65.42/25.15	
65.42/25.15	LOG: RETURN solveLinear - Elapsed time: 0.011046s
65.42/25.15	Piecewise ranking function: min(-682 + 62*main_i,806)
65.42/25.15	New Graphs: 
65.42/25.15	Transitions:
65.42/25.15	<l2, l2, main_i = 25, {main_i -> 29, rest remain the same}>
65.42/25.15	<l2, l2, main_i <= 30 /\ 26 <= main_i, {main_i -> -1 + main_i, rest remain the same}>
65.42/25.15	Variables:
65.42/25.15	main_i
65.42/25.15	Checking conditional termination of SCC {l2}...
65.42/25.15	
65.42/25.15	LOG: CALL solveLinear
65.42/25.15	
65.42/25.15	LOG: RETURN solveLinear - Elapsed time: 0.000700s
65.42/25.15	
65.42/25.15	LOG: CALL solveLinear
65.42/25.15	
65.42/25.15	LOG: RETURN solveLinear - Elapsed time: 0.010215s
65.42/25.15	[64218 : 64225]
65.42/25.15	[64218 : 64226]
65.42/25.15	Successful child: 64225
65.42/25.15	[ Invariant Graph ]
65.42/25.15	Strengthening and disabling transitions...
65.42/25.15	
65.42/25.15	LOG: CALL solverLinear in Graph for feasibility
65.42/25.15	
65.42/25.15	LOG: RETURN solveLinear in Graph for feasibility
65.42/25.15	It's unfeasible. Removing transition: 
65.42/25.15	<l2, l2, main_i = 25, {main_i -> 29, rest remain the same}>
65.42/25.15	
65.42/25.15	LOG: CALL solverLinear in Graph for feasibility
65.42/25.15	
65.42/25.15	LOG: RETURN solveLinear in Graph for feasibility
65.42/25.15	Strengthening transition (result): 
65.42/25.15	<l2, l2, 11 <= main_i /\ main_i <= 18, {main_i -> -1 + main_i, rest remain the same}>
65.42/25.15	
65.42/25.15	LOG: CALL solverLinear in Graph for feasibility
65.42/25.15	
65.42/25.15	LOG: RETURN solveLinear in Graph for feasibility
65.42/25.15	It's unfeasible. Removing transition: 
65.42/25.15	<l2, l2, main_i <= 30 /\ 26 <= main_i, {main_i -> -1 + main_i, rest remain the same}>
65.42/25.15	
65.42/25.15	LOG: CALL solverLinear in Graph for feasibility
65.42/25.15	
65.42/25.15	LOG: RETURN solveLinear in Graph for feasibility
65.42/25.15	It's unfeasible. Removing transition: 
65.42/25.15	<l2, l2, 31 <= main_i, {main_i -> 20, rest remain the same}>
65.42/25.15	[ Termination Graph ]
65.42/25.15	Strengthening and disabling transitions...
65.42/25.15	
65.42/25.15	LOG: CALL solverLinear in Graph for feasibility
65.42/25.15	
65.42/25.15	LOG: RETURN solveLinear in Graph for feasibility
65.42/25.15	It's unfeasible. Removing transition: 
65.42/25.15	<l2, l2, main_i = 25, {main_i -> 29, rest remain the same}>
65.42/25.15	
65.42/25.15	LOG: CALL solverLinear in Graph for feasibility
65.42/25.15	
65.42/25.15	LOG: RETURN solveLinear in Graph for feasibility
65.42/25.15	It's unfeasible. Removing transition: 
65.42/25.15	<l2, l2, main_i <= 30 /\ 26 <= main_i, {main_i -> -1 + main_i, rest remain the same}>
65.42/25.15	New Graphs: 
65.42/25.15	
65.42/25.15	LOG: CALL check - Post:main_i <= 18 - Process 2
65.42/25.15	* Exit transition: <l0, l2, 7 <= main_i /\ main_i = undef2, {all remain the same}>
65.42/25.15	* Postcondition  : main_i <= 18
65.42/25.15	
65.42/25.15	LOG: CALL solveLinear
65.42/25.15	
65.42/25.15	LOG: RETURN solveLinear - Elapsed time: 0.000473s
65.42/25.15	> Postcondition is not implied!
65.42/25.15	
65.42/25.15	LOG: RETURN check - Elapsed time: 0.000564s
65.42/25.15	INVARIANTS: 
65.42/25.15	2: 
65.42/25.15	Quasi-INVARIANTS to narrow Graph: 
65.42/25.15	2: main_i <= 18 , 
65.42/25.15	Narrowing transition: 
65.42/25.15	<l2, l2, main_i = 25, {main_i -> 29, rest remain the same}>
65.42/25.15	
65.42/25.15	LOG: Narrow transition size 1
65.42/25.15	Narrowing transition: 
65.42/25.15	<l2, l2, 11 <= main_i /\ main_i <= 24, {main_i -> -1 + main_i, rest remain the same}>
65.42/25.15	
65.42/25.15	LOG: Narrow transition size 1
65.42/25.15	Narrowing transition: 
65.42/25.15	<l2, l2, main_i <= 30 /\ 26 <= main_i, {main_i -> -1 + main_i, rest remain the same}>
65.42/25.15	
65.42/25.15	LOG: Narrow transition size 1
65.42/25.15	Narrowing transition: 
65.42/25.15	<l2, l2, 31 <= main_i, {main_i -> 20, rest remain the same}>
65.42/25.15	
65.42/25.15	LOG: Narrow transition size 1
65.42/25.15	invGraph after Narrowing: 
65.42/25.15	Transitions:
65.42/25.15	<l2, l2, main_i = 25, {main_i -> 29, rest remain the same}>
65.42/25.15	<l2, l2, main_i <= 24 /\ 19 <= main_i, {main_i -> -1 + main_i, rest remain the same}>
65.42/25.15	<l2, l2, main_i <= 30 /\ 26 <= main_i, {main_i -> -1 + main_i, rest remain the same}>
65.42/25.15	<l2, l2, 31 <= main_i, {main_i -> 20, rest remain the same}>
65.42/25.15	Variables:
65.42/25.15	main_i
65.42/25.15	Checking conditional termination of SCC {l2}...
65.42/25.15	
65.42/25.15	LOG: CALL solveLinear
65.42/25.15	
65.42/25.15	LOG: RETURN solveLinear - Elapsed time: 0.001317s
65.42/25.15	
65.42/25.15	LOG: CALL solveLinear
65.42/25.15	
65.42/25.15	LOG: RETURN solveLinear - Elapsed time: 0.012217s
65.42/25.15	Piecewise ranking function: min(-1026 + 54*main_i,270)
65.42/25.15	New Graphs: 
65.42/25.15	Transitions:
65.42/25.15	<l2, l2, main_i = 25, {main_i -> 29, rest remain the same}>
65.42/25.15	<l2, l2, main_i <= 30 /\ 26 <= main_i, {main_i -> -1 + main_i, rest remain the same}>
65.42/25.15	Variables:
65.42/25.15	main_i
65.42/25.15	Checking conditional termination of SCC {l2}...
65.42/25.15	
65.42/25.15	LOG: CALL solveLinear
65.42/25.15	
65.42/25.15	LOG: RETURN solveLinear - Elapsed time: 0.000701s
65.42/25.15	
65.42/25.15	LOG: CALL solveLinear
65.42/25.15	
65.42/25.15	LOG: RETURN solveLinear - Elapsed time: 0.010225s
65.42/25.15	[64218 : 64230]
65.42/25.15	[64218 : 64231]
65.42/25.15	Successful child: 64230
65.42/25.15	[ Invariant Graph ]
65.42/25.15	Strengthening and disabling transitions...
65.42/25.15	
65.42/25.15	LOG: CALL solverLinear in Graph for feasibility
65.42/25.15	
65.42/25.15	LOG: RETURN solveLinear in Graph for feasibility
65.42/25.15	It's unfeasible. Removing transition: 
65.42/25.15	<l2, l2, main_i = 25, {main_i -> 29, rest remain the same}>
65.42/25.15	
65.42/25.15	LOG: CALL solverLinear in Graph for feasibility
65.42/25.15	
65.42/25.15	LOG: RETURN solveLinear in Graph for feasibility
65.42/25.15	Strengthening transition (result): 
65.42/25.15	<l2, l2, 19 <= main_i /\ main_i <= 21, {main_i -> -1 + main_i, rest remain the same}>
65.42/25.15	
65.42/25.15	LOG: CALL solverLinear in Graph for feasibility
65.42/25.15	
65.42/25.15	LOG: RETURN solveLinear in Graph for feasibility
65.42/25.15	It's unfeasible. Removing transition: 
65.42/25.15	<l2, l2, main_i <= 30 /\ 26 <= main_i, {main_i -> -1 + main_i, rest remain the same}>
65.42/25.15	
65.42/25.15	LOG: CALL solverLinear in Graph for feasibility
65.42/25.15	
65.42/25.15	LOG: RETURN solveLinear in Graph for feasibility
65.42/25.15	It's unfeasible. Removing transition: 
65.42/25.15	<l2, l2, 31 <= main_i, {main_i -> 20, rest remain the same}>
65.42/25.15	[ Termination Graph ]
65.42/25.15	Strengthening and disabling transitions...
65.42/25.15	
65.42/25.15	LOG: CALL solverLinear in Graph for feasibility
65.42/25.15	
65.42/25.15	LOG: RETURN solveLinear in Graph for feasibility
65.42/25.15	It's unfeasible. Removing transition: 
65.42/25.15	<l2, l2, main_i = 25, {main_i -> 29, rest remain the same}>
65.42/25.15	
65.42/25.15	LOG: CALL solverLinear in Graph for feasibility
65.42/25.15	
65.42/25.15	LOG: RETURN solveLinear in Graph for feasibility
65.42/25.15	It's unfeasible. Removing transition: 
65.42/25.15	<l2, l2, main_i <= 30 /\ 26 <= main_i, {main_i -> -1 + main_i, rest remain the same}>
65.42/25.15	New Graphs: 
65.42/25.15	
65.42/25.15	LOG: CALL check - Post:main_i <= 21 - Process 3
65.42/25.15	* Exit transition: <l0, l2, 19 <= main_i /\ main_i = undef2, {all remain the same}>
65.42/25.15	* Postcondition  : main_i <= 21
65.42/25.15	
65.42/25.15	LOG: CALL solveLinear
65.42/25.15	
65.42/25.15	LOG: RETURN solveLinear - Elapsed time: 0.000494s
65.42/25.15	> Postcondition is not implied!
65.42/25.15	
65.42/25.15	LOG: RETURN check - Elapsed time: 0.000584s
65.42/25.15	INVARIANTS: 
65.42/25.15	2: 
65.42/25.15	Quasi-INVARIANTS to narrow Graph: 
65.42/25.15	2: main_i <= 21 , 
65.42/25.15	Narrowing transition: 
65.42/25.15	<l2, l2, main_i = 25, {main_i -> 29, rest remain the same}>
65.42/25.15	
65.42/25.15	LOG: Narrow transition size 1
65.42/25.15	Narrowing transition: 
65.42/25.15	<l2, l2, main_i <= 24 /\ 19 <= main_i, {main_i -> -1 + main_i, rest remain the same}>
65.42/25.15	
65.42/25.15	LOG: Narrow transition size 1
65.42/25.15	Narrowing transition: 
65.42/25.15	<l2, l2, main_i <= 30 /\ 26 <= main_i, {main_i -> -1 + main_i, rest remain the same}>
65.42/25.15	
65.42/25.15	LOG: Narrow transition size 1
65.42/25.15	It's unfeasible. Removing transition: 
65.42/25.15	<l2, l2, 31 <= main_i, {main_i -> 20, rest remain the same}>
65.42/25.15	invGraph after Narrowing: 
65.42/25.15	Transitions:
65.42/25.15	<l2, l2, main_i = 25, {main_i -> 29, rest remain the same}>
65.42/25.15	<l2, l2, main_i <= 24 /\ 22 <= main_i, {main_i -> -1 + main_i, rest remain the same}>
65.42/25.15	<l2, l2, main_i <= 30 /\ 26 <= main_i, {main_i -> -1 + main_i, rest remain the same}>
65.42/25.15	Variables:
65.42/25.15	main_i
65.42/25.15	Checking conditional termination of SCC {l2}...
65.42/25.15	
65.42/25.15	LOG: CALL solveLinear
65.42/25.15	
65.42/25.15	LOG: RETURN solveLinear - Elapsed time: 0.000990s
65.42/25.15	
65.42/25.15	LOG: CALL solveLinear
65.42/25.15	
65.42/25.15	LOG: RETURN solveLinear - Elapsed time: 0.022408s
65.42/25.15	Piecewise ranking function: min(62,-682 + 31*main_i)
65.42/25.15	New Graphs: 
65.42/25.15	Transitions:
65.42/25.15	<l2, l2, main_i = 25, {main_i -> 29, rest remain the same}>
65.42/25.15	<l2, l2, main_i <= 30 /\ 26 <= main_i, {main_i -> -1 + main_i, rest remain the same}>
65.42/25.15	Variables:
65.42/25.15	main_i
65.42/25.15	Checking conditional termination of SCC {l2}...
65.42/25.15	
65.42/25.15	LOG: CALL solveLinear
65.42/25.15	
65.42/25.15	LOG: RETURN solveLinear - Elapsed time: 0.000695s
65.42/25.15	
65.42/25.15	LOG: CALL solveLinear
65.42/25.15	
65.42/25.15	LOG: RETURN solveLinear - Elapsed time: 0.010213s
65.42/25.15	[64218 : 64235]
65.42/25.15	[64218 : 64236]
65.42/25.15	Successful child: 64235
65.42/25.15	[ Invariant Graph ]
65.42/25.15	Strengthening and disabling transitions...
65.42/25.15	
65.42/25.15	LOG: CALL solverLinear in Graph for feasibility
65.42/25.15	
65.42/25.15	LOG: RETURN solveLinear in Graph for feasibility
65.42/25.15	It's unfeasible. Removing transition: 
65.42/25.15	<l2, l2, main_i = 25, {main_i -> 29, rest remain the same}>
65.42/25.15	
65.42/25.15	LOG: CALL solverLinear in Graph for feasibility
65.42/25.15	
65.42/25.15	LOG: RETURN solveLinear in Graph for feasibility
65.42/25.15	Strengthening transition (result): 
65.42/25.15	<l2, l2, main_i = 22, {main_i -> -1 + main_i, rest remain the same}>
65.42/25.15	
65.42/25.15	LOG: CALL solverLinear in Graph for feasibility
65.42/25.15	
65.42/25.15	LOG: RETURN solveLinear in Graph for feasibility
65.42/25.15	It's unfeasible. Removing transition: 
65.42/25.15	<l2, l2, main_i <= 30 /\ 26 <= main_i, {main_i -> -1 + main_i, rest remain the same}>
65.42/25.15	[ Termination Graph ]
65.42/25.15	Strengthening and disabling transitions...
65.42/25.15	
65.42/25.15	LOG: CALL solverLinear in Graph for feasibility
65.42/25.15	
65.42/25.15	LOG: RETURN solveLinear in Graph for feasibility
65.42/25.15	It's unfeasible. Removing transition: 
65.42/25.15	<l2, l2, main_i = 25, {main_i -> 29, rest remain the same}>
65.42/25.15	
65.42/25.15	LOG: CALL solverLinear in Graph for feasibility
65.42/25.15	
65.42/25.15	LOG: RETURN solveLinear in Graph for feasibility
65.42/25.15	It's unfeasible. Removing transition: 
65.42/25.15	<l2, l2, main_i <= 30 /\ 26 <= main_i, {main_i -> -1 + main_i, rest remain the same}>
65.42/25.15	New Graphs: 
65.42/25.15	
65.42/25.15	LOG: CALL check - Post:main_i <= 22 - Process 4
65.42/25.15	* Exit transition: <l0, l2, 22 <= main_i /\ main_i = undef2, {all remain the same}>
65.42/25.15	* Postcondition  : main_i <= 22
65.42/25.15	
65.42/25.15	LOG: CALL solveLinear
65.42/25.15	
65.42/25.15	LOG: RETURN solveLinear - Elapsed time: 0.000511s
65.42/25.15	> Postcondition is not implied!
65.42/25.15	
65.42/25.15	LOG: RETURN check - Elapsed time: 0.000598s
65.42/25.15	INVARIANTS: 
65.42/25.15	2: 
65.42/25.15	Quasi-INVARIANTS to narrow Graph: 
65.42/25.15	2: main_i <= 22 , 
65.42/25.15	Narrowing transition: 
65.42/25.15	<l2, l2, main_i = 25, {main_i -> 29, rest remain the same}>
65.42/25.15	
65.42/25.15	LOG: Narrow transition size 1
65.42/25.15	Narrowing transition: 
65.42/25.15	<l2, l2, main_i <= 24 /\ 22 <= main_i, {main_i -> -1 + main_i, rest remain the same}>
65.42/25.15	
65.42/25.15	LOG: Narrow transition size 1
65.42/25.15	Narrowing transition: 
65.42/25.15	<l2, l2, main_i <= 30 /\ 26 <= main_i, {main_i -> -1 + main_i, rest remain the same}>
65.42/25.15	
65.42/25.15	LOG: Narrow transition size 1
65.42/25.15	invGraph after Narrowing: 
65.42/25.15	Transitions:
65.42/25.15	<l2, l2, main_i = 25, {main_i -> 29, rest remain the same}>
65.42/25.15	<l2, l2, main_i <= 24 /\ 23 <= main_i, {main_i -> -1 + main_i, rest remain the same}>
65.42/25.15	<l2, l2, main_i <= 30 /\ 26 <= main_i, {main_i -> -1 + main_i, rest remain the same}>
65.42/25.15	Variables:
65.42/25.15	main_i
65.42/25.15	Checking conditional termination of SCC {l2}...
65.42/25.15	
65.42/25.15	LOG: CALL solveLinear
65.42/25.15	
65.42/25.15	LOG: RETURN solveLinear - Elapsed time: 0.001007s
65.42/25.15	
65.42/25.15	LOG: CALL solveLinear
65.42/25.15	
65.42/25.15	LOG: RETURN solveLinear - Elapsed time: 0.019453s
65.42/25.15	Piecewise ranking function: min(54,-621 + 27*main_i)
65.42/25.15	New Graphs: 
65.42/25.15	Transitions:
65.42/25.15	<l2, l2, main_i = 25, {main_i -> 29, rest remain the same}>
65.42/25.15	<l2, l2, main_i <= 30 /\ 26 <= main_i, {main_i -> -1 + main_i, rest remain the same}>
65.42/25.15	Variables:
65.42/25.15	main_i
65.42/25.15	Checking conditional termination of SCC {l2}...
65.42/25.15	
65.42/25.15	LOG: CALL solveLinear
65.42/25.15	
65.42/25.15	LOG: RETURN solveLinear - Elapsed time: 0.000708s
65.42/25.15	
65.42/25.15	LOG: CALL solveLinear
65.42/25.15	
65.42/25.15	LOG: RETURN solveLinear - Elapsed time: 0.010241s
65.42/25.15	[64218 : 64240]
65.42/25.15	[64218 : 64241]
65.42/25.15	Successful child: 64240
65.42/25.15	[ Invariant Graph ]
65.42/25.15	Strengthening and disabling transitions...
65.42/25.15	
65.42/25.15	LOG: CALL solverLinear in Graph for feasibility
65.42/25.15	
65.42/25.15	LOG: RETURN solveLinear in Graph for feasibility
65.42/25.15	It's unfeasible. Removing transition: 
65.42/25.15	<l2, l2, main_i = 25, {main_i -> 29, rest remain the same}>
65.42/25.15	
65.42/25.15	LOG: CALL solverLinear in Graph for feasibility
65.42/25.15	
65.42/25.15	LOG: RETURN solveLinear in Graph for feasibility
65.42/25.15	Strengthening transition (result): 
65.42/25.15	<l2, l2, main_i = 23, {main_i -> -1 + main_i, rest remain the same}>
65.42/25.15	
65.42/25.15	LOG: CALL solverLinear in Graph for feasibility
65.42/25.15	
65.42/25.15	LOG: RETURN solveLinear in Graph for feasibility
65.42/25.15	It's unfeasible. Removing transition: 
65.42/25.15	<l2, l2, main_i <= 30 /\ 26 <= main_i, {main_i -> -1 + main_i, rest remain the same}>
65.42/25.15	[ Termination Graph ]
65.42/25.15	Strengthening and disabling transitions...
65.42/25.15	
65.42/25.15	LOG: CALL solverLinear in Graph for feasibility
65.42/25.15	
65.42/25.15	LOG: RETURN solveLinear in Graph for feasibility
65.42/25.15	It's unfeasible. Removing transition: 
65.42/25.15	<l2, l2, main_i = 25, {main_i -> 29, rest remain the same}>
65.42/25.15	
65.42/25.15	LOG: CALL solverLinear in Graph for feasibility
65.42/25.15	
65.42/25.15	LOG: RETURN solveLinear in Graph for feasibility
65.42/25.15	It's unfeasible. Removing transition: 
65.42/25.15	<l2, l2, main_i <= 30 /\ 26 <= main_i, {main_i -> -1 + main_i, rest remain the same}>
65.42/25.15	New Graphs: 
65.42/25.15	
65.42/25.15	LOG: CALL check - Post:main_i <= 23 - Process 5
65.42/25.15	* Exit transition: <l0, l2, 23 <= main_i /\ main_i = undef2, {all remain the same}>
65.42/25.15	* Postcondition  : main_i <= 23
65.42/25.15	
65.42/25.15	LOG: CALL solveLinear
65.42/25.15	
65.42/25.15	LOG: RETURN solveLinear - Elapsed time: 0.000527s
65.42/25.15	> Postcondition is not implied!
65.42/25.15	
65.42/25.15	LOG: RETURN check - Elapsed time: 0.000618s
65.42/25.15	INVARIANTS: 
65.42/25.15	2: 
65.42/25.15	Quasi-INVARIANTS to narrow Graph: 
65.42/25.15	2: main_i <= 23 , 
65.42/25.15	Narrowing transition: 
65.42/25.15	<l2, l2, main_i = 25, {main_i -> 29, rest remain the same}>
65.42/25.15	
65.42/25.15	LOG: Narrow transition size 1
65.42/25.15	It's unfeasible. Removing transition: 
65.42/25.15	<l2, l2, main_i <= 24 /\ 23 <= main_i, {main_i -> -1 + main_i, rest remain the same}>
65.42/25.15	Narrowing transition: 
65.42/25.15	<l2, l2, main_i <= 30 /\ 26 <= main_i, {main_i -> -1 + main_i, rest remain the same}>
65.42/25.15	
65.42/25.15	LOG: Narrow transition size 1
65.42/25.15	invGraph after Narrowing: 
65.42/25.15	Transitions:
65.42/25.15	<l2, l2, main_i = 25, {main_i -> 29, rest remain the same}>
65.42/25.15	<l2, l2, main_i <= 30 /\ 26 <= main_i, {main_i -> -1 + main_i, rest remain the same}>
65.42/25.15	Variables:
65.42/25.15	main_i
65.42/25.15	Checking conditional termination of SCC {l2}...
65.42/25.15	
65.42/25.15	LOG: CALL solveLinear
65.42/25.15	
65.42/25.15	LOG: RETURN solveLinear - Elapsed time: 0.000770s
65.42/25.15	
65.42/25.15	LOG: CALL solveLinear
65.42/25.15	
65.42/25.15	LOG: RETURN solveLinear - Elapsed time: 0.010349s
65.42/25.15	[64218 : 64245]
65.42/25.15	[64218 : 64246]
65.42/25.15	Successful child: 64245
65.42/25.15	[ Invariant Graph ]
65.42/25.15	Strengthening and disabling transitions...
65.42/25.15	
65.42/25.15	LOG: CALL solverLinear in Graph for feasibility
65.42/25.15	
65.42/25.15	LOG: RETURN solveLinear in Graph for feasibility
65.42/25.15	It's unfeasible. Removing transition: 
65.42/25.15	<l2, l2, main_i = 25, {main_i -> 29, rest remain the same}>
65.42/25.15	
65.42/25.15	LOG: CALL solverLinear in Graph for feasibility
65.42/25.15	
65.42/25.15	LOG: RETURN solveLinear in Graph for feasibility
65.42/25.15	It's unfeasible. Removing transition: 
65.42/25.15	<l2, l2, main_i <= 30 /\ 26 <= main_i, {main_i -> -1 + main_i, rest remain the same}>
65.42/25.15	[ Termination Graph ]
65.42/25.15	Strengthening and disabling transitions...
65.42/25.15	
65.42/25.15	LOG: CALL solverLinear in Graph for feasibility
65.42/25.15	
65.42/25.15	LOG: RETURN solveLinear in Graph for feasibility
65.42/25.15	It's unfeasible. Removing transition: 
65.42/25.15	<l2, l2, main_i = 25, {main_i -> 29, rest remain the same}>
65.42/25.15	
65.42/25.15	LOG: CALL solverLinear in Graph for feasibility
65.42/25.15	
65.42/25.15	LOG: RETURN solveLinear in Graph for feasibility
65.42/25.15	It's unfeasible. Removing transition: 
65.42/25.15	<l2, l2, main_i <= 30 /\ 26 <= main_i, {main_i -> -1 + main_i, rest remain the same}>
65.42/25.15	New Graphs: 
65.42/25.15	
65.42/25.15	LOG: CALL check - Post:main_i <= 24 - Process 6
65.42/25.15	* Exit transition: <l0, l2, 24 <= main_i /\ main_i = undef2, {all remain the same}>
65.42/25.15	* Postcondition  : main_i <= 24
65.42/25.15	
65.42/25.15	LOG: CALL solveLinear
65.42/25.15	
65.42/25.15	LOG: RETURN solveLinear - Elapsed time: 0.000647s
65.42/25.15	> Postcondition is not implied!
65.42/25.15	
65.42/25.15	LOG: RETURN check - Elapsed time: 0.000738s
65.42/25.15	INVARIANTS: 
65.42/25.15	2: 
65.42/25.15	Quasi-INVARIANTS to narrow Graph: 
65.42/25.15	2: main_i <= 24 , 
65.42/25.15	Narrowing transition: 
65.42/25.15	<l2, l2, main_i = 25, {main_i -> 29, rest remain the same}>
65.42/25.15	
65.42/25.15	LOG: Narrow transition size 1
65.42/25.15	Narrowing transition: 
65.42/25.15	<l2, l2, main_i <= 30 /\ 26 <= main_i, {main_i -> -1 + main_i, rest remain the same}>
65.42/25.15	
65.42/25.15	LOG: Narrow transition size 1
65.42/25.15	invGraph after Narrowing: 
65.42/25.15	Transitions:
65.42/25.15	<l2, l2, main_i = 25, {main_i -> 29, rest remain the same}>
65.42/25.15	<l2, l2, main_i <= 30 /\ 26 <= main_i, {main_i -> -1 + main_i, rest remain the same}>
65.42/25.15	Variables:
65.42/25.15	main_i
65.42/25.15	Checking conditional termination of SCC {l2}...
65.42/25.15	
65.42/25.15	LOG: CALL solveLinear
65.42/25.15	
65.42/25.15	LOG: RETURN solveLinear - Elapsed time: 0.000768s
65.42/25.15	
65.42/25.15	LOG: CALL solveLinear
65.42/25.15	
65.42/25.15	LOG: RETURN solveLinear - Elapsed time: 0.010420s
65.42/25.15	[64218 : 64251]
65.42/25.15	[64218 : 64252]
65.42/25.15	Successful child: 64251
65.42/25.15	[ Invariant Graph ]
65.42/25.15	Strengthening and disabling transitions...
65.42/25.15	
65.42/25.15	LOG: CALL solverLinear in Graph for feasibility
65.42/25.15	
65.42/25.15	LOG: RETURN solveLinear in Graph for feasibility
65.42/25.15	It's unfeasible. Removing transition: 
65.42/25.15	<l2, l2, main_i = 25, {main_i -> 29, rest remain the same}>
65.42/25.15	
65.42/25.15	LOG: CALL solverLinear in Graph for feasibility
65.42/25.15	
65.42/25.15	LOG: RETURN solveLinear in Graph for feasibility
65.42/25.15	It's unfeasible. Removing transition: 
65.42/25.15	<l2, l2, main_i <= 30 /\ 26 <= main_i, {main_i -> -1 + main_i, rest remain the same}>
65.42/25.15	[ Termination Graph ]
65.42/25.15	Strengthening and disabling transitions...
65.42/25.15	
65.42/25.15	LOG: CALL solverLinear in Graph for feasibility
65.42/25.15	
65.42/25.15	LOG: RETURN solveLinear in Graph for feasibility
65.42/25.15	It's unfeasible. Removing transition: 
65.42/25.15	<l2, l2, main_i = 25, {main_i -> 29, rest remain the same}>
65.42/25.15	
65.42/25.15	LOG: CALL solverLinear in Graph for feasibility
65.42/25.15	
65.42/25.15	LOG: RETURN solveLinear in Graph for feasibility
65.42/25.15	It's unfeasible. Removing transition: 
65.42/25.15	<l2, l2, main_i <= 30 /\ 26 <= main_i, {main_i -> -1 + main_i, rest remain the same}>
65.42/25.15	New Graphs: 
65.42/25.15	
65.42/25.15	LOG: CALL check - Post:31 <= main_i - Process 7
65.42/25.15	* Exit transition: <l0, l2, 25 <= main_i /\ main_i = undef2, {all remain the same}>
65.42/25.15	* Postcondition  : 31 <= main_i
65.42/25.15	
65.42/25.15	LOG: CALL solveLinear
65.42/25.15	
65.42/25.15	LOG: RETURN solveLinear - Elapsed time: 0.000659s
65.42/25.15	> Postcondition is not implied!
65.42/25.15	
65.42/25.15	LOG: RETURN check - Elapsed time: 0.000748s
65.42/25.15	INVARIANTS: 
65.42/25.15	2: 
65.42/25.15	Quasi-INVARIANTS to narrow Graph: 
65.42/25.15	2: 31 <= main_i , 
65.42/25.15	Narrowing transition: 
65.42/25.15	<l2, l2, main_i = 25, {main_i -> 29, rest remain the same}>
65.42/25.15	
65.42/25.15	LOG: Narrow transition size 1
65.42/25.15	Narrowing transition: 
65.42/25.15	<l2, l2, main_i <= 30 /\ 26 <= main_i, {main_i -> -1 + main_i, rest remain the same}>
65.42/25.15	
65.42/25.15	LOG: Narrow transition size 1
65.42/25.15	invGraph after Narrowing: 
65.42/25.15	Transitions:
65.42/25.15	<l2, l2, main_i = 25, {main_i -> 29, rest remain the same}>
65.42/25.15	<l2, l2, main_i <= 30 /\ 26 <= main_i, {main_i -> -1 + main_i, rest remain the same}>
65.42/25.15	Variables:
65.42/25.15	main_i
65.42/25.15	Checking conditional termination of SCC {l2}...
65.42/25.15	
65.42/25.15	LOG: CALL solveLinear
65.42/25.15	
65.42/25.15	LOG: RETURN solveLinear - Elapsed time: 0.000773s
65.42/25.15	
65.42/25.15	LOG: CALL solveLinear
65.42/25.15	
65.42/25.15	LOG: RETURN solveLinear - Elapsed time: 0.010392s
65.42/25.15	[64218 : 64256]
65.42/25.15	[64218 : 64257]
65.42/25.15	Solving with 1 template(s).
65.42/25.15	
65.42/25.15	LOG: CALL solveNonLinearGetFirstSolution
65.42/25.15	
65.42/25.15	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.101967s
65.42/25.15	Time used: 4.1014
65.42/25.15	
65.42/25.15	[64218 : 64261]
65.42/25.15	[64218 : 64264]
65.42/25.15	Successful child: 64264
65.42/25.15	
65.42/25.15	Program does NOT terminate
65.42/25.15	EOF