16.93/6.07	NO
16.93/6.07	
16.93/6.07	Solver Timeout: 4
16.93/6.07	Global Timeout: 300
16.93/6.07	Maximum number of concurrent processes: 900
16.93/6.07	*******************************************************************************************
16.93/6.07	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
16.93/6.07	*******************************************************************************************
16.93/6.07	
16.93/6.07	
16.93/6.07	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
16.93/6.07	
16.93/6.07	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
16.93/6.07	+                                                                  +
16.93/6.07	Init Location: 0
16.93/6.07	Transitions:
16.93/6.07	<l0, l1, true, seq{main__func_return_ -> 0, main_a -> ¿functionCall(__VERIFIER_nondet_int), main_b -> ¿functionCall(__VERIFIER_nondet_int), main_c -> ¿functionCall(__VERIFIER_nondet_int)}>
16.93/6.07	<l1, l2, true>
16.93/6.07	<l2, l6, not(((main_b - main_c) >= 1))>
16.93/6.07	<l2, l3, ((main_b - main_c) >= 1)>
16.93/6.07	<l3, l6, not((main_a = main_c))>
16.93/6.07	<l3, l4, (main_a = main_c)>
16.93/6.07	<l4, l5, true, seq{main_r -> ¿functionCall(__VERIFIER_nondet_int), main_b -> 10, main_c -> ((main_c + 1) + main_r), main_a -> main_c}>
16.93/6.07	<l5, l2, true>
16.93/6.07	<l6, l7, true, seq{main__func_return_ -> 0}>
16.93/6.07	
16.93/6.07	Fresh variables:
16.93/6.07	
16.93/6.07	Undef variables:
16.93/6.07	
16.93/6.07	Abstraction variables:
16.93/6.07	
16.93/6.07	Exit nodes:
16.93/6.07	
16.93/6.07	Accepting locations:
16.93/6.07	
16.93/6.07	Asserts:
16.93/6.07	
16.93/6.07	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
16.93/6.07	       
16.93/6.07	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
16.93/6.07	       
16.93/6.07	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
16.93/6.07	
16.93/6.07	Init Location: 0
16.93/6.07	Transitions:
16.93/6.07	<l0, l8, true, seq{main__func_return_ -> 0}>
16.93/6.07	<l8, l9, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
16.93/6.07	<l9, l10, true, seq{main_a -> varCall_1}>
16.93/6.07	<l10, l11, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}>
16.93/6.07	<l11, l12, true, seq{main_b -> varCall_2}>
16.93/6.07	<l12, l13, true, seq{varCall_3 -> ¿functionCall(__VERIFIER_nondet_int)}>
16.93/6.07	<l13, l1, true, seq{main_c -> varCall_3}>
16.93/6.07	<l1, l2, true>
16.93/6.07	<l2, l3, ((main_b - main_c) >= 1)>
16.93/6.07	<l2, l6, not(((main_b - main_c) >= 1))>
16.93/6.07	<l3, l4, (main_a = main_c)>
16.93/6.07	<l3, l6, not((main_a = main_c))>
16.93/6.07	<l4, l14, true, seq{varCall_4 -> ¿functionCall(__VERIFIER_nondet_int)}>
16.93/6.07	<l14, l5, true, seq{main_r -> varCall_4, main_b -> 10, main_c -> ((main_c + 1) + main_r), main_a -> main_c}>
16.93/6.07	<l5, l2, true>
16.93/6.07	<l6, l7, true, seq{main__func_return_ -> 0}>
16.93/6.07	
16.93/6.07	Fresh variables:
16.93/6.07	
16.93/6.07	Undef variables:
16.93/6.07	
16.93/6.07	Abstraction variables:
16.93/6.07	
16.93/6.07	Exit nodes:
16.93/6.07	7, 
16.93/6.07	Accepting locations:
16.93/6.07	
16.93/6.07	Asserts:
16.93/6.07	
16.93/6.07	+                                                                  +
16.93/6.07	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
16.93/6.07	
16.93/6.07	
16.93/6.07	Function Return and Parameters Information [2 functions]:
16.93/6.07	    function name: __VERIFIER_nondet_int [1 return + 0 parameters]        demangled: __VERIFIER_nondet_int
16.93/6.07	        __VERIFIER_nondet_int__func_return_      [function result] : int
16.93/6.07	    function name: main [1 return + 0 parameters]        demangled: main
16.93/6.07	        main__func_return_      [function result] : int
16.93/6.07	
16.93/6.07	
16.93/6.07	AST Ident Scanner Information [6 idents]:
16.93/6.07	__VERIFIER_nondet_int | function | [integer, ()] | <line: 3, col: 1> | <line: 10, col: 9> <line: 11, col: 9> <line: 12, col: 9> <line: 15, col: 13>
16.93/6.07	main | function | [integer, ()] | <line: 5, col: 1>
16.93/6.07	a | local variable | integer | <line: 6, col: 5> | <line: 10, col: 5> <line: 14, col: 30> <line: 18, col: 9>
16.93/6.07	b | local variable | integer | <line: 7, col: 5> | <line: 11, col: 5> <line: 14, col: 14> <line: 16, col: 9>
16.93/6.07	c | local variable | integer | <line: 8, col: 5> | <line: 12, col: 5> <line: 14, col: 18> <line: 14, col: 35> <line: 17, col: 9> <line: 17, col: 13> <line: 18, col: 13>
16.93/6.07	r | local variable | integer | <line: 9, col: 5> | <line: 15, col: 9> <line: 17, col: 21>
16.93/6.07	
16.93/6.07	Main function: main
16.93/6.07	Preprocessed LLVMGraph
16.93/6.07	Init Location: 0
16.93/6.07	Transitions:
16.93/6.07	<l0, l2, (main_a = undef5) /\ (main_b = undef6) /\ (main_c = undef7)>
16.93/6.07	<l2, l2, ((main_b - main_c) >= 1) /\ (main_a = main_c), par{main_a -> ((main_c + 1) + undef8), main_b -> 10, main_c -> ((main_c + 1) + undef8)}>
16.93/6.07	<l2, l7, ((main_b - main_c) >= 1) /\ (main_a < main_c)>
16.93/6.07	<l2, l7, ((main_b - main_c) >= 1) /\ (main_a > main_c)>
16.93/6.07	<l2, l7, not(((main_b - main_c) >= 1))>
16.93/6.07	
16.93/6.07	Fresh variables:
16.93/6.07	undef5, undef6, undef7, undef8, 
16.93/6.07	
16.93/6.07	Undef variables:
16.93/6.07	undef5, undef6, undef7, undef8, 
16.93/6.07	
16.93/6.07	Abstraction variables:
16.93/6.07	
16.93/6.07	Exit nodes:
16.93/6.07	7, 
16.93/6.07	Accepting locations:
16.93/6.07	
16.93/6.07	Asserts:
16.93/6.07	
16.93/6.07	*************************************************************
16.93/6.07	*******************************************************************************************
16.93/6.07	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
16.93/6.07	*******************************************************************************************
16.93/6.07	
16.93/6.07	Init Location: 0
16.93/6.07	Graph 0:
16.93/6.07	Transitions:
16.93/6.07	Variables:
16.93/6.07	
16.93/6.07	Graph 1:
16.93/6.07	Transitions:
16.93/6.07	<l2, l2, 1 + main_c <= main_b /\ main_a = main_c, {main_a -> 1 + main_c + undef8, main_b -> 10, main_c -> 1 + main_c + undef8, rest remain the same}>
16.93/6.07	Variables:
16.93/6.07	main_a, main_b, main_c
16.93/6.07	
16.93/6.07	Graph 2:
16.93/6.07	Transitions:
16.93/6.07	Variables:
16.93/6.07	
16.93/6.07	Precedence: 
16.93/6.07	Graph 0
16.93/6.07	
16.93/6.07	Graph 1
16.93/6.07	<l0, l2, main_a = undef5 /\ main_b = undef6 /\ main_c = undef7, {all remain the same}>
16.93/6.07	
16.93/6.07	Graph 2
16.93/6.07	<l2, l7, 1 + main_a <= main_c /\ 1 + main_c <= main_b, {all remain the same}>
16.93/6.07	<l2, l7, 1 + main_c <= main_a /\ 1 + main_c <= main_b, {all remain the same}>
16.93/6.07	<l2, l7, main_b <= main_c, {all remain the same}>
16.93/6.07	
16.93/6.07	Map Locations to Subgraph:
16.93/6.07	( 0 , 0 )
16.93/6.07	( 2 , 1 )
16.93/6.07	( 7 , 2 )
16.93/6.07	
16.93/6.07	*******************************************************************************************
16.93/6.07	********************************    CHECKING ASSERTIONS    ********************************
16.93/6.07	*******************************************************************************************
16.93/6.07	
16.93/6.07	Proving termination of subgraph 0
16.93/6.07	Proving termination of subgraph 1
16.93/6.07	Checking unfeasibility...
16.93/6.07	Time used: 0.002829
16.93/6.07	
16.93/6.07	Checking conditional termination of SCC {l2}...
16.93/6.07	
16.93/6.07	LOG: CALL solveLinear
16.93/6.07	
16.93/6.07	LOG: RETURN solveLinear - Elapsed time: 0.000694s
16.93/6.07	
16.93/6.07	LOG: CALL solveLinear
16.93/6.07	
16.93/6.07	LOG: RETURN solveLinear - Elapsed time: 0.002348s
16.93/6.07	[35732 : 35734]
16.93/6.07	[35732 : 35735]
16.93/6.07	Successful child: 35734
16.93/6.07	[ Invariant Graph ]
16.93/6.07	Strengthening and disabling transitions...
16.93/6.07	
16.93/6.07	LOG: CALL solverLinear in Graph for feasibility
16.93/6.07	
16.93/6.07	LOG: RETURN solveLinear in Graph for feasibility
16.93/6.07	It's unfeasible. Removing transition: 
16.93/6.07	<l2, l2, 1 + main_c <= main_b /\ main_a = main_c, {main_a -> 1 + main_c + undef8, main_b -> 10, main_c -> 1 + main_c + undef8, rest remain the same}>
16.93/6.07	[ Termination Graph ]
16.93/6.07	Strengthening and disabling transitions...
16.93/6.07	
16.93/6.07	LOG: CALL solverLinear in Graph for feasibility
16.93/6.07	
16.93/6.07	LOG: RETURN solveLinear in Graph for feasibility
16.93/6.07	It's unfeasible. Removing transition: 
16.93/6.07	<l2, l2, 1 + main_c <= main_b /\ main_a = main_c, {main_a -> 1 + main_c + undef8, main_b -> 10, main_c -> 1 + main_c + undef8, rest remain the same}>
16.93/6.07	New Graphs: 
16.93/6.07	
16.93/6.07	LOG: CALL check - Post:1 + main_c <= main_a - Process 1
16.93/6.07	* Exit transition: <l0, l2, main_a = undef5 /\ main_b = undef6 /\ main_c = undef7, {all remain the same}>
16.93/6.07	* Postcondition  : 1 + main_c <= main_a
16.93/6.07	
16.93/6.07	LOG: CALL solveLinear
16.93/6.07	
16.93/6.07	LOG: RETURN solveLinear - Elapsed time: 0.000587s
16.93/6.07	> Postcondition is not implied!
16.93/6.07	
16.93/6.07	LOG: RETURN check - Elapsed time: 0.000696s
16.93/6.07	INVARIANTS: 
16.93/6.07	2: 
16.93/6.07	Quasi-INVARIANTS to narrow Graph: 
16.93/6.07	2: 1 + main_c <= main_a , 
16.93/6.07	Narrowing transition: 
16.93/6.07	<l2, l2, 1 + main_c <= main_b /\ main_a = main_c, {main_a -> 1 + main_c + undef8, main_b -> 10, main_c -> 1 + main_c + undef8, rest remain the same}>
16.93/6.07	
16.93/6.07	LOG: Narrow transition size 1
16.93/6.07	invGraph after Narrowing: 
16.93/6.07	Transitions:
16.93/6.07	<l2, l2, 1 + main_c <= main_b /\ main_a = main_c, {main_a -> 1 + main_c + undef8, main_b -> 10, main_c -> 1 + main_c + undef8, rest remain the same}>
16.93/6.07	Variables:
16.93/6.07	main_a, main_b, main_c
16.93/6.07	Checking conditional termination of SCC {l2}...
16.93/6.07	
16.93/6.07	LOG: CALL solveLinear
16.93/6.07	
16.93/6.07	LOG: RETURN solveLinear - Elapsed time: 0.000645s
16.93/6.07	
16.93/6.07	LOG: CALL solveLinear
16.93/6.07	
16.93/6.07	LOG: RETURN solveLinear - Elapsed time: 0.002510s
16.93/6.07	[35732 : 35739]
16.93/6.07	[35732 : 35740]
16.93/6.07	Successful child: 35739
16.93/6.07	[ Invariant Graph ]
16.93/6.07	Strengthening and disabling transitions...
16.93/6.07	
16.93/6.07	LOG: CALL solverLinear in Graph for feasibility
16.93/6.07	
16.93/6.07	LOG: RETURN solveLinear in Graph for feasibility
16.93/6.07	It's unfeasible. Removing transition: 
16.93/6.07	<l2, l2, 1 + main_c <= main_b /\ main_a = main_c, {main_a -> 1 + main_c + undef8, main_b -> 10, main_c -> 1 + main_c + undef8, rest remain the same}>
16.93/6.07	[ Termination Graph ]
16.93/6.07	Strengthening and disabling transitions...
16.93/6.07	
16.93/6.07	LOG: CALL solverLinear in Graph for feasibility
16.93/6.07	
16.93/6.07	LOG: RETURN solveLinear in Graph for feasibility
16.93/6.07	It's unfeasible. Removing transition: 
16.93/6.07	<l2, l2, 1 + main_c <= main_b /\ main_a = main_c, {main_a -> 1 + main_c + undef8, main_b -> 10, main_c -> 1 + main_c + undef8, rest remain the same}>
16.93/6.07	New Graphs: 
16.93/6.07	
16.93/6.07	LOG: CALL check - Post:1 + main_a <= main_c - Process 2
16.93/6.07	* Exit transition: <l0, l2, main_a <= main_c /\ main_a = undef5 /\ main_b = undef6 /\ main_c = undef7, {all remain the same}>
16.93/6.07	* Postcondition  : 1 + main_a <= main_c
16.93/6.07	
16.93/6.07	LOG: CALL solveLinear
16.93/6.07	
16.93/6.07	LOG: RETURN solveLinear - Elapsed time: 0.000708s
16.93/6.07	> Postcondition is not implied!
16.93/6.07	
16.93/6.07	LOG: RETURN check - Elapsed time: 0.000823s
16.93/6.07	INVARIANTS: 
16.93/6.07	2: 
16.93/6.07	Quasi-INVARIANTS to narrow Graph: 
16.93/6.07	2: 1 + main_a <= main_c , 
16.93/6.07	Narrowing transition: 
16.93/6.07	<l2, l2, 1 + main_c <= main_b /\ main_a = main_c, {main_a -> 1 + main_c + undef8, main_b -> 10, main_c -> 1 + main_c + undef8, rest remain the same}>
16.93/6.07	
16.93/6.07	LOG: Narrow transition size 1
16.93/6.07	invGraph after Narrowing: 
16.93/6.07	Transitions:
16.93/6.07	<l2, l2, 1 + main_c <= main_b /\ main_a = main_c, {main_a -> 1 + main_c + undef8, main_b -> 10, main_c -> 1 + main_c + undef8, rest remain the same}>
16.93/6.07	Variables:
16.93/6.07	main_a, main_b, main_c
16.93/6.07	Checking conditional termination of SCC {l2}...
16.93/6.07	
16.93/6.07	LOG: CALL solveLinear
16.93/6.07	
16.93/6.07	LOG: RETURN solveLinear - Elapsed time: 0.000656s
16.93/6.07	
16.93/6.07	LOG: CALL solveLinear
16.93/6.07	
16.93/6.07	LOG: RETURN solveLinear - Elapsed time: 0.002457s
16.93/6.07	[35732 : 35744]
16.93/6.07	[35732 : 35745]
16.93/6.07	Successful child: 35744
16.93/6.07	[ Invariant Graph ]
16.93/6.07	Strengthening and disabling transitions...
16.93/6.07	
16.93/6.07	LOG: CALL solverLinear in Graph for feasibility
16.93/6.07	
16.93/6.07	LOG: RETURN solveLinear in Graph for feasibility
16.93/6.07	It's unfeasible. Removing transition: 
16.93/6.07	<l2, l2, 1 + main_c <= main_b /\ main_a = main_c, {main_a -> 1 + main_c + undef8, main_b -> 10, main_c -> 1 + main_c + undef8, rest remain the same}>
16.93/6.07	[ Termination Graph ]
16.93/6.07	Strengthening and disabling transitions...
16.93/6.07	> It's unfeasible. Removing transition: 
16.93/6.07	<l2, l2, 1 + main_c <= main_b /\ main_a = main_c, {main_a -> 1 + main_c + undef8, main_b -> 10, main_c -> 1 + main_c + undef8, rest remain the same}>
16.93/6.07	New Graphs: 
16.93/6.07	
16.93/6.07	LOG: CALL check - Post:main_b <= main_a - Process 3
16.93/6.07	* Exit transition: <l0, l2, main_a = main_c /\ main_a = undef5 /\ main_b = undef6 /\ main_c = undef7, {all remain the same}>
16.93/6.07	* Postcondition  : main_b <= main_a
16.93/6.07	
16.93/6.07	LOG: CALL solveLinear
16.93/6.07	
16.93/6.07	LOG: RETURN solveLinear - Elapsed time: 0.000752s
16.93/6.07	> Postcondition is not implied!
16.93/6.07	
16.93/6.07	LOG: RETURN check - Elapsed time: 0.000866s
16.93/6.07	INVARIANTS: 
16.93/6.07	2: 
16.93/6.07	Quasi-INVARIANTS to narrow Graph: 
16.93/6.07	2: main_b <= main_a , 
16.93/6.07	Narrowing transition: 
16.93/6.07	<l2, l2, 1 + main_c <= main_b /\ main_a = main_c, {main_a -> 1 + main_c + undef8, main_b -> 10, main_c -> 1 + main_c + undef8, rest remain the same}>
16.93/6.07	
16.93/6.07	LOG: Narrow transition size 1
16.93/6.07	invGraph after Narrowing: 
16.93/6.07	Transitions:
16.93/6.07	<l2, l2, 1 + main_a <= main_b /\ 1 + main_c <= main_b /\ main_a = main_c, {main_a -> 1 + main_c + undef8, main_b -> 10, main_c -> 1 + main_c + undef8, rest remain the same}>
16.93/6.07	Variables:
16.93/6.07	main_a, main_b, main_c
16.93/6.07	Checking conditional termination of SCC {l2}...
16.93/6.07	
16.93/6.07	LOG: CALL solveLinear
16.93/6.07	
16.93/6.07	LOG: RETURN solveLinear - Elapsed time: 0.000735s
16.93/6.07	
16.93/6.07	LOG: CALL solveLinear
16.93/6.07	
16.93/6.07	LOG: RETURN solveLinear - Elapsed time: 0.002728s
16.93/6.07	[35732 : 35749]
16.93/6.07	[35732 : 35750]
16.93/6.07	Solving with 1 template(s).
16.93/6.07	
16.93/6.07	LOG: CALL solveNonLinearGetFirstSolution
16.93/6.07	
16.93/6.07	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011845s
16.93/6.07	Time used: 0.011401
16.93/6.07	
16.93/6.07	[35732 : 35754]
16.93/6.07	[35732 : 35758]
16.93/6.07	Successful child: 35754
16.93/6.07	
16.93/6.07	Program does NOT terminate
16.93/6.07	EOF