28.17/10.26	NO
28.17/10.26	
28.17/10.26	Solver Timeout: 4
28.17/10.26	Global Timeout: 300
28.17/10.26	Maximum number of concurrent processes: 900
28.17/10.26	*******************************************************************************************
28.17/10.26	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
28.17/10.26	*******************************************************************************************
28.17/10.26	
28.17/10.26	
28.17/10.26	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
28.17/10.26	
28.17/10.26	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
28.17/10.26	+                                                                  +
28.17/10.26	Init Location: 0
28.17/10.26	Transitions:
28.17/10.26	<l0, l1, true, seq{main__func_return_ -> 0}>
28.17/10.26	<l1, l2, true>
28.17/10.26	<l2, l18, (main_x = 0)>
28.17/10.26	<l2, l3, not((main_x = 0))>
28.17/10.26	<l3, l15, not((~(5) <= main_x))>
28.17/10.26	<l3, l4, (~(5) <= main_x)>
28.17/10.26	<l4, l5, (main_x <= 35)>
28.17/10.26	<l4, l15, not((main_x <= 35))>
28.17/10.26	<l5, l6, (main_x < 0)>
28.17/10.26	<l5, l8, not((main_x < 0))>
28.17/10.26	<l6, l7, true, seq{main_x -> ~(5)}>
28.17/10.26	<l7, l14, true>
28.17/10.26	<l8, l9, (main_x > 30)>
28.17/10.26	<l8, l11, not((main_x > 30))>
28.17/10.26	<l9, l10, true, seq{main_x -> 35}>
28.17/10.26	<l10, l13, true>
28.17/10.26	<l11, l12, true, seq{main_x -> (main_x - 1)}>
28.17/10.26	<l12, l13, true>
28.17/10.26	<l13, l14, true>
28.17/10.26	<l14, l17, true>
28.17/10.26	<l15, l16, true, seq{main_x -> 0}>
28.17/10.26	<l16, l17, true>
28.17/10.26	<l17, l2, true>
28.17/10.26	<l18, l19, true, seq{main__func_return_ -> 0}>
28.17/10.26	
28.17/10.26	Fresh variables:
28.17/10.26	
28.17/10.26	Undef variables:
28.17/10.26	
28.17/10.26	Abstraction variables:
28.17/10.26	
28.17/10.26	Exit nodes:
28.17/10.26	
28.17/10.26	Accepting locations:
28.17/10.26	
28.17/10.26	Asserts:
28.17/10.26	
28.17/10.26	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
28.17/10.26	       
28.17/10.26	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
28.17/10.26	       
28.17/10.26	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
28.17/10.26	
28.17/10.26	Init Location: 0
28.17/10.26	Transitions:
28.17/10.26	<l0, l1, true, seq{main__func_return_ -> 0}>
28.17/10.26	<l1, l2, true>
28.17/10.26	<l2, l18, (main_x = 0)>
28.17/10.26	<l2, l3, not((main_x = 0))>
28.17/10.26	<l3, l4, (~(5) <= main_x)>
28.17/10.26	<l3, l15, not((~(5) <= main_x))>
28.17/10.26	<l4, l5, (main_x <= 35)>
28.17/10.26	<l4, l15, not((main_x <= 35))>
28.17/10.26	<l5, l6, (main_x < 0)>
28.17/10.26	<l5, l8, not((main_x < 0))>
28.17/10.26	<l6, l7, true, seq{main_x -> ~(5)}>
28.17/10.26	<l7, l14, true>
28.17/10.26	<l8, l9, (main_x > 30)>
28.17/10.26	<l8, l11, not((main_x > 30))>
28.17/10.26	<l9, l10, true, seq{main_x -> 35}>
28.17/10.26	<l10, l13, true>
28.17/10.26	<l11, l12, true, seq{main_x -> (main_x - 1)}>
28.17/10.26	<l12, l13, true>
28.17/10.26	<l13, l14, true>
28.17/10.26	<l14, l17, true>
28.17/10.26	<l15, l16, true, seq{main_x -> 0}>
28.17/10.26	<l16, l17, true>
28.17/10.26	<l17, l2, true>
28.17/10.26	<l18, l19, true, seq{main__func_return_ -> 0}>
28.17/10.26	
28.17/10.26	Fresh variables:
28.17/10.26	
28.17/10.26	Undef variables:
28.17/10.26	
28.17/10.26	Abstraction variables:
28.17/10.26	
28.17/10.26	Exit nodes:
28.17/10.26	19, 
28.17/10.26	Accepting locations:
28.17/10.26	
28.17/10.26	Asserts:
28.17/10.26	
28.17/10.26	+                                                                  +
28.17/10.26	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
28.17/10.26	
28.17/10.26	
28.17/10.26	Function Return and Parameters Information [1 functions]:
28.17/10.26	    function name: main [1 return + 0 parameters]        demangled: main
28.17/10.26	        main__func_return_      [function result] : int
28.17/10.26	
28.17/10.26	
28.17/10.26	AST Ident Scanner Information [3 idents]:
28.17/10.26	__VERIFIER_nondet_int | function | [integer, ()] | <line: 10, col: 1>
28.17/10.26	main | function | [integer, ()] | <line: 12, col: 1>
28.17/10.26	x | local variable | integer | <line: 13, col: 2> | <line: 14, col: 9> <line: 15, col: 16> <line: 15, col: 21> <line: 16, col: 11> <line: 17, col: 8> <line: 19, col: 12> <line: 20, col: 9> <line: 22, col: 6> <line: 22, col: 10> <line: 26, col: 7>
28.17/10.26	
28.17/10.26	Main function: main
28.17/10.26	Preprocessed LLVMGraph
28.17/10.26	Init Location: 0
28.17/10.26	Transitions:
28.17/10.26	<l0, l2, true>
28.17/10.26	<l2, l19, (main_x = 0)>
28.17/10.26	<l2, l2, (main_x < 0) /\ (~(5) <= main_x) /\ (main_x <= 35) /\ (main_x < 0), par{main_x -> ~(5)}>
28.17/10.26	<l2, l2, (main_x < 0) /\ not((~(5) <= main_x)), par{main_x -> 0}>
28.17/10.26	<l2, l2, (main_x > 0) /\ (~(5) <= main_x) /\ (main_x <= 35) /\ not((main_x < 0)) /\ (main_x > 30), par{main_x -> 35}>
28.17/10.26	<l2, l2, (main_x > 0) /\ (~(5) <= main_x) /\ (main_x <= 35) /\ not((main_x < 0)) /\ not((main_x > 30)), par{main_x -> (main_x - 1)}>
28.17/10.26	<l2, l2, (main_x > 0) /\ (~(5) <= main_x) /\ not((main_x <= 35)), par{main_x -> 0}>
28.17/10.26	
28.17/10.26	Fresh variables:
28.17/10.26	
28.17/10.26	Undef variables:
28.17/10.26	
28.17/10.26	Abstraction variables:
28.17/10.26	
28.17/10.26	Exit nodes:
28.17/10.26	19, 
28.17/10.26	Accepting locations:
28.17/10.26	
28.17/10.26	Asserts:
28.17/10.26	
28.17/10.26	*************************************************************
28.17/10.26	*******************************************************************************************
28.17/10.26	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
28.17/10.26	*******************************************************************************************
28.17/10.26	
28.17/10.26	Init Location: 0
28.17/10.26	Graph 0:
28.17/10.26	Transitions:
28.17/10.26	Variables:
28.17/10.26	
28.17/10.26	Graph 1:
28.17/10.26	Transitions:
28.17/10.26	<l2, l2, 0 <= 5 + main_x /\ 1 + main_x <= 0, {main_x -> -5, rest remain the same}>
28.17/10.26	<l2, l2, 6 + main_x <= 0, {main_x -> 0, rest remain the same}>
28.17/10.26	<l2, l2, main_x <= 35 /\ 31 <= main_x, {main_x -> 35, rest remain the same}>
28.17/10.26	<l2, l2, 1 <= main_x /\ main_x <= 30, {main_x -> -1 + main_x, rest remain the same}>
28.17/10.26	<l2, l2, 36 <= main_x, {main_x -> 0, rest remain the same}>
28.17/10.26	Variables:
28.17/10.26	main_x
28.17/10.26	
28.17/10.26	Graph 2:
28.17/10.26	Transitions:
28.17/10.26	Variables:
28.17/10.26	
28.17/10.26	Precedence: 
28.17/10.26	Graph 0
28.17/10.26	
28.17/10.26	Graph 1
28.17/10.26	<l0, l2, true, {all remain the same}>
28.17/10.26	
28.17/10.26	Graph 2
28.17/10.26	<l2, l19, main_x = 0, {all remain the same}>
28.17/10.26	
28.17/10.26	Map Locations to Subgraph:
28.17/10.26	( 0 , 0 )
28.17/10.26	( 2 , 1 )
28.17/10.26	( 19 , 2 )
28.17/10.26	
28.17/10.26	*******************************************************************************************
28.17/10.26	********************************    CHECKING ASSERTIONS    ********************************
28.17/10.26	*******************************************************************************************
28.17/10.26	
28.17/10.26	Proving termination of subgraph 0
28.17/10.26	Proving termination of subgraph 1
28.17/10.26	Checking unfeasibility...
28.17/10.26	Time used: 0.007707
28.17/10.26	
28.17/10.26	Checking conditional termination of SCC {l2}...
28.17/10.26	
28.17/10.26	LOG: CALL solveLinear
28.17/10.26	
28.17/10.26	LOG: RETURN solveLinear - Elapsed time: 0.001770s
28.17/10.26	
28.17/10.26	LOG: CALL solveLinear
28.17/10.26	
28.17/10.26	LOG: RETURN solveLinear - Elapsed time: 0.069349s
28.17/10.26	[13278 : 13280]
28.17/10.26	[13278 : 13281]
28.17/10.26	Successful child: 13280
28.17/10.26	[ Invariant Graph ]
28.17/10.26	Strengthening and disabling transitions...
28.17/10.26	
28.17/10.26	LOG: CALL solverLinear in Graph for feasibility
28.17/10.26	
28.17/10.26	LOG: RETURN solveLinear in Graph for feasibility
28.17/10.26	It's unfeasible. Removing transition: 
28.17/10.26	<l2, l2, 0 <= 5 + main_x /\ 1 + main_x <= 0, {main_x -> -5, rest remain the same}>
28.17/10.26	
28.17/10.26	LOG: CALL solverLinear in Graph for feasibility
28.17/10.26	
28.17/10.26	LOG: RETURN solveLinear in Graph for feasibility
28.17/10.26	It's unfeasible. Removing transition: 
28.17/10.26	<l2, l2, 6 + main_x <= 0, {main_x -> 0, rest remain the same}>
28.17/10.26	
28.17/10.26	LOG: CALL solverLinear in Graph for feasibility
28.17/10.26	
28.17/10.26	LOG: RETURN solveLinear in Graph for feasibility
28.17/10.26	Strengthening transition (result): 
28.17/10.26	<l2, l2, main_x <= 35 /\ 31 <= main_x, {main_x -> 35, rest remain the same}>
28.17/10.26	
28.17/10.26	LOG: CALL solverLinear in Graph for feasibility
28.17/10.26	
28.17/10.26	LOG: RETURN solveLinear in Graph for feasibility
28.17/10.26	Strengthening transition (result): 
28.17/10.26	<l2, l2, 1 <= main_x /\ main_x <= 30, {main_x -> -1 + main_x, rest remain the same}>
28.17/10.26	
28.17/10.26	LOG: CALL solverLinear in Graph for feasibility
28.17/10.26	
28.17/10.26	LOG: RETURN solveLinear in Graph for feasibility
28.17/10.26	Strengthening transition (result): 
28.17/10.26	<l2, l2, 36 <= main_x, {main_x -> 0, rest remain the same}>
28.17/10.26	[ Termination Graph ]
28.17/10.26	Strengthening and disabling transitions...
28.17/10.26	
28.17/10.26	LOG: CALL solverLinear in Graph for feasibility
28.17/10.26	
28.17/10.26	LOG: RETURN solveLinear in Graph for feasibility
28.17/10.26	It's unfeasible. Removing transition: 
28.17/10.26	<l2, l2, 0 <= 5 + main_x /\ 1 + main_x <= 0, {main_x -> -5, rest remain the same}>
28.17/10.26	
28.17/10.26	LOG: CALL solverLinear in Graph for feasibility
28.17/10.26	
28.17/10.26	LOG: RETURN solveLinear in Graph for feasibility
28.17/10.26	It's unfeasible. Removing transition: 
28.17/10.26	<l2, l2, 6 + main_x <= 0, {main_x -> 0, rest remain the same}>
28.17/10.26	
28.17/10.26	LOG: CALL solverLinear in Graph for feasibility
28.17/10.26	
28.17/10.26	LOG: RETURN solveLinear in Graph for feasibility
28.17/10.26	Strengthening transition (result): 
28.17/10.26	<l2, l2, main_x <= 35 /\ 31 <= main_x, {main_x -> 35, rest remain the same}>
28.17/10.26	
28.17/10.26	LOG: CALL solverLinear in Graph for feasibility
28.17/10.26	
28.17/10.26	LOG: RETURN solveLinear in Graph for feasibility
28.17/10.26	Strengthening transition (result): 
28.17/10.26	<l2, l2, 1 <= main_x /\ main_x <= 30, {main_x -> -1 + main_x, rest remain the same}>
28.17/10.26	
28.17/10.26	LOG: CALL solverLinear in Graph for feasibility
28.17/10.26	
28.17/10.26	LOG: RETURN solveLinear in Graph for feasibility
28.17/10.26	Strengthening transition (result): 
28.17/10.26	<l2, l2, 36 <= main_x, {main_x -> 0, rest remain the same}>
28.17/10.26	New Graphs: 
28.17/10.26	Transitions:
28.17/10.26	<l2, l2, main_x <= 35 /\ 31 <= main_x, {main_x -> 35, rest remain the same}>
28.17/10.26	<l2, l2, 1 <= main_x /\ main_x <= 30, {main_x -> -1 + main_x, rest remain the same}>
28.17/10.26	<l2, l2, 36 <= main_x, {main_x -> 0, rest remain the same}>
28.17/10.26	Variables:
28.17/10.26	main_x
28.17/10.26	Checking conditional termination of SCC {l2}...
28.17/10.26	
28.17/10.26	LOG: CALL solveLinear
28.17/10.26	
28.17/10.26	LOG: RETURN solveLinear - Elapsed time: 0.001086s
28.17/10.26	
28.17/10.26	LOG: CALL solveLinear
28.17/10.26	
28.17/10.26	LOG: RETURN solveLinear - Elapsed time: 0.006031s
28.17/10.26	Piecewise ranking function: min(-61 + 61*main_x,1829)
28.17/10.26	New Graphs: 
28.17/10.26	Transitions:
28.17/10.26	<l2, l2, main_x <= 35 /\ 31 <= main_x, {main_x -> 35, rest remain the same}>
28.17/10.26	Variables:
28.17/10.26	main_x
28.17/10.26	Checking conditional termination of SCC {l2}...
28.17/10.26	
28.17/10.26	LOG: CALL solveLinear
28.17/10.26	
28.17/10.26	LOG: RETURN solveLinear - Elapsed time: 0.000493s
28.17/10.26	
28.17/10.26	LOG: CALL solveLinear
28.17/10.26	
28.17/10.26	LOG: RETURN solveLinear - Elapsed time: 0.001619s
28.17/10.26	[13278 : 13285]
28.17/10.26	[13278 : 13286]
28.17/10.26	Successful child: 13285
28.17/10.26	[ Invariant Graph ]
28.17/10.26	Strengthening and disabling transitions...
28.17/10.26	
28.17/10.26	LOG: CALL solverLinear in Graph for feasibility
28.17/10.26	
28.17/10.26	LOG: RETURN solveLinear in Graph for feasibility
28.17/10.26	It's unfeasible. Removing transition: 
28.17/10.26	<l2, l2, main_x <= 35 /\ 31 <= main_x, {main_x -> 35, rest remain the same}>
28.17/10.26	
28.17/10.26	LOG: CALL solverLinear in Graph for feasibility
28.17/10.26	
28.17/10.26	LOG: RETURN solveLinear in Graph for feasibility
28.17/10.26	Strengthening transition (result): 
28.17/10.26	<l2, l2, 1 <= main_x /\ main_x <= 8, {main_x -> -1 + main_x, rest remain the same}>
28.17/10.26	
28.17/10.26	LOG: CALL solverLinear in Graph for feasibility
28.17/10.26	
28.17/10.26	LOG: RETURN solveLinear in Graph for feasibility
28.17/10.26	It's unfeasible. Removing transition: 
28.17/10.26	<l2, l2, 36 <= main_x, {main_x -> 0, rest remain the same}>
28.17/10.26	[ Termination Graph ]
28.17/10.26	Strengthening and disabling transitions...
28.17/10.26	
28.17/10.26	LOG: CALL solverLinear in Graph for feasibility
28.17/10.26	
28.17/10.26	LOG: RETURN solveLinear in Graph for feasibility
28.17/10.26	It's unfeasible. Removing transition: 
28.17/10.26	<l2, l2, main_x <= 35 /\ 31 <= main_x, {main_x -> 35, rest remain the same}>
28.17/10.26	New Graphs: 
28.17/10.26	
28.17/10.26	LOG: CALL check - Post:0 <= main_x - Process 1
28.17/10.26	* Exit transition: <l0, l2, true, {all remain the same}>
28.17/10.26	* Postcondition  : 0 <= main_x
28.17/10.26	
28.17/10.26	LOG: CALL solveLinear
28.17/10.26	
28.17/10.26	LOG: RETURN solveLinear - Elapsed time: 0.000395s
28.17/10.26	> Postcondition is not implied!
28.17/10.26	
28.17/10.26	LOG: RETURN check - Elapsed time: 0.000471s
28.17/10.26	INVARIANTS: 
28.17/10.26	2: 
28.17/10.26	Quasi-INVARIANTS to narrow Graph: 
28.17/10.26	2: 0 <= main_x , 
28.17/10.26	
28.17/10.26	LOG: CALL check - Post:main_x <= 8 - Process 2
28.17/10.26	* Exit transition: <l0, l2, true, {all remain the same}>
28.17/10.26	* Postcondition  : main_x <= 8
28.17/10.26	
28.17/10.26	LOG: CALL solveLinear
28.17/10.26	
28.17/10.26	LOG: RETURN solveLinear - Elapsed time: 0.000385s
28.17/10.26	> Postcondition is not implied!
28.17/10.26	
28.17/10.26	LOG: RETURN check - Elapsed time: 0.000451s
28.17/10.26	INVARIANTS: 
28.17/10.26	2: 
28.17/10.26	Quasi-INVARIANTS to narrow Graph: 
28.17/10.26	2: main_x <= 8 , 
28.17/10.26	Narrowing transition: 
28.17/10.26	<l2, l2, 0 <= 5 + main_x /\ 1 + main_x <= 0, {main_x -> -5, rest remain the same}>
28.17/10.26	
28.17/10.26	LOG: Narrow transition size 2
28.17/10.26	It's unfeasible. Removing transition: 
28.17/10.26	<l2, l2, 6 + main_x <= 0, {main_x -> 0, rest remain the same}>
28.17/10.26	Narrowing transition: 
28.17/10.26	<l2, l2, main_x <= 35 /\ 31 <= main_x, {main_x -> 35, rest remain the same}>
28.17/10.26	
28.17/10.26	LOG: Narrow transition size 2
28.17/10.26	Narrowing transition: 
28.17/10.26	<l2, l2, 1 <= main_x /\ main_x <= 30, {main_x -> -1 + main_x, rest remain the same}>
28.17/10.26	
28.17/10.26	LOG: Narrow transition size 2
28.17/10.26	It's unfeasible. Removing transition: 
28.17/10.26	<l2, l2, 36 <= main_x, {main_x -> 0, rest remain the same}>
28.17/10.26	invGraph after Narrowing: 
28.17/10.26	Transitions:
28.17/10.26	<l2, l2, 0 <= 5 + main_x /\ 1 + main_x <= 0, {main_x -> -5, rest remain the same}>
28.17/10.26	<l2, l2, main_x <= 35 /\ 31 <= main_x, {main_x -> 35, rest remain the same}>
28.17/10.26	<l2, l2, main_x <= 30 /\ 9 <= main_x, {main_x -> -1 + main_x, rest remain the same}>
28.17/10.26	Variables:
28.17/10.26	main_x
28.17/10.26	Checking conditional termination of SCC {l2}...
28.17/10.26	
28.17/10.26	LOG: CALL solveLinear
28.17/10.26	
28.17/10.26	LOG: RETURN solveLinear - Elapsed time: 0.001211s
28.17/10.26	
28.17/10.26	LOG: CALL solveLinear
28.17/10.26	
28.17/10.26	LOG: RETURN solveLinear - Elapsed time: 0.016284s
28.17/10.26	Piecewise ranking function: min(36,5 + main_x)
28.17/10.26	New Graphs: 
28.17/10.26	Transitions:
28.17/10.26	<l2, l2, 0 <= 5 + main_x /\ 1 + main_x <= 0, {main_x -> -5, rest remain the same}>
28.17/10.26	<l2, l2, main_x <= 35 /\ 31 <= main_x, {main_x -> 35, rest remain the same}>
28.17/10.26	Variables:
28.17/10.26	main_x
28.17/10.26	Checking conditional termination of SCC {l2}...
28.17/10.26	
28.17/10.26	LOG: CALL solveLinear
28.17/10.26	
28.17/10.26	LOG: RETURN solveLinear - Elapsed time: 0.000861s
28.17/10.26	
28.17/10.26	LOG: CALL solveLinear
28.17/10.26	
28.17/10.26	LOG: RETURN solveLinear - Elapsed time: 0.003575s
28.17/10.26	[13278 : 13290]
28.17/10.26	[13278 : 13291]
28.17/10.26	Successful child: 13290
28.17/10.26	[ Invariant Graph ]
28.17/10.26	Strengthening and disabling transitions...
28.17/10.26	
28.17/10.26	LOG: CALL solverLinear in Graph for feasibility
28.17/10.26	
28.17/10.26	LOG: RETURN solveLinear in Graph for feasibility
28.17/10.26	Strengthening transition (result): 
28.17/10.26	<l2, l2, 0 <= 5 + main_x /\ 1 + main_x <= 0, {main_x -> -5, rest remain the same}>
28.17/10.26	
28.17/10.26	LOG: CALL solverLinear in Graph for feasibility
28.17/10.26	
28.17/10.26	LOG: RETURN solveLinear in Graph for feasibility
28.17/10.26	It's unfeasible. Removing transition: 
28.17/10.26	<l2, l2, main_x <= 35 /\ 31 <= main_x, {main_x -> 35, rest remain the same}>
28.17/10.26	
28.17/10.26	LOG: CALL solverLinear in Graph for feasibility
28.17/10.26	
28.17/10.26	LOG: RETURN solveLinear in Graph for feasibility
28.17/10.26	Strengthening transition (result): 
28.17/10.26	<l2, l2, main_x <= 30 /\ 9 <= main_x, {main_x -> -1 + main_x, rest remain the same}>
28.17/10.26	[ Termination Graph ]
28.17/10.26	Strengthening and disabling transitions...
28.17/10.26	
28.17/10.26	LOG: CALL solverLinear in Graph for feasibility
28.17/10.26	
28.17/10.26	LOG: RETURN solveLinear in Graph for feasibility
28.17/10.26	Strengthening transition (result): 
28.17/10.26	<l2, l2, 0 <= 5 + main_x /\ 1 + main_x <= 0, {main_x -> -5, rest remain the same}>
28.17/10.26	
28.17/10.26	LOG: CALL solverLinear in Graph for feasibility
28.17/10.26	
28.17/10.26	LOG: RETURN solveLinear in Graph for feasibility
28.17/10.26	It's unfeasible. Removing transition: 
28.17/10.26	<l2, l2, main_x <= 35 /\ 31 <= main_x, {main_x -> 35, rest remain the same}>
28.17/10.26	New Graphs: 
28.17/10.26	Transitions:
28.17/10.26	<l2, l2, 0 <= 5 + main_x /\ 1 + main_x <= 0, {main_x -> -5, rest remain the same}>
28.17/10.26	Variables:
28.17/10.26	main_x
28.17/10.26	Checking conditional termination of SCC {l2}...
28.17/10.26	
28.17/10.26	LOG: CALL solveLinear
28.17/10.26	
28.17/10.26	LOG: RETURN solveLinear - Elapsed time: 0.000524s
28.17/10.26	
28.17/10.26	LOG: CALL solveLinear
28.17/10.26	
28.17/10.26	LOG: RETURN solveLinear - Elapsed time: 0.001689s
28.17/10.26	[13278 : 13295]
28.17/10.26	[13278 : 13296]
28.17/10.26	Successful child: 13295
28.17/10.26	[ Invariant Graph ]
28.17/10.26	Strengthening and disabling transitions...
28.17/10.26	
28.17/10.26	LOG: CALL solverLinear in Graph for feasibility
28.17/10.26	
28.17/10.26	LOG: RETURN solveLinear in Graph for feasibility
28.17/10.26	It's unfeasible. Removing transition: 
28.17/10.26	<l2, l2, 0 <= 5 + main_x /\ 1 + main_x <= 0, {main_x -> -5, rest remain the same}>
28.17/10.26	
28.17/10.26	LOG: CALL solverLinear in Graph for feasibility
28.17/10.26	
28.17/10.26	LOG: RETURN solveLinear in Graph for feasibility
28.17/10.26	Strengthening transition (result): 
28.17/10.26	<l2, l2, main_x <= 30 /\ 9 <= main_x, {main_x -> -1 + main_x, rest remain the same}>
28.17/10.26	[ Termination Graph ]
28.17/10.26	Strengthening and disabling transitions...
28.17/10.26	> It's unfeasible. Removing transition: 
28.17/10.26	<l2, l2, 0 <= 5 + main_x /\ 1 + main_x <= 0, {main_x -> -5, rest remain the same}>
28.17/10.26	New Graphs: 
28.17/10.26	
28.17/10.26	LOG: CALL check - Post:main_x <= 30 - Process 3
28.17/10.26	* Exit transition: <l0, l2, 9 <= main_x, {all remain the same}>
28.17/10.26	* Postcondition  : main_x <= 30
28.17/10.26	
28.17/10.26	LOG: CALL solveLinear
28.17/10.26	
28.17/10.26	LOG: RETURN solveLinear - Elapsed time: 0.000469s
28.17/10.26	> Postcondition is not implied!
28.17/10.26	
28.17/10.26	LOG: RETURN check - Elapsed time: 0.000552s
28.17/10.26	INVARIANTS: 
28.17/10.26	2: 
28.17/10.26	Quasi-INVARIANTS to narrow Graph: 
28.17/10.26	2: main_x <= 30 , 
28.17/10.26	
28.17/10.26	LOG: CALL check - Post:1 <= main_x - Process 4
28.17/10.26	* Exit transition: <l0, l2, 1 + main_x <= 0, {all remain the same}>
28.17/10.26	* Postcondition  : 1 <= main_x
28.17/10.26	
28.17/10.26	LOG: CALL solveLinear
28.17/10.26	
28.17/10.26	LOG: RETURN solveLinear - Elapsed time: 0.000483s
28.17/10.26	> Postcondition is not implied!
28.17/10.26	
28.17/10.26	LOG: RETURN check - Elapsed time: 0.000554s
28.17/10.26	INVARIANTS: 
28.17/10.26	2: 
28.17/10.26	Quasi-INVARIANTS to narrow Graph: 
28.17/10.26	2: 1 <= main_x , 
28.17/10.26	Narrowing transition: 
28.17/10.26	<l2, l2, 0 <= 5 + main_x /\ 1 + main_x <= 0, {main_x -> -5, rest remain the same}>
28.17/10.26	
28.17/10.26	LOG: Narrow transition size 2
28.17/10.26	Narrowing transition: 
28.17/10.26	<l2, l2, main_x <= 35 /\ 31 <= main_x, {main_x -> 35, rest remain the same}>
28.17/10.26	
28.17/10.26	LOG: Narrow transition size 2
28.17/10.26	It's unfeasible. Removing transition: 
28.17/10.26	<l2, l2, main_x <= 30 /\ 9 <= main_x, {main_x -> -1 + main_x, rest remain the same}>
28.17/10.26	invGraph after Narrowing: 
28.17/10.26	Transitions:
28.17/10.26	<l2, l2, 0 <= 5 + main_x /\ 1 + main_x <= 0, {main_x -> -5, rest remain the same}>
28.17/10.26	<l2, l2, main_x <= 35 /\ 31 <= main_x, {main_x -> 35, rest remain the same}>
28.17/10.26	Variables:
28.17/10.26	main_x
28.17/10.26	Checking conditional termination of SCC {l2}...
28.17/10.26	
28.17/10.26	LOG: CALL solveLinear
28.17/10.26	
28.17/10.26	LOG: RETURN solveLinear - Elapsed time: 0.000927s
28.17/10.26	
28.17/10.26	LOG: CALL solveLinear
28.17/10.26	
28.17/10.26	LOG: RETURN solveLinear - Elapsed time: 0.003789s
28.17/10.26	[13278 : 13300]
28.17/10.26	[13278 : 13301]
28.17/10.26	Successful child: 13300
28.17/10.26	[ Invariant Graph ]
28.17/10.26	Strengthening and disabling transitions...
28.17/10.26	
28.17/10.26	LOG: CALL solverLinear in Graph for feasibility
28.17/10.26	
28.17/10.26	LOG: RETURN solveLinear in Graph for feasibility
28.17/10.26	It's unfeasible. Removing transition: 
28.17/10.26	<l2, l2, 0 <= 5 + main_x /\ 1 + main_x <= 0, {main_x -> -5, rest remain the same}>
28.17/10.26	
28.17/10.26	LOG: CALL solverLinear in Graph for feasibility
28.17/10.26	
28.17/10.26	LOG: RETURN solveLinear in Graph for feasibility
28.17/10.26	Strengthening transition (result): 
28.17/10.26	<l2, l2, main_x <= 35 /\ 31 <= main_x, {main_x -> 35, rest remain the same}>
28.17/10.26	[ Termination Graph ]
28.17/10.26	Strengthening and disabling transitions...
28.17/10.26	> It's unfeasible. Removing transition: 
28.17/10.26	<l2, l2, 0 <= 5 + main_x /\ 1 + main_x <= 0, {main_x -> -5, rest remain the same}>
28.17/10.26	
28.17/10.26	LOG: CALL solverLinear in Graph for feasibility
28.17/10.26	
28.17/10.26	LOG: RETURN solveLinear in Graph for feasibility
28.17/10.26	Strengthening transition (result): 
28.17/10.26	<l2, l2, main_x <= 35 /\ 31 <= main_x, {main_x -> 35, rest remain the same}>
28.17/10.26	New Graphs: 
28.17/10.26	Transitions:
28.17/10.26	<l2, l2, main_x <= 35 /\ 31 <= main_x, {main_x -> 35, rest remain the same}>
28.17/10.26	Variables:
28.17/10.26	main_x
28.17/10.26	Checking conditional termination of SCC {l2}...
28.17/10.26	
28.17/10.26	LOG: CALL solveLinear
28.17/10.26	
28.17/10.26	LOG: RETURN solveLinear - Elapsed time: 0.000550s
28.17/10.26	
28.17/10.26	LOG: CALL solveLinear
28.17/10.26	
28.17/10.26	LOG: RETURN solveLinear - Elapsed time: 0.001745s
28.17/10.26	[13278 : 13305]
28.17/10.26	[13278 : 13306]
28.17/10.26	Successful child: 13305
28.17/10.26	[ Invariant Graph ]
28.17/10.26	Strengthening and disabling transitions...
28.17/10.26	
28.17/10.26	LOG: CALL solverLinear in Graph for feasibility
28.17/10.26	
28.17/10.26	LOG: RETURN solveLinear in Graph for feasibility
28.17/10.26	It's unfeasible. Removing transition: 
28.17/10.26	<l2, l2, main_x <= 35 /\ 31 <= main_x, {main_x -> 35, rest remain the same}>
28.17/10.26	[ Termination Graph ]
28.17/10.26	Strengthening and disabling transitions...
28.17/10.26	
28.17/10.26	LOG: CALL solverLinear in Graph for feasibility
28.17/10.26	
28.17/10.26	LOG: RETURN solveLinear in Graph for feasibility
28.17/10.26	It's unfeasible. Removing transition: 
28.17/10.26	<l2, l2, main_x <= 35 /\ 31 <= main_x, {main_x -> 35, rest remain the same}>
28.17/10.26	New Graphs: 
28.17/10.26	
28.17/10.26	LOG: CALL check - Post:0 <= main_x - Process 5
28.17/10.26	* Exit transition: <l0, l2, 1 + main_x <= 0, {all remain the same}>
28.17/10.26	* Postcondition  : 0 <= main_x
28.17/10.26	
28.17/10.26	LOG: CALL solveLinear
28.17/10.26	
28.17/10.26	LOG: RETURN solveLinear - Elapsed time: 0.000569s
28.17/10.26	> Postcondition is not implied!
28.17/10.26	
28.17/10.26	LOG: RETURN check - Elapsed time: 0.000652s
28.17/10.26	INVARIANTS: 
28.17/10.26	2: 
28.17/10.26	Quasi-INVARIANTS to narrow Graph: 
28.17/10.26	2: 0 <= main_x , 
28.17/10.26	
28.17/10.26	LOG: CALL check - Post:36 <= main_x - Process 6
28.17/10.26	* Exit transition: <l0, l2, 31 <= main_x, {all remain the same}>
28.17/10.26	* Postcondition  : 36 <= main_x
28.17/10.26	
28.17/10.26	LOG: CALL solveLinear
28.17/10.26	
28.17/10.26	LOG: RETURN solveLinear - Elapsed time: 0.000487s
28.17/10.26	> Postcondition is not implied!
28.17/10.26	
28.17/10.26	LOG: RETURN check - Elapsed time: 0.000559s
28.17/10.26	INVARIANTS: 
28.17/10.26	2: 
28.17/10.26	Quasi-INVARIANTS to narrow Graph: 
28.17/10.26	2: 36 <= main_x , 
28.17/10.26	Narrowing transition: 
28.17/10.26	<l2, l2, 0 <= 5 + main_x /\ 1 + main_x <= 0, {main_x -> -5, rest remain the same}>
28.17/10.26	
28.17/10.26	LOG: Narrow transition size 2
28.17/10.26	Narrowing transition: 
28.17/10.26	<l2, l2, main_x <= 35 /\ 31 <= main_x, {main_x -> 35, rest remain the same}>
28.17/10.26	
28.17/10.26	LOG: Narrow transition size 2
28.17/10.26	invGraph after Narrowing: 
28.17/10.26	Transitions:
28.17/10.26	<l2, l2, 0 <= 5 + main_x /\ 1 + main_x <= 0, {main_x -> -5, rest remain the same}>
28.17/10.26	<l2, l2, main_x <= 35 /\ 31 <= main_x, {main_x -> 35, rest remain the same}>
28.17/10.26	Variables:
28.17/10.26	main_x
28.17/10.26	Checking conditional termination of SCC {l2}...
28.17/10.26	
28.17/10.26	LOG: CALL solveLinear
28.17/10.26	
28.17/10.26	LOG: RETURN solveLinear - Elapsed time: 0.000940s
28.17/10.26	
28.17/10.26	LOG: CALL solveLinear
28.17/10.26	
28.17/10.26	LOG: RETURN solveLinear - Elapsed time: 0.003816s
28.17/10.26	[13278 : 13310]
28.17/10.26	[13278 : 13311]
28.17/10.26	Successful child: 13310
28.17/10.26	[ Invariant Graph ]
28.17/10.26	Strengthening and disabling transitions...
28.17/10.26	
28.17/10.26	LOG: CALL solverLinear in Graph for feasibility
28.17/10.26	
28.17/10.26	LOG: RETURN solveLinear in Graph for feasibility
28.17/10.26	Strengthening transition (result): 
28.17/10.26	<l2, l2, 0 <= 5 + main_x /\ 1 + main_x <= 0, {main_x -> -5, rest remain the same}>
28.17/10.26	
28.17/10.26	LOG: CALL solverLinear in Graph for feasibility
28.17/10.26	
28.17/10.26	LOG: RETURN solveLinear in Graph for feasibility
28.17/10.26	It's unfeasible. Removing transition: 
28.17/10.26	<l2, l2, main_x <= 35 /\ 31 <= main_x, {main_x -> 35, rest remain the same}>
28.17/10.26	[ Termination Graph ]
28.17/10.26	Strengthening and disabling transitions...
28.17/10.26	
28.17/10.26	LOG: CALL solverLinear in Graph for feasibility
28.17/10.26	
28.17/10.26	LOG: RETURN solveLinear in Graph for feasibility
28.17/10.26	Strengthening transition (result): 
28.17/10.26	<l2, l2, 0 <= 5 + main_x /\ 1 + main_x <= 0, {main_x -> -5, rest remain the same}>
28.17/10.26	
28.17/10.26	LOG: CALL solverLinear in Graph for feasibility
28.17/10.26	
28.17/10.26	LOG: RETURN solveLinear in Graph for feasibility
28.17/10.26	It's unfeasible. Removing transition: 
28.17/10.26	<l2, l2, main_x <= 35 /\ 31 <= main_x, {main_x -> 35, rest remain the same}>
28.17/10.26	New Graphs: 
28.17/10.26	Transitions:
28.17/10.26	<l2, l2, 0 <= 5 + main_x /\ 1 + main_x <= 0, {main_x -> -5, rest remain the same}>
28.17/10.26	Variables:
28.17/10.26	main_x
28.17/10.26	Checking conditional termination of SCC {l2}...
28.17/10.26	
28.17/10.26	LOG: CALL solveLinear
28.17/10.26	
28.17/10.26	LOG: RETURN solveLinear - Elapsed time: 0.000536s
28.17/10.26	
28.17/10.26	LOG: CALL solveLinear
28.17/10.26	
28.17/10.26	LOG: RETURN solveLinear - Elapsed time: 0.001707s
28.17/10.26	[13278 : 13315]
28.17/10.26	[13278 : 13316]
28.17/10.26	Successful child: 13315
28.17/10.26	[ Invariant Graph ]
28.17/10.26	Strengthening and disabling transitions...
28.17/10.26	
28.17/10.26	LOG: CALL solverLinear in Graph for feasibility
28.17/10.26	
28.17/10.26	LOG: RETURN solveLinear in Graph for feasibility
28.17/10.26	It's unfeasible. Removing transition: 
28.17/10.26	<l2, l2, 0 <= 5 + main_x /\ 1 + main_x <= 0, {main_x -> -5, rest remain the same}>
28.17/10.26	[ Termination Graph ]
28.17/10.26	Strengthening and disabling transitions...
28.17/10.26	
28.17/10.26	LOG: CALL solverLinear in Graph for feasibility
28.17/10.26	
28.17/10.26	LOG: RETURN solveLinear in Graph for feasibility
28.17/10.26	It's unfeasible. Removing transition: 
28.17/10.26	<l2, l2, 0 <= 5 + main_x /\ 1 + main_x <= 0, {main_x -> -5, rest remain the same}>
28.17/10.26	New Graphs: 
28.17/10.26	
28.17/10.26	LOG: CALL check - Post:main_x <= 2 - Process 7
28.17/10.26	* Exit transition: <l0, l2, main_x <= 35 /\ 31 <= main_x, {all remain the same}>
28.17/10.26	* Postcondition  : main_x <= 2
28.17/10.26	
28.17/10.26	LOG: CALL solveLinear
28.17/10.26	
28.17/10.26	LOG: RETURN solveLinear - Elapsed time: 0.000678s
28.17/10.26	> Postcondition is not implied!
28.17/10.26	
28.17/10.26	LOG: RETURN check - Elapsed time: 0.000771s
28.17/10.26	INVARIANTS: 
28.17/10.26	2: 
28.17/10.26	Quasi-INVARIANTS to narrow Graph: 
28.17/10.26	2: main_x <= 2 , 
28.17/10.26	
28.17/10.26	LOG: CALL check - Post:6 + main_x <= 0 - Process 8
28.17/10.26	* Exit transition: <l0, l2, 1 + main_x <= 0, {all remain the same}>
28.17/10.26	* Postcondition  : 6 + main_x <= 0
28.17/10.26	
28.17/10.26	LOG: CALL solveLinear
28.17/10.26	
28.17/10.26	LOG: RETURN solveLinear - Elapsed time: 0.000466s
28.17/10.26	> Postcondition is not implied!
28.17/10.26	
28.17/10.26	LOG: RETURN check - Elapsed time: 0.000535s
28.17/10.26	INVARIANTS: 
28.17/10.26	2: 
28.17/10.26	Quasi-INVARIANTS to narrow Graph: 
28.17/10.26	2: 6 + main_x <= 0 , 
28.17/10.26	Narrowing transition: 
28.17/10.26	<l2, l2, 0 <= 5 + main_x /\ 1 + main_x <= 0, {main_x -> -5, rest remain the same}>
28.17/10.26	
28.17/10.26	LOG: Narrow transition size 2
28.17/10.26	Narrowing transition: 
28.17/10.26	<l2, l2, main_x <= 35 /\ 31 <= main_x, {main_x -> 35, rest remain the same}>
28.17/10.26	
28.17/10.26	LOG: Narrow transition size 2
28.17/10.26	invGraph after Narrowing: 
28.17/10.26	Transitions:
28.17/10.26	<l2, l2, 0 <= 5 + main_x /\ 1 + main_x <= 0, {main_x -> -5, rest remain the same}>
28.17/10.26	<l2, l2, main_x <= 35 /\ 31 <= main_x, {main_x -> 35, rest remain the same}>
28.17/10.26	Variables:
28.17/10.26	main_x
28.17/10.26	Checking conditional termination of SCC {l2}...
28.17/10.26	
28.17/10.26	LOG: CALL solveLinear
28.17/10.26	
28.17/10.26	LOG: RETURN solveLinear - Elapsed time: 0.000939s
28.17/10.26	
28.17/10.26	LOG: CALL solveLinear
28.17/10.26	
28.17/10.26	LOG: RETURN solveLinear - Elapsed time: 0.003810s
28.17/10.26	[13278 : 13320]
28.17/10.26	[13278 : 13321]
28.17/10.26	Successful child: 13320
28.17/10.26	[ Invariant Graph ]
28.17/10.26	Strengthening and disabling transitions...
28.17/10.26	
28.17/10.26	LOG: CALL solverLinear in Graph for feasibility
28.17/10.26	
28.17/10.26	LOG: RETURN solveLinear in Graph for feasibility
28.17/10.26	Strengthening transition (result): 
28.17/10.26	<l2, l2, 0 <= 5 + main_x /\ 1 + main_x <= 0, {main_x -> -5, rest remain the same}>
28.17/10.26	
28.17/10.26	LOG: CALL solverLinear in Graph for feasibility
28.17/10.26	
28.17/10.26	LOG: RETURN solveLinear in Graph for feasibility
28.17/10.26	It's unfeasible. Removing transition: 
28.17/10.26	<l2, l2, main_x <= 35 /\ 31 <= main_x, {main_x -> 35, rest remain the same}>
28.17/10.26	[ Termination Graph ]
28.17/10.26	Strengthening and disabling transitions...
28.17/10.26	
28.17/10.26	LOG: CALL solverLinear in Graph for feasibility
28.17/10.26	
28.17/10.26	LOG: RETURN solveLinear in Graph for feasibility
28.17/10.26	Strengthening transition (result): 
28.17/10.26	<l2, l2, 0 <= 5 + main_x /\ 1 + main_x <= 0, {main_x -> -5, rest remain the same}>
28.17/10.26	
28.17/10.26	LOG: CALL solverLinear in Graph for feasibility
28.17/10.26	
28.17/10.26	LOG: RETURN solveLinear in Graph for feasibility
28.17/10.26	It's unfeasible. Removing transition: 
28.17/10.26	<l2, l2, main_x <= 35 /\ 31 <= main_x, {main_x -> 35, rest remain the same}>
28.17/10.26	New Graphs: 
28.17/10.26	Transitions:
28.17/10.26	<l2, l2, 0 <= 5 + main_x /\ 1 + main_x <= 0, {main_x -> -5, rest remain the same}>
28.17/10.26	Variables:
28.17/10.26	main_x
28.17/10.26	Checking conditional termination of SCC {l2}...
28.17/10.26	
28.17/10.26	LOG: CALL solveLinear
28.17/10.26	
28.17/10.26	LOG: RETURN solveLinear - Elapsed time: 0.000522s
28.17/10.26	
28.17/10.26	LOG: CALL solveLinear
28.17/10.26	
28.17/10.26	LOG: RETURN solveLinear - Elapsed time: 0.001734s
28.17/10.26	[13278 : 13325]
28.17/10.26	[13278 : 13326]
28.17/10.26	Solving with 1 template(s).
28.17/10.26	
28.17/10.26	LOG: CALL solveNonLinearGetFirstSolution
28.17/10.26	
28.17/10.26	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.094401s
28.17/10.26	Time used: 0.094126
28.17/10.26	
28.17/10.26	[13278 : 13330]
28.17/10.26	[13278 : 13334]
28.17/10.26	Successful child: 13330
28.17/10.26	
28.17/10.26	Program does NOT terminate
28.17/10.26	EOF