0.00/0.28	YES
0.00/0.28	
0.00/0.28	Solver Timeout: 4
0.00/0.28	Global Timeout: 300
0.00/0.28	Maximum number of concurrent processes: 900
0.00/0.28	*******************************************************************************************
0.00/0.28	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
0.00/0.28	*******************************************************************************************
0.00/0.28	
0.00/0.28	
0.00/0.28	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
0.00/0.28	
0.00/0.28	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
0.00/0.28	+                                                                  +
0.00/0.28	Init Location: 0
0.00/0.28	Transitions:
0.00/0.28	<l0, l1, true, seq{main__func_return_ -> 0, main_x -> ¿functionCall(__VERIFIER_nondet_int), main_y -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.28	<l1, l2, true>
0.00/0.28	<l2, l6, not((main_x > 0))>
0.00/0.28	<l2, l3, (main_x > 0)>
0.00/0.28	<l3, l6, not((main_y <= ~(main_oldy)))>
0.00/0.28	<l3, l4, (main_y <= ~(main_oldy))>
0.00/0.28	<l4, l5, true, seq{main_x -> main_y, main_oldy -> main_y, main_y -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.28	<l5, l2, true>
0.00/0.28	<l6, l7, true, seq{main__func_return_ -> 0}>
0.00/0.28	
0.00/0.28	Fresh variables:
0.00/0.28	
0.00/0.28	Undef variables:
0.00/0.28	
0.00/0.28	Abstraction variables:
0.00/0.28	
0.00/0.28	Exit nodes:
0.00/0.28	
0.00/0.28	Accepting locations:
0.00/0.28	
0.00/0.28	Asserts:
0.00/0.28	
0.00/0.28	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
0.00/0.28	       
0.00/0.28	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
0.00/0.28	       
0.00/0.28	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
0.00/0.28	
0.00/0.28	Init Location: 0
0.00/0.28	Transitions:
0.00/0.28	<l0, l8, true, seq{main__func_return_ -> 0}>
0.00/0.28	<l8, l9, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.28	<l9, l10, true, seq{main_x -> varCall_1}>
0.00/0.28	<l10, l11, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.28	<l11, l1, true, seq{main_y -> varCall_2}>
0.00/0.28	<l1, l2, true>
0.00/0.28	<l2, l3, (main_x > 0)>
0.00/0.28	<l2, l6, not((main_x > 0))>
0.00/0.28	<l3, l4, (main_y <= ~(main_oldy))>
0.00/0.28	<l3, l6, not((main_y <= ~(main_oldy)))>
0.00/0.28	<l4, l12, true, seq{main_x -> main_y, main_oldy -> main_y}>
0.00/0.28	<l12, l13, true, seq{varCall_3 -> ¿functionCall(__VERIFIER_nondet_int)}>
0.00/0.28	<l13, l5, true, seq{main_y -> varCall_3}>
0.00/0.28	<l5, l2, true>
0.00/0.28	<l6, l7, true, seq{main__func_return_ -> 0}>
0.00/0.28	
0.00/0.28	Fresh variables:
0.00/0.28	
0.00/0.28	Undef variables:
0.00/0.28	
0.00/0.28	Abstraction variables:
0.00/0.28	
0.00/0.28	Exit nodes:
0.00/0.28	7, 
0.00/0.28	Accepting locations:
0.00/0.28	
0.00/0.28	Asserts:
0.00/0.28	
0.00/0.28	+                                                                  +
0.00/0.28	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
0.00/0.28	
0.00/0.28	
0.00/0.28	Function Return and Parameters Information [2 functions]:
0.00/0.28	    function name: __VERIFIER_nondet_int [1 return + 0 parameters]        demangled: __VERIFIER_nondet_int
0.00/0.28	        __VERIFIER_nondet_int__func_return_      [function result] : int
0.00/0.28	    function name: main [1 return + 0 parameters]        demangled: main
0.00/0.28	        main__func_return_      [function result] : int
0.00/0.28	
0.00/0.28	
0.00/0.28	AST Ident Scanner Information [5 idents]:
0.00/0.28	__VERIFIER_nondet_int | function | [integer, ()] | <line: 20, col: 1> | <line: 24, col: 9> <line: 25, col: 9> <line: 29, col: 13>
0.00/0.28	main | function | [integer, ()] | <line: 22, col: 1>
0.00/0.28	x | local variable | integer | <line: 23, col: 5> | <line: 24, col: 5> <line: 26, col: 12> <line: 27, col: 9>
0.00/0.28	y | local variable | integer | <line: 23, col: 5> | <line: 25, col: 5> <line: 26, col: 21> <line: 27, col: 13> <line: 28, col: 16> <line: 29, col: 9>
0.00/0.28	oldy | local variable | integer | <line: 23, col: 5> | <line: 26, col: 27> <line: 28, col: 9>
0.00/0.28	
0.00/0.28	Main function: main
0.00/0.28	Preprocessed LLVMGraph
0.00/0.28	Init Location: 0
0.00/0.28	Transitions:
0.00/0.28	<l0, l2, (main_x = undef4) /\ (main_y = undef5)>
0.00/0.28	<l2, l2, (main_x > 0) /\ (main_y <= ~(main_oldy)), par{main_x -> main_y, main_y -> undef6, main_oldy -> main_y}>
0.00/0.28	<l2, l7, (main_x > 0) /\ not((main_y <= ~(main_oldy)))>
0.00/0.28	<l2, l7, not((main_x > 0))>
0.00/0.28	
0.00/0.28	Fresh variables:
0.00/0.28	undef4, undef5, undef6, 
0.00/0.28	
0.00/0.28	Undef variables:
0.00/0.28	undef4, undef5, undef6, 
0.00/0.28	
0.00/0.28	Abstraction variables:
0.00/0.28	
0.00/0.28	Exit nodes:
0.00/0.28	7, 
0.00/0.28	Accepting locations:
0.00/0.28	
0.00/0.28	Asserts:
0.00/0.28	
0.00/0.28	*************************************************************
0.00/0.28	*******************************************************************************************
0.00/0.28	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.00/0.28	*******************************************************************************************
0.00/0.28	
0.00/0.28	Init Location: 0
0.00/0.28	Graph 0:
0.00/0.28	Transitions:
0.00/0.28	Variables:
0.00/0.28	
0.00/0.28	Graph 1:
0.00/0.28	Transitions:
0.00/0.28	<l2, l2, main_y + main_oldy <= 0 /\ 1 <= main_x, {main_x -> main_y, main_y -> undef6, main_oldy -> main_y, rest remain the same}>
0.00/0.28	Variables:
0.00/0.28	main_x, main_y, main_oldy
0.00/0.28	
0.00/0.28	Graph 2:
0.00/0.28	Transitions:
0.00/0.28	Variables:
0.00/0.28	
0.00/0.28	Precedence: 
0.00/0.28	Graph 0
0.00/0.28	
0.00/0.28	Graph 1
0.00/0.28	<l0, l2, main_x = undef4 /\ main_y = undef5, {all remain the same}>
0.00/0.28	
0.00/0.28	Graph 2
0.00/0.28	<l2, l7, 1 <= main_x /\ 1 <= main_y + main_oldy, {all remain the same}>
0.00/0.28	<l2, l7, main_x <= 0, {all remain the same}>
0.00/0.28	
0.00/0.28	Map Locations to Subgraph:
0.00/0.28	( 0 , 0 )
0.00/0.28	( 2 , 1 )
0.00/0.28	( 7 , 2 )
0.00/0.28	
0.00/0.28	*******************************************************************************************
0.00/0.28	********************************    CHECKING ASSERTIONS    ********************************
0.00/0.28	*******************************************************************************************
0.00/0.28	
0.00/0.28	Proving termination of subgraph 0
0.00/0.28	Proving termination of subgraph 1
0.00/0.28	Checking unfeasibility...
0.00/0.28	Time used: 0.002395
0.00/0.28	
0.00/0.28	Checking conditional termination of SCC {l2}...
0.00/0.28	
0.00/0.28	LOG: CALL solveLinear
0.00/0.28	
0.00/0.28	LOG: RETURN solveLinear - Elapsed time: 0.000814s
0.00/0.28	
0.00/0.28	LOG: CALL solveLinear
0.00/0.28	
0.00/0.28	LOG: RETURN solveLinear - Elapsed time: 0.002447s
0.00/0.28	[54112 : 54114]
0.00/0.28	[54112 : 54115]
0.00/0.28	Successful child: 54114
0.00/0.28	[ Invariant Graph ]
0.00/0.28	Strengthening and disabling transitions...
0.00/0.28	
0.00/0.28	LOG: CALL solverLinear in Graph for feasibility
0.00/0.28	
0.00/0.28	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.28	It's unfeasible. Removing transition: 
0.00/0.28	<l2, l2, main_y + main_oldy <= 0 /\ 1 <= main_x, {main_x -> main_y, main_y -> undef6, main_oldy -> main_y, rest remain the same}>
0.00/0.28	[ Termination Graph ]
0.00/0.28	Strengthening and disabling transitions...
0.00/0.28	> It's unfeasible. Removing transition: 
0.00/0.28	<l2, l2, main_y + main_oldy <= 0 /\ 1 <= main_x, {main_x -> main_y, main_y -> undef6, main_oldy -> main_y, rest remain the same}>
0.00/0.28	New Graphs: 
0.00/0.28	
0.00/0.28	LOG: CALL check - Post:1 <= main_y + main_oldy - Process 1
0.00/0.28	* Exit transition: <l0, l2, main_x = undef4 /\ main_y = undef5, {all remain the same}>
0.00/0.28	* Postcondition  : 1 <= main_y + main_oldy
0.00/0.28	
0.00/0.28	LOG: CALL solveLinear
0.00/0.28	
0.00/0.28	LOG: RETURN solveLinear - Elapsed time: 0.000530s
0.00/0.28	> Postcondition is not implied!
0.00/0.28	
0.00/0.28	LOG: RETURN check - Elapsed time: 0.000634s
0.00/0.28	INVARIANTS: 
0.00/0.28	2: 
0.00/0.28	Quasi-INVARIANTS to narrow Graph: 
0.00/0.28	2: 1 <= main_y + main_oldy , 
0.00/0.28	Narrowing transition: 
0.00/0.28	<l2, l2, main_y + main_oldy <= 0 /\ 1 <= main_x, {main_x -> main_y, main_y -> undef6, main_oldy -> main_y, rest remain the same}>
0.00/0.28	
0.00/0.28	LOG: Narrow transition size 1
0.00/0.28	invGraph after Narrowing: 
0.00/0.28	Transitions:
0.00/0.28	<l2, l2, main_y + main_oldy <= 0 /\ 1 <= main_x, {main_x -> main_y, main_y -> undef6, main_oldy -> main_y, rest remain the same}>
0.00/0.28	Variables:
0.00/0.28	main_x, main_y, main_oldy
0.00/0.28	Checking conditional termination of SCC {l2}...
0.00/0.28	
0.00/0.28	LOG: CALL solveLinear
0.00/0.28	
0.00/0.28	LOG: RETURN solveLinear - Elapsed time: 0.000803s
0.00/0.28	
0.00/0.28	LOG: CALL solveLinear
0.00/0.28	
0.00/0.28	LOG: RETURN solveLinear - Elapsed time: 0.002629s
0.00/0.28	[54112 : 54119]
0.00/0.28	[54112 : 54120]
0.00/0.28	Successful child: 54119
0.00/0.28	[ Invariant Graph ]
0.00/0.28	Strengthening and disabling transitions...
0.00/0.28	
0.00/0.28	LOG: CALL solverLinear in Graph for feasibility
0.00/0.28	
0.00/0.28	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.28	It's unfeasible. Removing transition: 
0.00/0.28	<l2, l2, main_y + main_oldy <= 0 /\ 1 <= main_x, {main_x -> main_y, main_y -> undef6, main_oldy -> main_y, rest remain the same}>
0.00/0.28	[ Termination Graph ]
0.00/0.28	Strengthening and disabling transitions...
0.00/0.28	
0.00/0.28	LOG: CALL solverLinear in Graph for feasibility
0.00/0.28	
0.00/0.28	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.28	It's unfeasible. Removing transition: 
0.00/0.28	<l2, l2, main_y + main_oldy <= 0 /\ 1 <= main_x, {main_x -> main_y, main_y -> undef6, main_oldy -> main_y, rest remain the same}>
0.00/0.28	New Graphs: 
0.00/0.28	
0.00/0.28	LOG: CALL check - Post:1 + main_x <= 0 - Process 2
0.00/0.28	* Exit transition: <l0, l2, main_y + main_oldy <= 0 /\ main_x = undef4 /\ main_y = undef5, {all remain the same}>
0.00/0.28	* Postcondition  : 1 + main_x <= 0
0.00/0.28	
0.00/0.28	LOG: CALL solveLinear
0.00/0.28	
0.00/0.28	LOG: RETURN solveLinear - Elapsed time: 0.000496s
0.00/0.28	> Postcondition is not implied!
0.00/0.28	
0.00/0.28	LOG: RETURN check - Elapsed time: 0.000595s
0.00/0.28	INVARIANTS: 
0.00/0.28	2: 
0.00/0.28	Quasi-INVARIANTS to narrow Graph: 
0.00/0.28	2: 1 + main_x <= 0 , 
0.00/0.28	Narrowing transition: 
0.00/0.28	<l2, l2, main_y + main_oldy <= 0 /\ 1 <= main_x, {main_x -> main_y, main_y -> undef6, main_oldy -> main_y, rest remain the same}>
0.00/0.28	
0.00/0.28	LOG: Narrow transition size 1
0.00/0.28	invGraph after Narrowing: 
0.00/0.28	Transitions:
0.00/0.28	<l2, l2, main_y + main_oldy <= 0 /\ 1 <= main_x, {main_x -> main_y, main_y -> undef6, main_oldy -> main_y, rest remain the same}>
0.00/0.28	Variables:
0.00/0.28	main_x, main_y, main_oldy
0.00/0.28	Checking conditional termination of SCC {l2}...
0.00/0.28	
0.00/0.28	LOG: CALL solveLinear
0.00/0.28	
0.00/0.28	LOG: RETURN solveLinear - Elapsed time: 0.000787s
0.00/0.28	
0.00/0.28	LOG: CALL solveLinear
0.00/0.28	
0.00/0.28	LOG: RETURN solveLinear - Elapsed time: 0.002518s
0.00/0.28	[54112 : 54124]
0.00/0.28	[54112 : 54125]
0.00/0.28	Successful child: 54124
0.00/0.28	[ Invariant Graph ]
0.00/0.28	Strengthening and disabling transitions...
0.00/0.28	
0.00/0.28	LOG: CALL solverLinear in Graph for feasibility
0.00/0.28	
0.00/0.28	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.28	It's unfeasible. Removing transition: 
0.00/0.28	<l2, l2, main_y + main_oldy <= 0 /\ 1 <= main_x, {main_x -> main_y, main_y -> undef6, main_oldy -> main_y, rest remain the same}>
0.00/0.28	[ Termination Graph ]
0.00/0.28	Strengthening and disabling transitions...
0.00/0.28	
0.00/0.28	LOG: CALL solverLinear in Graph for feasibility
0.00/0.28	
0.00/0.28	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.28	It's unfeasible. Removing transition: 
0.00/0.28	<l2, l2, main_y + main_oldy <= 0 /\ 1 <= main_x, {main_x -> main_y, main_y -> undef6, main_oldy -> main_y, rest remain the same}>
0.00/0.28	New Graphs: 
0.00/0.28	
0.00/0.28	LOG: CALL check - Post:main_x <= main_y + main_oldy - Process 3
0.00/0.28	* Exit transition: <l0, l2, 0 <= main_x /\ main_y + main_oldy <= 0 /\ main_x = undef4 /\ main_y = undef5, {all remain the same}>
0.00/0.28	* Postcondition  : main_x <= main_y + main_oldy
0.00/0.28	
0.00/0.28	LOG: CALL solveLinear
0.00/0.28	
0.00/0.28	LOG: RETURN solveLinear - Elapsed time: 0.000554s
0.00/0.28	> Postcondition is not implied!
0.00/0.28	
0.00/0.28	LOG: RETURN check - Elapsed time: 0.000678s
0.00/0.28	INVARIANTS: 
0.00/0.28	2: 
0.00/0.28	Quasi-INVARIANTS to narrow Graph: 
0.00/0.28	2: main_x <= main_y + main_oldy , 
0.00/0.28	Narrowing transition: 
0.00/0.28	<l2, l2, main_y + main_oldy <= 0 /\ 1 <= main_x, {main_x -> main_y, main_y -> undef6, main_oldy -> main_y, rest remain the same}>
0.00/0.28	
0.00/0.28	LOG: Narrow transition size 1
0.00/0.28	invGraph after Narrowing: 
0.00/0.28	Transitions:
0.00/0.28	<l2, l2, main_y + main_oldy <= 0 /\ 1 <= main_x /\ 1 + main_y + main_oldy <= main_x, {main_x -> main_y, main_y -> undef6, main_oldy -> main_y, rest remain the same}>
0.00/0.28	Variables:
0.00/0.28	main_x, main_y, main_oldy
0.00/0.28	Checking conditional termination of SCC {l2}...
0.00/0.28	
0.00/0.28	LOG: CALL solveLinear
0.00/0.28	
0.00/0.28	LOG: RETURN solveLinear - Elapsed time: 0.000743s
0.00/0.28	
0.00/0.28	LOG: CALL solveLinear
0.00/0.28	
0.00/0.28	LOG: RETURN solveLinear - Elapsed time: 0.002866s
0.00/0.28	[54112 : 54129]
0.00/0.28	[54112 : 54130]
0.00/0.28	Successful child: 54129
0.00/0.28	[ Invariant Graph ]
0.00/0.28	Strengthening and disabling transitions...
0.00/0.28	
0.00/0.28	LOG: CALL solverLinear in Graph for feasibility
0.00/0.28	
0.00/0.28	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.28	It's unfeasible. Removing transition: 
0.00/0.28	<l2, l2, main_y + main_oldy <= 0 /\ 1 <= main_x /\ 1 + main_y + main_oldy <= main_x, {main_x -> main_y, main_y -> undef6, main_oldy -> main_y, rest remain the same}>
0.00/0.28	[ Termination Graph ]
0.00/0.28	Strengthening and disabling transitions...
0.00/0.28	> It's unfeasible. Removing transition: 
0.00/0.28	<l2, l2, main_y + main_oldy <= 0 /\ 1 <= main_x /\ 1 + main_y + main_oldy <= main_x, {main_x -> main_y, main_y -> undef6, main_oldy -> main_y, rest remain the same}>
0.00/0.28	New Graphs: 
0.00/0.28	
0.00/0.28	LOG: CALL check - Post:main_x <= 0 - Process 4
0.00/0.28	* Exit transition: <l0, l2, 0 <= main_x /\ main_y + main_oldy <= 0 /\ 1 + main_y + main_oldy <= main_x /\ main_x = undef4 /\ main_y = undef5, {all remain the same}>
0.00/0.28	* Postcondition  : main_x <= 0
0.00/0.28	
0.00/0.28	LOG: CALL solveLinear
0.00/0.28	
0.00/0.28	LOG: RETURN solveLinear - Elapsed time: 0.000609s
0.00/0.28	> Postcondition is not implied!
0.00/0.28	
0.00/0.28	LOG: RETURN check - Elapsed time: 0.000727s
0.00/0.28	INVARIANTS: 
0.00/0.28	2: 
0.00/0.28	Quasi-INVARIANTS to narrow Graph: 
0.00/0.28	2: main_x <= 0 , 
0.00/0.28	Narrowing transition: 
0.00/0.28	<l2, l2, main_y + main_oldy <= 0 /\ 1 <= main_x /\ 1 + main_y + main_oldy <= main_x, {main_x -> main_y, main_y -> undef6, main_oldy -> main_y, rest remain the same}>
0.00/0.28	
0.00/0.28	LOG: Narrow transition size 1
0.00/0.28	invGraph after Narrowing: 
0.00/0.28	Transitions:
0.00/0.28	<l2, l2, main_y + main_oldy <= 0 /\ 1 <= main_x /\ 1 + main_y + main_oldy <= main_x, {main_x -> main_y, main_y -> undef6, main_oldy -> main_y, rest remain the same}>
0.00/0.28	Variables:
0.00/0.28	main_x, main_y, main_oldy
0.00/0.28	Checking conditional termination of SCC {l2}...
0.00/0.28	
0.00/0.28	LOG: CALL solveLinear
0.00/0.28	
0.00/0.28	LOG: RETURN solveLinear - Elapsed time: 0.000777s
0.00/0.28	
0.00/0.28	LOG: CALL solveLinear
0.00/0.28	
0.00/0.28	LOG: RETURN solveLinear - Elapsed time: 0.002740s
0.00/0.28	[54112 : 54134]
0.00/0.28	[54112 : 54135]
0.00/0.28	Successful child: 54134
0.00/0.28	[ Invariant Graph ]
0.00/0.28	Strengthening and disabling transitions...
0.00/0.28	
0.00/0.28	LOG: CALL solverLinear in Graph for feasibility
0.00/0.28	
0.00/0.28	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.28	Strengthening transition (result): 
0.00/0.28	<l2, l2, main_y + main_oldy <= 0 /\ 1 <= main_x /\ 1 + main_y + main_oldy <= main_x /\ main_x <= 1 + main_oldy, {main_x -> main_y, main_y -> undef6, main_oldy -> main_y, rest remain the same}>
0.00/0.28	[ Termination Graph ]
0.00/0.28	Strengthening and disabling transitions...
0.00/0.28	
0.00/0.28	LOG: CALL solverLinear in Graph for feasibility
0.00/0.28	
0.00/0.28	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.28	Strengthening transition (result): 
0.00/0.28	<l2, l2, main_y + main_oldy <= 0 /\ 1 <= main_x /\ 1 + main_y + main_oldy <= main_x /\ main_x <= 1 + main_oldy, {main_x -> main_y, main_y -> undef6, main_oldy -> main_y, rest remain the same}>
0.00/0.28	Ranking function: main_x
0.00/0.28	New Graphs: 
0.00/0.28	
0.00/0.28	LOG: CALL check - Post:main_x <= 1 + main_oldy - Process 5
0.00/0.28	* Exit transition: <l0, l2, main_y + main_oldy <= 0 /\ 1 <= main_x /\ 1 + main_y + main_oldy <= main_x /\ main_x = undef4 /\ main_y = undef5, {all remain the same}>
0.00/0.28	* Postcondition  : main_x <= 1 + main_oldy
0.00/0.28	
0.00/0.28	LOG: CALL solveLinear
0.00/0.28	
0.00/0.28	LOG: RETURN solveLinear - Elapsed time: 0.000510s
0.00/0.28	> Postcondition is not implied!
0.00/0.28	
0.00/0.28	LOG: RETURN check - Elapsed time: 0.000640s
0.00/0.28	INVARIANTS: 
0.00/0.28	2: 
0.00/0.28	Quasi-INVARIANTS to narrow Graph: 
0.00/0.28	2: main_x <= 1 + main_oldy , 
0.00/0.28	It's unfeasible. Removing transition: 
0.00/0.28	<l2, l2, main_y + main_oldy <= 0 /\ 1 <= main_x /\ 1 + main_y + main_oldy <= main_x, {main_x -> main_y, main_y -> undef6, main_oldy -> main_y, rest remain the same}>
0.00/0.28	invGraph after Narrowing: 
0.00/0.28	Transitions:
0.00/0.28	Variables:
0.00/0.28	main_x, main_y, main_oldy
0.00/0.28	Analyzing SCC {l2}...
0.00/0.28	No cycles found.
0.00/0.28	
0.00/0.28	Proving termination of subgraph 2
0.00/0.28	Analyzing SCC {l7}...
0.00/0.28	No cycles found.
0.00/0.28	
0.00/0.28	Program Terminates
0.00/0.28	EOF