25.83/16.67	NO
25.83/16.67	
25.83/16.67	Solver Timeout: 4
25.83/16.67	Global Timeout: 300
25.83/16.67	Maximum number of concurrent processes: 900
25.83/16.67	*******************************************************************************************
25.83/16.67	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
25.83/16.67	*******************************************************************************************
25.83/16.67	
25.83/16.67	
25.83/16.67	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
25.83/16.67	
25.83/16.67	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
25.83/16.67	+                                                                  +
25.83/16.67	Init Location: 0
25.83/16.67	Transitions:
25.83/16.67	<l0, l1, true, seq{main__func_return_ -> 0, main_i -> 0}>
25.83/16.67	<l1, l2, true>
25.83/16.67	<l2, l9, not((main_i < 100))>
25.83/16.67	<l2, l3, (main_i < 100)>
25.83/16.67	<l3, l4, (main_i < 50)>
25.83/16.67	<l3, l6, not((main_i < 50))>
25.83/16.67	<l4, l5, true, seq{main_i -> 51}>
25.83/16.67	<l5, l8, true>
25.83/16.67	<l6, l7, true, seq{main_i -> 49}>
25.83/16.67	<l7, l8, true>
25.83/16.67	<l8, l2, true>
25.83/16.67	<l9, l10, true, seq{main__func_return_ -> 0}>
25.83/16.67	
25.83/16.67	Fresh variables:
25.83/16.67	
25.83/16.67	Undef variables:
25.83/16.67	
25.83/16.67	Abstraction variables:
25.83/16.67	
25.83/16.67	Exit nodes:
25.83/16.67	
25.83/16.67	Accepting locations:
25.83/16.67	
25.83/16.67	Asserts:
25.83/16.67	
25.83/16.67	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
25.83/16.67	       
25.83/16.67	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
25.83/16.67	       
25.83/16.67	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
25.83/16.67	
25.83/16.67	Init Location: 0
25.83/16.67	Transitions:
25.83/16.67	<l0, l1, true, seq{main__func_return_ -> 0, main_i -> 0}>
25.83/16.67	<l1, l2, true>
25.83/16.67	<l2, l3, (main_i < 100)>
25.83/16.67	<l2, l9, not((main_i < 100))>
25.83/16.67	<l3, l4, (main_i < 50)>
25.83/16.67	<l3, l6, not((main_i < 50))>
25.83/16.67	<l4, l5, true, seq{main_i -> 51}>
25.83/16.67	<l5, l8, true>
25.83/16.67	<l6, l7, true, seq{main_i -> 49}>
25.83/16.67	<l7, l8, true>
25.83/16.67	<l8, l2, true>
25.83/16.67	<l9, l10, true, seq{main__func_return_ -> 0}>
25.83/16.67	
25.83/16.67	Fresh variables:
25.83/16.67	
25.83/16.67	Undef variables:
25.83/16.67	
25.83/16.67	Abstraction variables:
25.83/16.67	
25.83/16.67	Exit nodes:
25.83/16.67	10, 
25.83/16.67	Accepting locations:
25.83/16.67	
25.83/16.67	Asserts:
25.83/16.67	
25.83/16.67	+                                                                  +
25.83/16.67	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
25.83/16.67	
25.83/16.67	
25.83/16.67	Function Return and Parameters Information [1 functions]:
25.83/16.67	    function name: main [1 return + 0 parameters]        demangled: main
25.83/16.67	        main__func_return_      [function result] : int
25.83/16.67	
25.83/16.67	
25.83/16.67	AST Ident Scanner Information [3 idents]:
25.83/16.67	__VERIFIER_nondet_int | function | [integer, ()] | <line: 3, col: 1>
25.83/16.67	main | function | [integer, ()] | <line: 5, col: 1>
25.83/16.67	i | local variable | integer | <line: 6, col: 5> | <line: 7, col: 5> <line: 9, col: 12> <line: 10, col: 13> <line: 10, col: 23> <line: 11, col: 16>
25.83/16.67	
25.83/16.67	Main function: main
25.83/16.67	Preprocessed LLVMGraph
25.83/16.67	Init Location: 0
25.83/16.67	Transitions:
25.83/16.67	<l0, l2, (main_i = 0)>
25.83/16.67	<l2, l2, (main_i < 100) /\ (main_i < 50), par{main_i -> 51}>
25.83/16.67	<l2, l2, (main_i < 100) /\ not((main_i < 50)), par{main_i -> 49}>
25.83/16.67	<l2, l10, not((main_i < 100))>
25.83/16.67	
25.83/16.67	Fresh variables:
25.83/16.67	
25.83/16.67	Undef variables:
25.83/16.67	
25.83/16.67	Abstraction variables:
25.83/16.67	
25.83/16.67	Exit nodes:
25.83/16.67	10, 
25.83/16.67	Accepting locations:
25.83/16.67	
25.83/16.67	Asserts:
25.83/16.67	
25.83/16.67	*************************************************************
25.83/16.67	*******************************************************************************************
25.83/16.67	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
25.83/16.67	*******************************************************************************************
25.83/16.67	
25.83/16.67	Init Location: 0
25.83/16.67	Graph 0:
25.83/16.67	Transitions:
25.83/16.67	Variables:
25.83/16.67	
25.83/16.67	Graph 1:
25.83/16.67	Transitions:
25.83/16.67	<l2, l2, main_i <= 49, {main_i -> 51, rest remain the same}>
25.83/16.67	<l2, l2, 50 <= main_i /\ main_i <= 99, {main_i -> 49, rest remain the same}>
25.83/16.67	Variables:
25.83/16.67	main_i
25.83/16.67	
25.83/16.67	Graph 2:
25.83/16.67	Transitions:
25.83/16.67	Variables:
25.83/16.67	
25.83/16.67	Precedence: 
25.83/16.67	Graph 0
25.83/16.67	
25.83/16.67	Graph 1
25.83/16.67	<l0, l2, main_i = 0, {all remain the same}>
25.83/16.67	
25.83/16.67	Graph 2
25.83/16.67	<l2, l10, 100 <= main_i, {all remain the same}>
25.83/16.67	
25.83/16.67	Map Locations to Subgraph:
25.83/16.67	( 0 , 0 )
25.83/16.67	( 2 , 1 )
25.83/16.67	( 10 , 2 )
25.83/16.67	
25.83/16.67	*******************************************************************************************
25.83/16.67	********************************    CHECKING ASSERTIONS    ********************************
25.83/16.67	*******************************************************************************************
25.83/16.67	
25.83/16.67	Proving termination of subgraph 0
25.83/16.67	Proving termination of subgraph 1
25.83/16.67	Checking unfeasibility...
25.83/16.67	Time used: 4.10119
25.83/16.67	
25.83/16.67	Checking conditional termination of SCC {l2}...
25.83/16.67	
25.83/16.67	LOG: CALL solveLinear
25.83/16.67	
25.83/16.67	LOG: RETURN solveLinear - Elapsed time: 0.004861s
25.83/16.67	
25.83/16.67	LOG: CALL solveLinear
25.83/16.67	
25.83/16.67	LOG: RETURN solveLinear - Elapsed time: 0.007970s
25.83/16.67	[14342 : 14344]
25.83/16.67	[14342 : 14345]
25.83/16.67	Solving with 1 template(s).
25.83/16.67	
25.83/16.67	LOG: CALL solveNonLinearGetFirstSolution
25.83/16.67	
25.83/16.67	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.102880s
25.83/16.67	Time used: 4.10152
25.83/16.67	Termination failed. Trying to show unreachability...
25.83/16.67	Proving unreachability of entry: <l0, l2, main_i = 0, {all remain the same}>
25.83/16.67	
25.83/16.67	LOG: CALL check - Post:1 <= 0 - Process 1
25.83/16.67	* Exit transition: <l0, l2, main_i = 0, {all remain the same}>
25.83/16.67	* Postcondition  : 1 <= 0
25.83/16.67	
25.83/16.67	LOG: CALL solveLinear
25.83/16.67	
25.83/16.67	LOG: RETURN solveLinear - Elapsed time: 0.007270s
25.83/16.67	> Postcondition is not implied!
25.83/16.67	
25.83/16.67	LOG: RETURN check - Elapsed time: 0.007377s
25.83/16.67	Cannot prove unreachability
25.83/16.67	
25.83/16.67	[14342 : 14350]
25.83/16.67	[14342 : 14354]
25.83/16.67	Successful child: 14350
25.83/16.67	
25.83/16.67	Program does NOT terminate
25.83/16.67	EOF