67.17/31.75	NO
67.17/31.75	
67.17/31.75	Solver Timeout: 4
67.17/31.75	Global Timeout: 300
67.17/31.75	Maximum number of concurrent processes: 900
67.17/31.75	/export/starexec/sandbox/benchmark/theBenchmark.c:15:38: warning: '&&' within '||'
67.17/31.75	    while (z > 0 && (y == 0 || y > 0 && x > 0)) {
67.17/31.75	                            ~~ ~~~~~~^~~~~~~~
67.17/31.75	/export/starexec/sandbox/benchmark/theBenchmark.c:15:38: note: place parentheses around the '&&' expression to silence this warning
67.17/31.75	    while (z > 0 && (y == 0 || y > 0 && x > 0)) {
67.17/31.75	                                     ^
67.17/31.75	                               (             )
67.17/31.75	1 warning generated.
67.17/31.75	/export/starexec/sandbox/benchmark/theBenchmark.c:15:38: warning: '&&' within '||'
67.17/31.75	    while (z > 0 && (y == 0 || y > 0 && x > 0)) {
67.17/31.75	                            ~~ ~~~~~~^~~~~~~~
67.17/31.75	/export/starexec/sandbox/benchmark/theBenchmark.c:15:38: note: place parentheses around the '&&' expression to silence this warning
67.17/31.75	    while (z > 0 && (y == 0 || y > 0 && x > 0)) {
67.17/31.75	                                     ^
67.17/31.75	                               (             )
67.17/31.75	2 warnings generated.
67.17/31.75	*******************************************************************************************
67.17/31.75	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
67.17/31.75	*******************************************************************************************
67.17/31.75	
67.17/31.75	
67.17/31.75	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
67.17/31.75	
67.17/31.75	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
67.17/31.75	+                                                                  +
67.17/31.75	Init Location: 0
67.17/31.75	Transitions:
67.17/31.75	<l0, l1, true, seq{main__func_return_ -> 0, main_x -> ¿functionCall(__VERIFIER_nondet_int), main_y -> ¿functionCall(__VERIFIER_nondet_int), main_z -> main_y, main_res -> 0}>
67.17/31.75	<l1, l2, true>
67.17/31.75	<l2, l12, not((main_z > 0))>
67.17/31.75	<l2, l3, (main_z > 0)>
67.17/31.75	<l3, l4, not((main_y = 0))>
67.17/31.75	<l3, l6, (main_y = 0)>
67.17/31.75	<l4, l12, not((main_y > 0))>
67.17/31.75	<l4, l5, (main_y > 0)>
67.17/31.75	<l5, l12, not((main_x > 0))>
67.17/31.75	<l5, l6, (main_x > 0)>
67.17/31.75	<l6, l7, (main_y = 0)>
67.17/31.75	<l6, l9, not((main_y = 0))>
67.17/31.75	<l7, l8, true, seq{main_res -> (main_res + 1), main_y -> main_z}>
67.17/31.75	<l8, l11, true>
67.17/31.75	<l9, l10, true, seq{main_x -> (main_x + 1), main_y -> (main_y - 1)}>
67.17/31.75	<l10, l11, true>
67.17/31.75	<l11, l2, true>
67.17/31.75	<l12, l13, true, seq{main__func_return_ -> 0}>
67.17/31.75	
67.17/31.75	Fresh variables:
67.17/31.75	
67.17/31.75	Undef variables:
67.17/31.75	
67.17/31.75	Abstraction variables:
67.17/31.75	
67.17/31.75	Exit nodes:
67.17/31.75	
67.17/31.75	Accepting locations:
67.17/31.75	
67.17/31.75	Asserts:
67.17/31.75	
67.17/31.75	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
67.17/31.75	       
67.17/31.75	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
67.17/31.75	       
67.17/31.75	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
67.17/31.75	
67.17/31.75	Init Location: 0
67.17/31.75	Transitions:
67.17/31.75	<l0, l14, true, seq{main__func_return_ -> 0}>
67.17/31.75	<l14, l15, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
67.17/31.75	<l15, l16, true, seq{main_x -> varCall_1}>
67.17/31.75	<l16, l17, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}>
67.17/31.75	<l17, l1, true, seq{main_y -> varCall_2, main_z -> main_y, main_res -> 0}>
67.17/31.75	<l1, l2, true>
67.17/31.75	<l2, l3, (main_z > 0)>
67.17/31.75	<l2, l12, not((main_z > 0))>
67.17/31.75	<l3, l6, (main_y = 0)>
67.17/31.75	<l3, l4, not((main_y = 0))>
67.17/31.75	<l4, l5, (main_y > 0)>
67.17/31.75	<l4, l12, not((main_y > 0))>
67.17/31.75	<l5, l6, (main_x > 0)>
67.17/31.75	<l5, l12, not((main_x > 0))>
67.17/31.75	<l6, l7, (main_y = 0)>
67.17/31.75	<l6, l9, not((main_y = 0))>
67.17/31.75	<l7, l8, true, seq{main_res -> (main_res + 1), main_y -> main_z}>
67.17/31.75	<l8, l11, true>
67.17/31.75	<l9, l10, true, seq{main_x -> (main_x + 1), main_y -> (main_y - 1)}>
67.17/31.75	<l10, l11, true>
67.17/31.75	<l11, l2, true>
67.17/31.75	<l12, l13, true, seq{main__func_return_ -> 0}>
67.17/31.75	
67.17/31.75	Fresh variables:
67.17/31.75	
67.17/31.75	Undef variables:
67.17/31.75	
67.17/31.75	Abstraction variables:
67.17/31.75	
67.17/31.75	Exit nodes:
67.17/31.75	13, 
67.17/31.75	Accepting locations:
67.17/31.75	
67.17/31.75	Asserts:
67.17/31.75	
67.17/31.75	+                                                                  +
67.17/31.75	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
67.17/31.75	
67.17/31.75	
67.17/31.75	Function Return and Parameters Information [2 functions]:
67.17/31.75	    function name: __VERIFIER_nondet_int [1 return + 0 parameters]        demangled: __VERIFIER_nondet_int
67.17/31.75	        __VERIFIER_nondet_int__func_return_      [function result] : int
67.17/31.75	    function name: main [1 return + 0 parameters]        demangled: main
67.17/31.75	        main__func_return_      [function result] : int
67.17/31.75	
67.17/31.75	
67.17/31.75	AST Ident Scanner Information [6 idents]:
67.17/31.75	__VERIFIER_nondet_int | function | [integer, ()] | <line: 3, col: 1> | <line: 10, col: 9> <line: 11, col: 9>
67.17/31.75	main | function | [integer, ()] | <line: 5, col: 1>
67.17/31.75	x | local variable | integer | <line: 6, col: 5> | <line: 10, col: 5> <line: 15, col: 41> <line: 22, col: 13> <line: 22, col: 17>
67.17/31.75	y | local variable | integer | <line: 7, col: 5> | <line: 11, col: 5> <line: 12, col: 9> <line: 15, col: 22> <line: 15, col: 32> <line: 17, col: 13> <line: 19, col: 13> <line: 23, col: 13> <line: 23, col: 17>
67.17/31.75	z | local variable | integer | <line: 8, col: 5> | <line: 12, col: 5> <line: 15, col: 12> <line: 19, col: 17>
67.17/31.75	res | local variable | integer | <line: 9, col: 5> | <line: 13, col: 5> <line: 18, col: 13> <line: 18, col: 19>
67.17/31.75	
67.17/31.75	Main function: main
67.17/31.75	Preprocessed LLVMGraph
67.17/31.75	Init Location: 0
67.17/31.75	Transitions:
67.17/31.75	<l0, l2, (main_x = undef3) /\ (main_y = undef4) /\ (main_z = undef4) /\ (main_res = 0)>
67.17/31.75	<l2, l2, (main_z > 0) /\ (main_y = 0) /\ (main_y = 0), par{main_y -> main_z, main_res -> (main_res + 1)}>
67.17/31.75	<l2, l13, (main_z > 0) /\ (main_y < 0) /\ not((main_y > 0))>
67.17/31.75	<l2, l2, (main_z > 0) /\ (main_y > 0) /\ (main_y > 0) /\ (main_x > 0) /\ (main_y > 0), par{main_x -> (main_x + 1), main_y -> (main_y - 1)}>
67.17/31.75	<l2, l13, (main_z > 0) /\ (main_y > 0) /\ (main_y > 0) /\ not((main_x > 0))>
67.17/31.75	<l2, l13, not((main_z > 0))>
67.17/31.75	
67.17/31.75	Fresh variables:
67.17/31.75	undef3, undef4, 
67.17/31.75	
67.17/31.75	Undef variables:
67.17/31.75	undef3, undef4, 
67.17/31.75	
67.17/31.75	Abstraction variables:
67.17/31.75	
67.17/31.75	Exit nodes:
67.17/31.75	13, 
67.17/31.75	Accepting locations:
67.17/31.75	
67.17/31.75	Asserts:
67.17/31.75	
67.17/31.75	*************************************************************
67.17/31.75	*******************************************************************************************
67.17/31.75	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
67.17/31.75	*******************************************************************************************
67.17/31.75	
67.17/31.75	Init Location: 0
67.17/31.75	Graph 0:
67.17/31.75	Transitions:
67.17/31.75	Variables:
67.17/31.75	
67.17/31.75	Graph 1:
67.17/31.75	Transitions:
67.17/31.75	<l2, l2, 1 <= main_z /\ main_y = 0, {main_y -> main_z, main_res -> 1 + main_res, rest remain the same}>
67.17/31.75	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ 1 <= main_z, {main_x -> 1 + main_x, main_y -> -1 + main_y, rest remain the same}>
67.17/31.75	Variables:
67.17/31.75	main_y, main_z, main_res, main_x
67.17/31.75	
67.17/31.75	Graph 2:
67.17/31.75	Transitions:
67.17/31.75	Variables:
67.17/31.75	
67.17/31.75	Precedence: 
67.17/31.75	Graph 0
67.17/31.75	
67.17/31.75	Graph 1
67.17/31.75	<l0, l2, main_x = undef3 /\ main_y = undef4 /\ main_z = undef4 /\ main_res = 0, {all remain the same}>
67.17/31.75	
67.17/31.75	Graph 2
67.17/31.75	<l2, l13, 1 + main_y <= 0 /\ 1 <= main_z, {all remain the same}>
67.17/31.75	<l2, l13, main_x <= 0 /\ 1 <= main_y /\ 1 <= main_z, {all remain the same}>
67.17/31.75	<l2, l13, main_z <= 0, {all remain the same}>
67.17/31.75	
67.17/31.75	Map Locations to Subgraph:
67.17/31.75	( 0 , 0 )
67.17/31.75	( 2 , 1 )
67.17/31.75	( 13 , 2 )
67.17/31.75	
67.17/31.75	*******************************************************************************************
67.17/31.75	********************************    CHECKING ASSERTIONS    ********************************
67.17/31.75	*******************************************************************************************
67.17/31.75	
67.17/31.75	Proving termination of subgraph 0
67.17/31.75	Proving termination of subgraph 1
67.17/31.75	Checking unfeasibility...
67.17/31.75	Time used: 0.007302
67.17/31.75	
67.17/31.75	Checking conditional termination of SCC {l2}...
67.17/31.75	
67.17/31.75	LOG: CALL solveLinear
67.17/31.75	
67.17/31.75	LOG: RETURN solveLinear - Elapsed time: 0.001262s
67.17/31.75	
67.17/31.75	LOG: CALL solveLinear
67.17/31.75	
67.17/31.75	LOG: RETURN solveLinear - Elapsed time: 0.010158s
67.17/31.75	[33670 : 33672]
67.17/31.75	[33670 : 33673]
67.17/31.75	Successful child: 33672
67.17/31.75	[ Invariant Graph ]
67.17/31.75	Strengthening and disabling transitions...
67.17/31.75	
67.17/31.75	LOG: CALL solverLinear in Graph for feasibility
67.17/31.75	
67.17/31.75	LOG: RETURN solveLinear in Graph for feasibility
67.17/31.75	Strengthening transition (result): 
67.17/31.75	<l2, l2, main_x + main_y <= main_z + main_res /\ main_z + main_res <= main_y /\ 1 <= main_z /\ main_z <= 1 + main_y /\ main_y = 0, {main_y -> main_z, main_res -> 1 + main_res, rest remain the same}>
67.17/31.75	
67.17/31.75	LOG: CALL solverLinear in Graph for feasibility
67.17/31.75	
67.17/31.75	LOG: RETURN solveLinear in Graph for feasibility
67.17/31.75	It's unfeasible. Removing transition: 
67.17/31.75	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ 1 <= main_z, {main_x -> 1 + main_x, main_y -> -1 + main_y, rest remain the same}>
67.17/31.75	[ Termination Graph ]
67.17/31.75	Strengthening and disabling transitions...
67.17/31.75	
67.17/31.75	LOG: CALL solverLinear in Graph for feasibility
67.17/31.75	
67.17/31.75	LOG: RETURN solveLinear in Graph for feasibility
67.17/31.75	Strengthening transition (result): 
67.17/31.75	<l2, l2, main_x + main_y <= main_z + main_res /\ main_z + main_res <= main_y /\ 1 <= main_z /\ main_z <= 1 + main_y /\ main_y = 0, {main_y -> main_z, main_res -> 1 + main_res, rest remain the same}>
67.17/31.75	
67.17/31.75	LOG: CALL solverLinear in Graph for feasibility
67.17/31.75	
67.17/31.75	LOG: RETURN solveLinear in Graph for feasibility
67.17/31.75	It's unfeasible. Removing transition: 
67.17/31.75	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ 1 <= main_z, {main_x -> 1 + main_x, main_y -> -1 + main_y, rest remain the same}>
67.17/31.75	New Graphs: 
67.17/31.75	Transitions:
67.17/31.75	<l2, l2, main_x + main_y <= main_z + main_res /\ main_z + main_res <= main_y /\ 1 <= main_z /\ main_z <= 1 + main_y /\ main_y = 0, {main_y -> main_z, main_res -> 1 + main_res, rest remain the same}>
67.17/31.75	Variables:
67.17/31.75	main_x, main_y, main_z, main_res
67.17/31.75	Checking conditional termination of SCC {l2}...
67.17/31.75	
67.17/31.75	LOG: CALL solveLinear
67.17/31.75	
67.17/31.75	LOG: RETURN solveLinear - Elapsed time: 0.001200s
67.17/31.75	Ranking function: -main_y
67.17/31.75	New Graphs: 
67.17/31.75	
67.17/31.75	LOG: CALL check - Post:main_x + main_y <= main_z + main_res - Process 1
67.17/31.75	* Exit transition: <l0, l2, main_x = undef3 /\ main_y = undef4 /\ main_z = undef4 /\ main_res = 0, {all remain the same}>
67.17/31.75	* Postcondition  : main_x + main_y <= main_z + main_res
67.17/31.75	
67.17/31.75	LOG: CALL solveLinear
67.17/31.75	
67.17/31.75	LOG: RETURN solveLinear - Elapsed time: 0.000661s
67.17/31.75	> Postcondition is not implied!
67.17/31.75	
67.17/31.75	LOG: RETURN check - Elapsed time: 0.000800s
67.17/31.75	INVARIANTS: 
67.17/31.75	2: 
67.17/31.75	Quasi-INVARIANTS to narrow Graph: 
67.17/31.75	2: main_x + main_y <= main_z + main_res , main_z + main_res <= main_y , main_z <= 1 + main_y , 
67.17/31.75	Narrowing transition: 
67.17/31.75	<l2, l2, 1 <= main_z /\ main_y = 0, {main_y -> main_z, main_res -> 1 + main_res, rest remain the same}>
67.17/31.75	
67.17/31.75	LOG: Narrow transition size 3
67.17/31.75	Narrowing transition: 
67.17/31.75	<l2, l2, 1 <= main_x /\ 1 <= main_y /\ 1 <= main_z, {main_x -> 1 + main_x, main_y -> -1 + main_y, rest remain the same}>
67.17/31.75	
67.17/31.75	LOG: Narrow transition size 3
67.17/31.75	invGraph after Narrowing: 
67.17/31.75	Transitions:
67.17/31.75	<l2, l2, main_x + main_y <= main_z + main_res /\ main_z + main_res <= main_y /\ 1 <= main_z /\ 2 + main_y <= main_z /\ main_y = 0, {main_y -> main_z, main_res -> 1 + main_res, rest remain the same}>
67.17/31.75	<l2, l2, main_x + main_y <= main_z + main_res /\ 1 + main_y <= main_z + main_res /\ 1 <= main_z /\ main_y = 0, {main_y -> main_z, main_res -> 1 + main_res, rest remain the same}>
67.17/31.75	<l2, l2, 1 + main_z + main_res <= main_x + main_y /\ 1 <= main_z /\ main_y = 0, {main_y -> main_z, main_res -> 1 + main_res, rest remain the same}>
67.17/31.75	<l2, l2, main_x + main_y <= main_z + main_res /\ 1 <= main_x /\ 1 + main_y <= main_z + main_res /\ 1 <= main_y /\ 1 <= main_z, {main_x -> 1 + main_x, main_y -> -1 + main_y, rest remain the same}>
67.17/31.75	<l2, l2, 1 <= main_x /\ 1 + main_z + main_res <= main_x + main_y /\ 1 <= main_y /\ 1 <= main_z, {main_x -> 1 + main_x, main_y -> -1 + main_y, rest remain the same}>
67.17/31.75	Variables:
67.17/31.75	main_y, main_z, main_res, main_x
67.17/31.75	Checking conditional termination of SCC {l2}...
67.17/31.75	
67.17/31.75	LOG: CALL solveLinear
67.17/31.75	
67.17/31.75	LOG: RETURN solveLinear - Elapsed time: 0.004182s
67.17/31.75	Ranking function: 1 - 3*main_x - 3*main_y - 4*main_z - 4*main_res
67.17/31.75	New Graphs: 
67.17/31.75	Transitions:
67.17/31.75	<l2, l2, main_x + main_y <= main_z + main_res /\ 1 + main_y <= main_z + main_res /\ 1 <= main_z /\ main_y = 0, {main_y -> main_z, main_res -> 1 + main_res, rest remain the same}>
67.17/31.75	<l2, l2, 1 + main_z + main_res <= main_x + main_y /\ 1 <= main_z /\ main_y = 0, {main_y -> main_z, main_res -> 1 + main_res, rest remain the same}>
67.17/31.75	<l2, l2, main_x + main_y <= main_z + main_res /\ 1 <= main_x /\ 1 + main_y <= main_z + main_res /\ 1 <= main_y /\ 1 <= main_z, {main_x -> 1 + main_x, main_y -> -1 + main_y, rest remain the same}>
67.17/31.75	<l2, l2, 1 <= main_x /\ 1 + main_z + main_res <= main_x + main_y /\ 1 <= main_y /\ 1 <= main_z, {main_x -> 1 + main_x, main_y -> -1 + main_y, rest remain the same}>
67.17/31.75	Variables:
67.17/31.75	main_x, main_y, main_z, main_res
67.17/31.75	Checking conditional termination of SCC {l2}...
67.17/31.75	
67.17/31.75	LOG: CALL solveLinear
67.17/31.75	
67.17/31.75	LOG: RETURN solveLinear - Elapsed time: 0.002619s
67.17/31.75	
67.17/31.75	LOG: CALL solveLinear
67.17/31.75	
67.17/31.75	LOG: RETURN solveLinear - Elapsed time: 0.119600s
67.17/31.75	[33670 : 33677]
67.17/31.75	[33670 : 33678]
67.17/31.75	Solving with 1 template(s).
67.17/31.75	
67.17/31.75	LOG: CALL solveNonLinearGetFirstSolution
67.17/31.75	
67.17/31.75	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.075801s
67.17/31.75	Time used: 0.073183
67.17/31.75	
67.17/31.75	LOG: SAT solveNonLinear - Elapsed time: 0.075801s
67.17/31.75	Cost: 0; Total time: 0.073183
67.17/31.75	Termination implied by a set of invariant(s):
67.17/31.75	Invariant at l2: 1 + main_z + main_res <= main_x + main_y
67.17/31.75	[ Invariant Graph ]
67.17/31.75	Strengthening and disabling transitions...
67.17/31.75	
67.17/31.75	LOG: CALL solverLinear in Graph for feasibility
67.17/31.75	
67.17/31.75	LOG: RETURN solveLinear in Graph for feasibility
67.17/31.75	It's unfeasible. Removing transition: 
67.17/31.75	<l2, l2, main_x + main_y <= main_z + main_res /\ main_z + main_res <= main_y /\ 1 <= main_z /\ 2 + main_y <= main_z /\ main_y = 0, {main_y -> main_z, main_res -> 1 + main_res, rest remain the same}>
67.17/31.75	
67.17/31.75	LOG: CALL solverLinear in Graph for feasibility
67.17/31.75	
67.17/31.75	LOG: RETURN solveLinear in Graph for feasibility
67.17/31.75	It's unfeasible. Removing transition: 
67.17/31.75	<l2, l2, main_x + main_y <= main_z + main_res /\ 1 + main_y <= main_z + main_res /\ 1 <= main_z /\ main_y = 0, {main_y -> main_z, main_res -> 1 + main_res, rest remain the same}>
67.17/31.75	
67.17/31.75	LOG: CALL solverLinear in Graph for feasibility
67.17/31.75	
67.17/31.75	LOG: RETURN solveLinear in Graph for feasibility
67.17/31.75	Strengthening transition (result): 
67.17/31.75	<l2, l2, 1 + main_z + main_res <= main_x + main_y /\ 1 <= main_z /\ main_y = 0, {main_y -> main_z, main_res -> 1 + main_res, rest remain the same}>
67.17/31.75	
67.17/31.75	LOG: CALL solverLinear in Graph for feasibility
67.17/31.75	
67.17/31.75	LOG: RETURN solveLinear in Graph for feasibility
67.17/31.75	It's unfeasible. Removing transition: 
67.17/31.75	<l2, l2, main_x + main_y <= main_z + main_res /\ 1 <= main_x /\ 1 + main_y <= main_z + main_res /\ 1 <= main_y /\ 1 <= main_z, {main_x -> 1 + main_x, main_y -> -1 + main_y, rest remain the same}>
67.17/31.75	
67.17/31.75	LOG: CALL solverLinear in Graph for feasibility
67.17/31.75	
67.17/31.75	LOG: RETURN solveLinear in Graph for feasibility
67.17/31.75	Strengthening transition (result): 
67.17/31.75	<l2, l2, 1 <= main_x /\ 1 + main_z + main_res <= main_x + main_y /\ 1 <= main_y /\ 1 <= main_z, {main_x -> 1 + main_x, main_y -> -1 + main_y, rest remain the same}>
67.17/31.75	[ Termination Graph ]
67.17/31.75	Strengthening and disabling transitions...
67.17/31.75	> It's unfeasible. Removing transition: 
67.17/31.75	<l2, l2, main_x + main_y <= main_z + main_res /\ 1 <= main_x /\ 1 + main_y <= main_z + main_res /\ 1 <= main_y /\ 1 <= main_z, {main_x -> 1 + main_x, main_y -> -1 + main_y, rest remain the same}>
67.17/31.75	
67.17/31.75	LOG: CALL solverLinear in Graph for feasibility
67.17/31.75	
67.17/31.75	LOG: RETURN solveLinear in Graph for feasibility
67.17/31.75	It's unfeasible. Removing transition: 
67.17/31.75	<l2, l2, main_x + main_y <= main_z + main_res /\ 1 + main_y <= main_z + main_res /\ 1 <= main_z /\ main_y = 0, {main_y -> main_z, main_res -> 1 + main_res, rest remain the same}>
67.17/31.75	
67.17/31.75	LOG: CALL solverLinear in Graph for feasibility
67.17/31.75	
67.17/31.75	LOG: RETURN solveLinear in Graph for feasibility
67.17/31.75	Strengthening transition (result): 
67.17/31.75	<l2, l2, 1 + main_z + main_res <= main_x + main_y /\ 1 <= main_z /\ main_y = 0, {main_y -> main_z, main_res -> 1 + main_res, rest remain the same}>
67.17/31.75	
67.17/31.75	LOG: CALL solverLinear in Graph for feasibility
67.17/31.75	
67.17/31.75	LOG: RETURN solveLinear in Graph for feasibility
67.17/31.75	Strengthening transition (result): 
67.17/31.75	<l2, l2, 1 <= main_x /\ 1 + main_z + main_res <= main_x + main_y /\ 1 <= main_y /\ 1 <= main_z, {main_x -> 1 + main_x, main_y -> -1 + main_y, rest remain the same}>
67.17/31.75	New Graphs: 
67.17/31.75	Transitions:
67.17/31.75	<l2, l2, 1 + main_z + main_res <= main_x + main_y /\ 1 <= main_z /\ main_y = 0, {main_y -> main_z, main_res -> 1 + main_res, rest remain the same}>
67.17/31.75	<l2, l2, 1 <= main_x /\ 1 + main_z + main_res <= main_x + main_y /\ 1 <= main_y /\ 1 <= main_z, {main_x -> 1 + main_x, main_y -> -1 + main_y, rest remain the same}>
67.17/31.75	Variables:
67.17/31.75	main_x, main_y, main_z, main_res
67.17/31.75	Checking conditional termination of SCC {l2}...
67.17/31.75	
67.17/31.75	LOG: CALL solveLinear
67.17/31.75	
67.17/31.75	LOG: RETURN solveLinear - Elapsed time: 0.001393s
67.17/31.75	
67.17/31.75	LOG: CALL solveLinear
67.17/31.75	
67.17/31.75	LOG: RETURN solveLinear - Elapsed time: 0.017369s
67.17/31.75	[33670 : 33682]
67.17/31.75	[33670 : 33683]
67.17/31.75	Successful child: 33682
67.17/31.75	[ Invariant Graph ]
67.17/31.75	Strengthening and disabling transitions...
67.17/31.75	
67.17/31.75	LOG: CALL solverLinear in Graph for feasibility
67.17/31.75	
67.17/31.75	LOG: RETURN solveLinear in Graph for feasibility
67.17/31.75	It's unfeasible. Removing transition: 
67.17/31.75	<l2, l2, 1 + main_z + main_res <= main_x + main_y /\ 1 <= main_z /\ main_y = 0, {main_y -> main_z, main_res -> 1 + main_res, rest remain the same}>
67.17/31.75	
67.17/31.75	LOG: CALL solverLinear in Graph for feasibility
67.17/31.75	
67.17/31.75	LOG: RETURN solveLinear in Graph for feasibility
67.17/31.75	It's unfeasible. Removing transition: 
67.17/31.75	<l2, l2, 1 <= main_x /\ 1 + main_z + main_res <= main_x + main_y /\ 1 <= main_y /\ 1 <= main_z, {main_x -> 1 + main_x, main_y -> -1 + main_y, rest remain the same}>
67.17/31.75	[ Termination Graph ]
67.17/31.75	Strengthening and disabling transitions...
67.17/31.75	> It's unfeasible. Removing transition: 
67.17/31.75	<l2, l2, 1 <= main_x /\ 1 + main_z + main_res <= main_x + main_y /\ 1 <= main_y /\ 1 <= main_z, {main_x -> 1 + main_x, main_y -> -1 + main_y, rest remain the same}>
67.17/31.75	
67.17/31.75	LOG: CALL solverLinear in Graph for feasibility
67.17/31.75	
67.17/31.75	LOG: RETURN solveLinear in Graph for feasibility
67.17/31.75	It's unfeasible. Removing transition: 
67.17/31.75	<l2, l2, 1 + main_z + main_res <= main_x + main_y /\ 1 <= main_z /\ main_y = 0, {main_y -> main_z, main_res -> 1 + main_res, rest remain the same}>
67.17/31.75	New Graphs: 
67.17/31.75	INVARIANTS: 
67.17/31.75	2: 1 + main_z + main_res <= main_x + main_y , 
67.17/31.75	Quasi-INVARIANTS to narrow Graph: 
67.17/31.75	2: 
67.17/31.75	
67.17/31.75	LOG: CALL check - Post:main_y <= 0 - Process 2
67.17/31.75	* Exit transition: <l0, l2, 1 + main_z + main_res <= main_x + main_y /\ main_x = undef3 /\ main_y = undef4 /\ main_z = undef4 /\ main_res = 0, {all remain the same}>
67.17/31.75	* Postcondition  : main_y <= 0
67.17/31.75	
67.17/31.75	LOG: CALL solveLinear
67.17/31.75	
67.17/31.75	LOG: RETURN solveLinear - Elapsed time: 0.000890s
67.17/31.75	> Postcondition is not implied!
67.17/31.75	
67.17/31.75	LOG: RETURN check - Elapsed time: 0.001008s
67.17/31.75	INVARIANTS: 
67.17/31.75	2: 
67.17/31.75	Quasi-INVARIANTS to narrow Graph: 
67.17/31.75	2: main_y <= 0 , main_z <= main_y , 1 + main_res <= main_x , 
67.17/31.75	It's unfeasible. Removing transition: 
67.17/31.75	<l2, l2, main_x + main_y <= main_z + main_res /\ main_z + main_res <= main_y /\ 1 <= main_z /\ 2 + main_y <= main_z /\ main_y = 0, {main_y -> main_z, main_res -> 1 + main_res, rest remain the same}>
67.17/31.75	It's unfeasible. Removing transition: 
67.17/31.75	<l2, l2, main_x + main_y <= main_z + main_res /\ 1 + main_y <= main_z + main_res /\ 1 <= main_z /\ main_y = 0, {main_y -> main_z, main_res -> 1 + main_res, rest remain the same}>
67.17/31.75	Narrowing transition: 
67.17/31.75	<l2, l2, 1 + main_z + main_res <= main_x + main_y /\ 1 <= main_z /\ main_y = 0, {main_y -> main_z, main_res -> 1 + main_res, rest remain the same}>
67.17/31.75	
67.17/31.75	LOG: Narrow transition size 3
67.17/31.75	It's unfeasible. Removing transition: 
67.17/31.75	<l2, l2, main_x + main_y <= main_z + main_res /\ 1 <= main_x /\ 1 + main_y <= main_z + main_res /\ 1 <= main_y /\ 1 <= main_z, {main_x -> 1 + main_x, main_y -> -1 + main_y, rest remain the same}>
67.17/31.75	Narrowing transition: 
67.17/31.75	<l2, l2, 1 <= main_x /\ 1 + main_z + main_res <= main_x + main_y /\ 1 <= main_y /\ 1 <= main_z, {main_x -> 1 + main_x, main_y -> -1 + main_y, rest remain the same}>
67.17/31.75	
67.17/31.75	LOG: Narrow transition size 3
67.17/31.75	invGraph after Narrowing: 
67.17/31.75	Transitions:
67.17/31.75	<l2, l2, 1 + main_z + main_res <= main_x + main_y /\ 1 + main_y <= main_z /\ 1 <= main_z /\ main_y = 0, {main_y -> main_z, main_res -> 1 + main_res, rest remain the same}>
67.17/31.75	<l2, l2, 1 <= main_x /\ 1 + main_z + main_res <= main_x + main_y /\ 1 <= main_y /\ 1 <= main_z, {main_x -> 1 + main_x, main_y -> -1 + main_y, rest remain the same}>
67.17/31.75	Variables:
67.17/31.75	main_y, main_z, main_res, main_x
67.17/31.75	Checking conditional termination of SCC {l2}...
67.17/31.75	
67.17/31.75	LOG: CALL solveLinear
67.17/31.75	
67.17/31.75	LOG: RETURN solveLinear - Elapsed time: 0.001552s
67.17/31.75	
67.17/31.75	LOG: CALL solveLinear
67.17/31.75	
67.17/31.75	LOG: RETURN solveLinear - Elapsed time: 0.018356s
67.17/31.75	[33670 : 33687]
67.17/31.75	[33670 : 33688]
67.17/31.75	Solving with 1 template(s).
67.17/31.75	
67.17/31.75	LOG: CALL solveNonLinearGetFirstSolution
67.17/31.75	
67.17/31.75	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.051723s
67.17/31.75	Time used: 0.050091
67.17/31.75	Improving Solution with cost 1 ...
67.17/31.75	
67.17/31.75	LOG: CALL solveNonLinearGetNextSolution
67.17/31.75	
67.17/31.75	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000808s
67.17/31.75	Time used: 1.00057
67.17/31.75	
67.17/31.75	LOG: SAT solveNonLinear - Elapsed time: 1.052531s
67.17/31.75	Cost: 1; Total time: 1.05066
67.17/31.75	Quasi-ranking function: 50000 - main_res
67.17/31.75	New Graphs: 
67.17/31.75	Transitions:
67.17/31.75	<l2, l2, 1 + main_z + main_res <= main_x + main_y /\ 1 + main_y <= main_z /\ 1 <= main_z /\ 50001 <= main_res /\ main_y = 0, {main_y -> main_z, main_res -> 1 + main_res, rest remain the same}>
67.17/31.75	<l2, l2, 1 <= main_x /\ 1 + main_z + main_res <= main_x + main_y /\ 1 <= main_y /\ 1 <= main_z, {main_x -> 1 + main_x, main_y -> -1 + main_y, rest remain the same}>
67.17/31.75	Variables:
67.17/31.75	main_x, main_y, main_z, main_res
67.17/31.75	Checking conditional termination of SCC {l2}...
67.17/31.75	
67.17/31.75	LOG: CALL solveLinear
67.17/31.75	
67.17/31.75	LOG: RETURN solveLinear - Elapsed time: 0.001652s
67.17/31.75	
67.17/31.75	LOG: CALL solveLinear
67.17/31.75	
67.17/31.75	LOG: RETURN solveLinear - Elapsed time: 0.027667s
67.17/31.75	[33670 : 33697]
67.17/31.75	[33670 : 33698]
67.17/31.75	Solving with 1 template(s).
67.17/31.75	
67.17/31.75	LOG: CALL solveNonLinearGetFirstSolution
67.17/31.75	
67.17/31.75	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.050513s
67.17/31.75	Time used: 0.048471
67.17/31.75	Improving Solution with cost 1 ...
67.17/31.75	
67.17/31.75	LOG: CALL solveNonLinearGetNextSolution
67.17/31.75	
67.17/31.75	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001332s
67.17/31.75	Time used: 1.00125
67.17/31.75	
67.17/31.75	LOG: SAT solveNonLinear - Elapsed time: 1.051845s
67.17/31.75	Cost: 1; Total time: 1.04972
67.17/31.75	Termination implied by a set of invariant(s):
67.17/31.75	Invariant at l2: 0 <= main_y + main_z
67.17/31.75	[ Invariant Graph ]
67.17/31.75	Strengthening and disabling transitions...
67.17/31.75	
67.17/31.75	LOG: CALL solverLinear in Graph for feasibility
67.17/31.75	
67.17/31.75	LOG: RETURN solveLinear in Graph for feasibility
67.17/31.75	Strengthening transition (result): 
67.17/31.75	<l2, l2, 0 <= main_y + main_z /\ 1 + main_z + main_res <= main_x + main_y /\ 1 + main_y <= main_z /\ 1 <= main_z /\ main_y = 0, {main_y -> main_z, main_res -> 1 + main_res, rest remain the same}>
67.17/31.76	
67.17/31.76	LOG: CALL solverLinear in Graph for feasibility
67.17/31.76	
67.17/31.76	LOG: RETURN solveLinear in Graph for feasibility
67.17/31.76	Strengthening transition (result): 
67.17/31.76	<l2, l2, 0 <= main_y + main_z /\ 1 <= main_x /\ 1 + main_z + main_res <= main_x + main_y /\ 1 <= main_y /\ 1 <= main_z, {main_x -> 1 + main_x, main_y -> -1 + main_y, rest remain the same}>
67.17/31.76	[ Termination Graph ]
67.17/31.76	Strengthening and disabling transitions...
67.17/31.76	
67.17/31.76	LOG: CALL solverLinear in Graph for feasibility
67.17/31.76	
67.17/31.76	LOG: RETURN solveLinear in Graph for feasibility
67.17/31.76	Strengthening transition (result): 
67.17/31.76	<l2, l2, 0 <= main_y + main_z /\ 1 + main_z + main_res <= main_x + main_y /\ 1 + main_y <= main_z /\ 1 <= main_z /\ 50001 <= main_res /\ main_y = 0, {main_y -> main_z, main_res -> 1 + main_res, rest remain the same}>
67.17/31.76	
67.17/31.76	LOG: CALL solverLinear in Graph for feasibility
67.17/31.76	
67.17/31.76	LOG: RETURN solveLinear in Graph for feasibility
67.17/31.76	Strengthening transition (result): 
67.17/31.76	<l2, l2, 0 <= main_y + main_z /\ 1 <= main_x /\ 1 + main_z + main_res <= main_x + main_y /\ 1 <= main_y /\ 1 <= main_z, {main_x -> 1 + main_x, main_y -> -1 + main_y, rest remain the same}>
67.17/31.76	Quasi-ranking function: 50000 - main_x + 50002*main_z
67.17/31.76	New Graphs: 
67.17/31.76	Transitions:
67.17/31.76	<l2, l2, 0 <= main_y + main_z /\ 1 + main_z + main_res <= main_x + main_y /\ 1 + main_y <= main_z /\ 1 <= main_z /\ 50001 <= main_res /\ main_y = 0, {main_y -> main_z, main_res -> 1 + main_res, rest remain the same}>
67.17/31.76	<l2, l2, 0 <= main_y + main_z /\ 1 <= main_x /\ 1 + main_z + main_res <= main_x + main_y /\ 1 <= main_y /\ 1 <= main_z /\ 50001 + 50002*main_z <= main_x, {main_x -> 1 + main_x, main_y -> -1 + main_y, rest remain the same}>
67.17/31.76	Variables:
67.17/31.76	main_x, main_y, main_z, main_res
67.17/31.76	Checking conditional termination of SCC {l2}...
67.17/31.76	
67.17/31.76	LOG: CALL solveLinear
67.17/31.76	
67.17/31.76	LOG: RETURN solveLinear - Elapsed time: 0.001890s
67.17/31.76	
67.17/31.76	LOG: CALL solveLinear
67.17/31.76	
67.17/31.76	LOG: RETURN solveLinear - Elapsed time: 0.049212s
67.17/31.76	[33670 : 33702]
67.17/31.76	[33670 : 33703]
67.17/31.76	Solving with 1 template(s).
67.17/31.76	
67.17/31.76	LOG: CALL solveNonLinearGetFirstSolution
67.17/31.76	
67.17/31.76	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.102693s
67.17/31.76	Time used: 4.10003
67.17/31.76	
67.17/31.76	[33670 : 33889]
67.17/31.76	[33670 : 33893]
67.17/31.76	Successful child: 33889
67.17/31.76	
67.17/31.76	Program does NOT terminate
67.17/31.76	EOF