0.00/0.08	YES
0.00/0.08	
0.00/0.08	Solver Timeout: 4
0.00/0.08	Global Timeout: 300
0.00/0.08	Maximum number of concurrent processes: 900
0.00/0.08	*******************************************************************************************
0.00/0.08	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
0.00/0.08	*******************************************************************************************
0.00/0.08	
0.00/0.08	
0.00/0.08	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
0.00/0.08	
0.00/0.08	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
0.00/0.08	+                                                                  +
0.00/0.08	Init Location: 0
0.00/0.08	Transitions:
0.00/0.08	<l0, l1, true, seq{main__func_return_ -> 0, main_x -> 0, main_y -> 0}>
0.00/0.08	<l1, l2, true>
0.00/0.08	<l2, l10, not((main_y >= 0))>
0.00/0.08	<l2, l3, (main_y >= 0)>
0.00/0.08	<l3, l4, (main_x <= 50)>
0.00/0.08	<l3, l6, not((main_x <= 50))>
0.00/0.08	<l4, l5, true, seq{main_y -> (main_y + 1)}>
0.00/0.08	<l5, l8, true>
0.00/0.08	<l6, l7, true, seq{main_y -> (main_y - 1)}>
0.00/0.08	<l7, l8, true>
0.00/0.08	<l8, l9, true, seq{main_x -> (main_x + 1)}>
0.00/0.08	<l9, l2, true>
0.00/0.08	<l10, l11, true, seq{main__func_return_ -> 0}>
0.00/0.08	
0.00/0.08	Fresh variables:
0.00/0.08	
0.00/0.08	Undef variables:
0.00/0.08	
0.00/0.08	Abstraction variables:
0.00/0.08	
0.00/0.08	Exit nodes:
0.00/0.08	
0.00/0.08	Accepting locations:
0.00/0.08	
0.00/0.08	Asserts:
0.00/0.08	
0.00/0.08	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
0.00/0.08	       
0.00/0.08	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
0.00/0.08	       
0.00/0.08	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
0.00/0.08	
0.00/0.08	Init Location: 0
0.00/0.08	Transitions:
0.00/0.08	<l0, l1, true, seq{main__func_return_ -> 0, main_x -> 0, main_y -> 0}>
0.00/0.08	<l1, l2, true>
0.00/0.08	<l2, l3, (main_y >= 0)>
0.00/0.08	<l2, l10, not((main_y >= 0))>
0.00/0.08	<l3, l4, (main_x <= 50)>
0.00/0.08	<l3, l6, not((main_x <= 50))>
0.00/0.08	<l4, l5, true, seq{main_y -> (main_y + 1)}>
0.00/0.08	<l5, l8, true>
0.00/0.08	<l6, l7, true, seq{main_y -> (main_y - 1)}>
0.00/0.08	<l7, l8, true>
0.00/0.08	<l8, l9, true, seq{main_x -> (main_x + 1)}>
0.00/0.08	<l9, l2, true>
0.00/0.08	<l10, l11, true, seq{main__func_return_ -> 0}>
0.00/0.08	
0.00/0.08	Fresh variables:
0.00/0.08	
0.00/0.08	Undef variables:
0.00/0.08	
0.00/0.08	Abstraction variables:
0.00/0.08	
0.00/0.08	Exit nodes:
0.00/0.08	11, 
0.00/0.08	Accepting locations:
0.00/0.08	
0.00/0.08	Asserts:
0.00/0.08	
0.00/0.08	+                                                                  +
0.00/0.08	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
0.00/0.08	
0.00/0.08	
0.00/0.08	Function Return and Parameters Information [1 functions]:
0.00/0.08	    function name: main [1 return + 0 parameters]        demangled: main
0.00/0.08	        main__func_return_      [function result] : int
0.00/0.08	
0.00/0.08	
0.00/0.08	AST Ident Scanner Information [4 idents]:
0.00/0.08	__VERIFIER_nondet_int | function | [integer, ()] | <line: 12, col: 1>
0.00/0.08	main | function | [integer, ()] | <line: 14, col: 1>
0.00/0.08	x | local variable | integer | <line: 15, col: 5> | <line: 16, col: 2> <line: 19, col: 7> <line: 24, col: 3> <line: 24, col: 7>
0.00/0.08	y | local variable | integer | <line: 15, col: 5> | <line: 17, col: 5> <line: 18, col: 9> <line: 20, col: 4> <line: 20, col: 8> <line: 22, col: 4> <line: 22, col: 8>
0.00/0.08	
0.00/0.08	Main function: main
0.00/0.08	Preprocessed LLVMGraph
0.00/0.08	Init Location: 0
0.00/0.08	Transitions:
0.00/0.08	<l0, l2, (main_x = 0) /\ (main_y = 0)>
0.00/0.08	<l2, l2, (main_y >= 0) /\ (main_x <= 50), par{main_x -> (main_x + 1), main_y -> (main_y + 1)}>
0.00/0.08	<l2, l2, (main_y >= 0) /\ not((main_x <= 50)), par{main_x -> (main_x + 1), main_y -> (main_y - 1)}>
0.00/0.08	<l2, l11, not((main_y >= 0))>
0.00/0.08	
0.00/0.08	Fresh variables:
0.00/0.08	
0.00/0.08	Undef variables:
0.00/0.08	
0.00/0.08	Abstraction variables:
0.00/0.08	
0.00/0.08	Exit nodes:
0.00/0.08	11, 
0.00/0.08	Accepting locations:
0.00/0.08	
0.00/0.08	Asserts:
0.00/0.08	
0.00/0.08	*************************************************************
0.00/0.08	*******************************************************************************************
0.00/0.08	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.00/0.08	*******************************************************************************************
0.00/0.08	
0.00/0.08	Init Location: 0
0.00/0.08	Graph 0:
0.00/0.08	Transitions:
0.00/0.08	Variables:
0.00/0.08	
0.00/0.08	Graph 1:
0.00/0.08	Transitions:
0.00/0.08	<l2, l2, 0 <= main_y /\ main_x <= 50, {main_x -> 1 + main_x, main_y -> 1 + main_y, rest remain the same}>
0.00/0.08	<l2, l2, 0 <= main_y /\ 51 <= main_x, {main_x -> 1 + main_x, main_y -> -1 + main_y, rest remain the same}>
0.00/0.08	Variables:
0.00/0.08	main_x, main_y
0.00/0.08	
0.00/0.08	Graph 2:
0.00/0.08	Transitions:
0.00/0.08	Variables:
0.00/0.08	
0.00/0.08	Precedence: 
0.00/0.08	Graph 0
0.00/0.08	
0.00/0.08	Graph 1
0.00/0.08	<l0, l2, main_x = 0 /\ main_y = 0, {all remain the same}>
0.00/0.08	
0.00/0.08	Graph 2
0.00/0.08	<l2, l11, 1 + main_y <= 0, {all remain the same}>
0.00/0.08	
0.00/0.08	Map Locations to Subgraph:
0.00/0.08	( 0 , 0 )
0.00/0.08	( 2 , 1 )
0.00/0.08	( 11 , 2 )
0.00/0.08	
0.00/0.08	*******************************************************************************************
0.00/0.08	********************************    CHECKING ASSERTIONS    ********************************
0.00/0.08	*******************************************************************************************
0.00/0.08	
0.00/0.08	Proving termination of subgraph 0
0.00/0.08	Proving termination of subgraph 1
0.00/0.08	Checking unfeasibility...
0.00/0.08	Time used: 0.052007
0.00/0.08	
0.00/0.08	Checking conditional termination of SCC {l2}...
0.00/0.08	
0.00/0.08	LOG: CALL solveLinear
0.00/0.08	
0.00/0.08	LOG: RETURN solveLinear - Elapsed time: 0.002212s
0.00/0.08	Ranking function: 51 - main_x
0.00/0.08	New Graphs: 
0.00/0.08	Transitions:
0.00/0.08	<l2, l2, 0 <= main_y /\ 51 <= main_x, {main_x -> 1 + main_x, main_y -> -1 + main_y, rest remain the same}>
0.00/0.08	Variables:
0.00/0.08	main_x, main_y
0.00/0.08	Checking conditional termination of SCC {l2}...
0.00/0.08	
0.00/0.08	LOG: CALL solveLinear
0.00/0.08	
0.00/0.08	LOG: RETURN solveLinear - Elapsed time: 0.000612s
0.00/0.08	Ranking function: main_y
0.00/0.08	New Graphs: 
0.00/0.08	Proving termination of subgraph 2
0.00/0.08	Analyzing SCC {l11}...
0.00/0.08	No cycles found.
0.00/0.08	
0.00/0.08	Program Terminates
0.00/0.08	EOF