24.04/13.73	NO
24.04/13.73	
24.04/13.73	Solver Timeout: 4
24.04/13.73	Global Timeout: 300
24.04/13.73	Maximum number of concurrent processes: 900
24.04/13.73	*******************************************************************************************
24.04/13.73	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
24.04/13.73	*******************************************************************************************
24.04/13.73	
24.04/13.73	
24.04/13.73	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
24.04/13.73	
24.04/13.73	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
24.04/13.73	+                                                                  +
24.04/13.73	Init Location: 0
24.04/13.73	Transitions:
24.04/13.73	<l0, l1, true, seq{main__func_return_ -> 0, main_i -> 3}>
24.04/13.73	<l1, l2, true>
24.04/13.73	<l2, l13, not((main_i >= 3))>
24.04/13.73	<l2, l3, (main_i >= 3)>
24.04/13.73	<l3, l4, (main_i > 5)>
24.04/13.73	<l3, l6, not((main_i > 5))>
24.04/13.73	<l4, l5, true, seq{main_i -> (main_i + 3)}>
24.04/13.73	<l5, l12, true>
24.04/13.73	<l6, l7, (main_i > 10)>
24.04/13.73	<l6, l9, not((main_i > 10))>
24.04/13.73	<l7, l8, true, seq{main_i -> (main_i - 2)}>
24.04/13.73	<l8, l11, true>
24.04/13.73	<l9, l10, true, seq{main_i -> (main_i + 1)}>
24.04/13.73	<l10, l11, true>
24.04/13.73	<l11, l12, true>
24.04/13.73	<l12, l2, true>
24.04/13.73	<l13, l14, true, seq{main__func_return_ -> 0}>
24.04/13.73	
24.04/13.73	Fresh variables:
24.04/13.73	
24.04/13.73	Undef variables:
24.04/13.73	
24.04/13.73	Abstraction variables:
24.04/13.73	
24.04/13.73	Exit nodes:
24.04/13.73	
24.04/13.73	Accepting locations:
24.04/13.73	
24.04/13.73	Asserts:
24.04/13.73	
24.04/13.73	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
24.04/13.73	       
24.04/13.73	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
24.04/13.73	       
24.04/13.73	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
24.04/13.73	
24.04/13.73	Init Location: 0
24.04/13.73	Transitions:
24.04/13.73	<l0, l1, true, seq{main__func_return_ -> 0, main_i -> 3}>
24.04/13.73	<l1, l2, true>
24.04/13.73	<l2, l3, (main_i >= 3)>
24.04/13.73	<l2, l13, not((main_i >= 3))>
24.04/13.73	<l3, l4, (main_i > 5)>
24.04/13.73	<l3, l6, not((main_i > 5))>
24.04/13.73	<l4, l5, true, seq{main_i -> (main_i + 3)}>
24.04/13.73	<l5, l12, true>
24.04/13.73	<l6, l7, (main_i > 10)>
24.04/13.73	<l6, l9, not((main_i > 10))>
24.04/13.73	<l7, l8, true, seq{main_i -> (main_i - 2)}>
24.04/13.73	<l8, l11, true>
24.04/13.73	<l9, l10, true, seq{main_i -> (main_i + 1)}>
24.04/13.73	<l10, l11, true>
24.04/13.73	<l11, l12, true>
24.04/13.73	<l12, l2, true>
24.04/13.73	<l13, l14, true, seq{main__func_return_ -> 0}>
24.04/13.73	
24.04/13.73	Fresh variables:
24.04/13.73	
24.04/13.73	Undef variables:
24.04/13.73	
24.04/13.73	Abstraction variables:
24.04/13.73	
24.04/13.73	Exit nodes:
24.04/13.73	14, 
24.04/13.73	Accepting locations:
24.04/13.73	
24.04/13.73	Asserts:
24.04/13.73	
24.04/13.73	+                                                                  +
24.04/13.73	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
24.04/13.73	
24.04/13.73	
24.04/13.73	Function Return and Parameters Information [1 functions]:
24.04/13.73	    function name: main [1 return + 0 parameters]        demangled: main
24.04/13.73	        main__func_return_      [function result] : int
24.04/13.73	
24.04/13.73	
24.04/13.73	AST Ident Scanner Information [3 idents]:
24.04/13.73	__VERIFIER_nondet_int | function | [integer, ()] | <line: 3, col: 1>
24.04/13.73	main | function | [integer, ()] | <line: 5, col: 1>
24.04/13.73	i | local variable | integer | <line: 6, col: 5> | <line: 7, col: 5> <line: 9, col: 12> <line: 10, col: 13> <line: 11, col: 13> <line: 11, col: 17> <line: 13, col: 17> <line: 14, col: 17> <line: 14, col: 21> <line: 16, col: 17> <line: 16, col: 21>
24.04/13.73	
24.04/13.73	Main function: main
24.04/13.73	Preprocessed LLVMGraph
24.04/13.73	Init Location: 0
24.04/13.73	Transitions:
24.04/13.73	<l0, l2, (main_i = 3)>
24.04/13.73	<l2, l2, (main_i >= 3) /\ (main_i > 5), par{main_i -> (main_i + 3)}>
24.04/13.73	<l2, l2, (main_i >= 3) /\ not((main_i > 5)) /\ not((main_i > 10)), par{main_i -> (main_i + 1)}>
24.04/13.73	<l2, l14, not((main_i >= 3))>
24.04/13.73	
24.04/13.73	Fresh variables:
24.04/13.73	
24.04/13.73	Undef variables:
24.04/13.73	
24.04/13.73	Abstraction variables:
24.04/13.73	
24.04/13.73	Exit nodes:
24.04/13.73	14, 
24.04/13.73	Accepting locations:
24.04/13.73	
24.04/13.73	Asserts:
24.04/13.73	
24.04/13.73	*************************************************************
24.04/13.73	*******************************************************************************************
24.04/13.73	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
24.04/13.73	*******************************************************************************************
24.04/13.73	
24.04/13.73	Init Location: 0
24.04/13.73	Graph 0:
24.04/13.73	Transitions:
24.04/13.73	Variables:
24.04/13.73	
24.04/13.73	Graph 1:
24.04/13.73	Transitions:
24.04/13.73	<l2, l2, 6 <= main_i, {main_i -> 3 + main_i, rest remain the same}>
24.04/13.73	<l2, l2, 3 <= main_i /\ main_i <= 5, {main_i -> 1 + main_i, rest remain the same}>
24.04/13.73	Variables:
24.04/13.73	main_i
24.04/13.73	
24.04/13.73	Graph 2:
24.04/13.73	Transitions:
24.04/13.73	Variables:
24.04/13.73	
24.04/13.73	Precedence: 
24.04/13.73	Graph 0
24.04/13.73	
24.04/13.73	Graph 1
24.04/13.73	<l0, l2, main_i = 3, {all remain the same}>
24.04/13.73	
24.04/13.73	Graph 2
24.04/13.73	<l2, l14, main_i <= 2, {all remain the same}>
24.04/13.73	
24.04/13.73	Map Locations to Subgraph:
24.04/13.73	( 0 , 0 )
24.04/13.73	( 2 , 1 )
24.04/13.73	( 14 , 2 )
24.04/13.73	
24.04/13.73	*******************************************************************************************
24.04/13.73	********************************    CHECKING ASSERTIONS    ********************************
24.04/13.73	*******************************************************************************************
24.04/13.73	
24.04/13.73	Proving termination of subgraph 0
24.04/13.73	Proving termination of subgraph 1
24.04/13.73	Checking unfeasibility...
24.04/13.73	Time used: 0.263662
24.04/13.73	
24.04/13.73	Checking conditional termination of SCC {l2}...
24.04/13.73	
24.04/13.73	LOG: CALL solveLinear
24.04/13.73	
24.04/13.73	LOG: RETURN solveLinear - Elapsed time: 0.001393s
24.04/13.73	Ranking function: 6 - main_i
24.04/13.73	New Graphs: 
24.04/13.73	Transitions:
24.04/13.73	<l2, l2, 6 <= main_i, {main_i -> 3 + main_i, rest remain the same}>
24.04/13.73	Variables:
24.04/13.73	main_i
24.04/13.73	Checking conditional termination of SCC {l2}...
24.04/13.73	
24.04/13.73	LOG: CALL solveLinear
24.04/13.73	
24.04/13.73	LOG: RETURN solveLinear - Elapsed time: 0.000375s
24.04/13.73	
24.04/13.73	LOG: CALL solveLinear
24.04/13.73	
24.04/13.73	LOG: RETURN solveLinear - Elapsed time: 0.001165s
24.04/13.73	[53068 : 53070]
24.04/13.73	[53068 : 53071]
24.04/13.73	Solving with 1 template(s).
24.04/13.73	
24.04/13.73	LOG: CALL solveNonLinearGetFirstSolution
24.04/13.73	
24.04/13.73	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008253s
24.04/13.73	Time used: 0.007869
24.04/13.73	Improving Solution with cost 1 ...
24.04/13.73	
24.04/13.73	LOG: CALL solveNonLinearGetNextSolution
24.04/13.73	
24.04/13.73	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000245s
24.04/13.73	Time used: 1.00025
24.04/13.73	
24.04/13.73	LOG: SAT solveNonLinear - Elapsed time: 1.008497s
24.04/13.73	Cost: 1; Total time: 1.00811
24.04/13.73	Termination implied by a set of invariant(s):
24.04/13.73	Invariant at l2: 0 <= main_i
24.04/13.73	[ Invariant Graph ]
24.04/13.73	Strengthening and disabling transitions...
24.04/13.73	
24.04/13.73	LOG: CALL solverLinear in Graph for feasibility
24.04/13.73	
24.04/13.73	LOG: RETURN solveLinear in Graph for feasibility
24.04/13.73	Strengthening transition (result): 
24.04/13.73	<l2, l2, 6 <= main_i, {main_i -> 3 + main_i, rest remain the same}>
24.04/13.73	
24.04/13.73	LOG: CALL solverLinear in Graph for feasibility
24.04/13.73	
24.04/13.73	LOG: RETURN solveLinear in Graph for feasibility
24.04/13.73	Strengthening transition (result): 
24.04/13.73	<l2, l2, 3 <= main_i /\ main_i <= 5, {main_i -> 1 + main_i, rest remain the same}>
24.04/13.73	[ Termination Graph ]
24.04/13.73	Strengthening and disabling transitions...
24.04/13.73	
24.04/13.73	LOG: CALL solverLinear in Graph for feasibility
24.04/13.73	
24.04/13.73	LOG: RETURN solveLinear in Graph for feasibility
24.04/13.73	Strengthening transition (result): 
24.04/13.73	<l2, l2, 6 <= main_i, {main_i -> 3 + main_i, rest remain the same}>
24.04/13.73	Quasi-ranking function: 50000 - main_i
24.04/13.73	New Graphs: 
24.04/13.73	Transitions:
24.04/13.73	<l2, l2, 50001 <= main_i, {main_i -> 3 + main_i, rest remain the same}>
24.04/13.73	Variables:
24.04/13.73	main_i
24.04/13.73	Checking conditional termination of SCC {l2}...
24.04/13.73	
24.04/13.73	LOG: CALL solveLinear
24.04/13.73	
24.04/13.73	LOG: RETURN solveLinear - Elapsed time: 0.000411s
24.04/13.73	
24.04/13.73	LOG: CALL solveLinear
24.04/13.73	
24.04/13.73	LOG: RETURN solveLinear - Elapsed time: 0.001222s
24.04/13.73	[53068 : 53075]
24.04/13.73	[53068 : 53076]
24.04/13.73	Solving with 1 template(s).
24.04/13.73	
24.04/13.73	LOG: CALL solveNonLinearGetFirstSolution
24.04/13.73	
24.04/13.73	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.102194s
24.04/13.73	Time used: 4.10179
24.04/13.73	Termination failed. Trying to show unreachability...
24.04/13.73	Proving unreachability of entry: <l0, l2, main_i = 3, {all remain the same}>
24.04/13.73	
24.04/13.73	LOG: CALL check - Post:1 <= 0 - Process 1
24.04/13.73	* Exit transition: <l0, l2, main_i = 3, {all remain the same}>
24.04/13.73	* Postcondition  : 1 <= 0
24.04/13.73	
24.04/13.73	LOG: CALL solveLinear
24.04/13.73	
24.04/13.73	LOG: RETURN solveLinear - Elapsed time: 0.014624s
24.04/13.73	> Postcondition is not implied!
24.04/13.73	
24.04/13.73	LOG: RETURN check - Elapsed time: 0.014728s
24.04/13.73	Cannot prove unreachability
24.04/13.73	
24.04/13.73	[53068 : 53080]
24.04/13.73	[53068 : 53084]
24.04/13.73	Successful child: 53080
24.04/13.73	
24.04/13.73	Program does NOT terminate
24.04/13.73	EOF