0.00/0.06	NO
0.00/0.06	
0.00/0.06	Solver Timeout: 4
0.00/0.06	Global Timeout: 300
0.00/0.06	Maximum number of concurrent processes: 900
0.00/0.06	*******************************************************************************************
0.00/0.06	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
0.00/0.06	*******************************************************************************************
0.00/0.06	
0.00/0.06	
0.00/0.06	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
0.00/0.06	
0.00/0.06	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
0.00/0.06	+                                                                  +
0.00/0.06	Init Location: 0
0.00/0.06	Transitions:
0.00/0.06	<l0, l1, true, seq{main__func_return_ -> 0, main_c -> 864}>
0.00/0.06	<l1, l2, (main_c <= 10)>
0.00/0.06	<l1, l8, not((main_c <= 10))>
0.00/0.06	<l2, l3, true, seq{main_i -> 0}>
0.00/0.06	<l3, l4, true>
0.00/0.06	<l4, l7, not((main_i < 100))>
0.00/0.06	<l4, l5, (main_i < 100)>
0.00/0.06	<l5, l6, true, seq{main_i -> (main_i + 1)}>
0.00/0.06	<l6, l4, true>
0.00/0.06	<l7, l29, true>
0.00/0.06	<l8, l9, (main_c <= 50)>
0.00/0.06	<l8, l15, not((main_c <= 50))>
0.00/0.06	<l9, l10, true, seq{main_i -> 0}>
0.00/0.06	<l10, l11, true>
0.00/0.06	<l11, l14, not((main_i < 101))>
0.00/0.06	<l11, l12, (main_i < 101)>
0.00/0.06	<l12, l13, true, seq{main_i -> (main_i + 1)}>
0.00/0.06	<l13, l11, true>
0.00/0.06	<l14, l15, true>
0.00/0.06	<l15, l16, (main_c <= 100)>
0.00/0.06	<l15, l22, not((main_c <= 100))>
0.00/0.06	<l16, l17, true, seq{main_i -> 0}>
0.00/0.06	<l17, l18, true>
0.00/0.06	<l18, l21, not((main_i < 102))>
0.00/0.06	<l18, l19, (main_i < 102)>
0.00/0.06	<l19, l20, true, seq{main_i -> (main_i + 1)}>
0.00/0.06	<l20, l18, true>
0.00/0.06	<l21, l28, true>
0.00/0.06	<l22, l23, true, seq{main_i -> 0}>
0.00/0.06	<l23, l24, true>
0.00/0.06	<l24, l27, not((main_i < 103))>
0.00/0.06	<l24, l25, (main_i < 103)>
0.00/0.06	<l25, l26, true, seq{main_i -> (main_i + 0)}>
0.00/0.06	<l26, l24, true>
0.00/0.06	<l27, l28, true>
0.00/0.06	<l28, l29, true>
0.00/0.06	<l29, l30, true, seq{main__func_return_ -> 0}>
0.00/0.06	
0.00/0.06	Fresh variables:
0.00/0.06	
0.00/0.06	Undef variables:
0.00/0.06	
0.00/0.06	Abstraction variables:
0.00/0.06	
0.00/0.06	Exit nodes:
0.00/0.06	
0.00/0.06	Accepting locations:
0.00/0.06	
0.00/0.06	Asserts:
0.00/0.06	
0.00/0.06	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
0.00/0.06	       
0.00/0.06	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
0.00/0.06	       
0.00/0.06	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
0.00/0.06	
0.00/0.06	Init Location: 0
0.00/0.06	Transitions:
0.00/0.06	<l0, l1, true, seq{main__func_return_ -> 0, main_c -> 864}>
0.00/0.06	<l1, l2, (main_c <= 10)>
0.00/0.06	<l1, l8, not((main_c <= 10))>
0.00/0.06	<l2, l3, true, seq{main_i -> 0}>
0.00/0.06	<l3, l4, true>
0.00/0.06	<l4, l5, (main_i < 100)>
0.00/0.06	<l4, l7, not((main_i < 100))>
0.00/0.06	<l5, l6, true, seq{main_i -> (main_i + 1)}>
0.00/0.06	<l6, l4, true>
0.00/0.06	<l7, l29, true>
0.00/0.06	<l8, l9, (main_c <= 50)>
0.00/0.06	<l8, l15, not((main_c <= 50))>
0.00/0.06	<l9, l10, true, seq{main_i -> 0}>
0.00/0.06	<l10, l11, true>
0.00/0.06	<l11, l12, (main_i < 101)>
0.00/0.06	<l11, l14, not((main_i < 101))>
0.00/0.06	<l12, l13, true, seq{main_i -> (main_i + 1)}>
0.00/0.06	<l13, l11, true>
0.00/0.06	<l14, l15, true>
0.00/0.06	<l15, l16, (main_c <= 100)>
0.00/0.06	<l15, l22, not((main_c <= 100))>
0.00/0.06	<l16, l17, true, seq{main_i -> 0}>
0.00/0.06	<l17, l18, true>
0.00/0.06	<l18, l19, (main_i < 102)>
0.00/0.06	<l18, l21, not((main_i < 102))>
0.00/0.06	<l19, l20, true, seq{main_i -> (main_i + 1)}>
0.00/0.06	<l20, l18, true>
0.00/0.06	<l21, l28, true>
0.00/0.06	<l22, l23, true, seq{main_i -> 0}>
0.00/0.06	<l23, l24, true>
0.00/0.06	<l24, l25, (main_i < 103)>
0.00/0.06	<l24, l27, not((main_i < 103))>
0.00/0.06	<l25, l26, true, seq{main_i -> (main_i + 0)}>
0.00/0.06	<l26, l24, true>
0.00/0.06	<l27, l28, true>
0.00/0.06	<l28, l29, true>
0.00/0.06	<l29, l30, true, seq{main__func_return_ -> 0}>
0.00/0.06	
0.00/0.06	Fresh variables:
0.00/0.06	
0.00/0.06	Undef variables:
0.00/0.06	
0.00/0.06	Abstraction variables:
0.00/0.06	
0.00/0.06	Exit nodes:
0.00/0.06	30, 
0.00/0.06	Accepting locations:
0.00/0.06	
0.00/0.06	Asserts:
0.00/0.06	
0.00/0.06	+                                                                  +
0.00/0.06	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
0.00/0.06	
0.00/0.06	
0.00/0.06	Function Return and Parameters Information [1 functions]:
0.00/0.06	    function name: main [1 return + 0 parameters]        demangled: main
0.00/0.06	        main__func_return_      [function result] : int
0.00/0.06	
0.00/0.06	
0.00/0.06	AST Ident Scanner Information [4 idents]:
0.00/0.06	__VERIFIER_nondet_int | function | [integer, ()] | <line: 3, col: 1>
0.00/0.06	main | function | [integer, ()] | <line: 5, col: 1>
0.00/0.06	c | local variable | integer | <line: 6, col: 5> | <line: 8, col: 5> <line: 10, col: 9> <line: 17, col: 13> <line: 23, col: 13>
0.00/0.06	i | local variable | integer | <line: 7, col: 5> | <line: 11, col: 9> <line: 12, col: 16> <line: 13, col: 13> <line: 13, col: 17> <line: 18, col: 13> <line: 19, col: 20> <line: 20, col: 17> <line: 20, col: 21> <line: 24, col: 13> <line: 25, col: 20> <line: 26, col: 17> <line: 26, col: 21> <line: 30, col: 13> <line: 31, col: 20> <line: 32, col: 17> <line: 32, col: 21>
0.00/0.06	
0.00/0.06	Main function: main
0.00/0.06	Preprocessed LLVMGraph
0.00/0.06	Init Location: 0
0.00/0.06	Transitions:
0.00/0.06	<l0, l24, (864 = 864) /\ (main_i = 0) /\ not((864 <= 10)) /\ not((864 <= 50)) /\ not((864 <= 100))>
0.00/0.06	<l24, l24, (main_i < 103), par{main_i -> (main_i + 0)}>
0.00/0.06	<l24, l30, not((main_i < 103))>
0.00/0.06	
0.00/0.06	Fresh variables:
0.00/0.06	
0.00/0.06	Undef variables:
0.00/0.06	
0.00/0.06	Abstraction variables:
0.00/0.06	
0.00/0.06	Exit nodes:
0.00/0.06	30, 
0.00/0.06	Accepting locations:
0.00/0.06	
0.00/0.06	Asserts:
0.00/0.06	
0.00/0.06	*************************************************************
0.00/0.06	*******************************************************************************************
0.00/0.06	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.00/0.06	*******************************************************************************************
0.00/0.06	
0.00/0.06	Init Location: 0
0.00/0.06	Graph 0:
0.00/0.06	Transitions:
0.00/0.06	Variables:
0.00/0.06	
0.00/0.06	Graph 1:
0.00/0.06	Transitions:
0.00/0.06	<l24, l24, main_i <= 102, {all remain the same}>
0.00/0.06	Variables:
0.00/0.06	main_i
0.00/0.06	
0.00/0.06	Graph 2:
0.00/0.06	Transitions:
0.00/0.06	Variables:
0.00/0.06	
0.00/0.06	Precedence: 
0.00/0.06	Graph 0
0.00/0.06	
0.00/0.06	Graph 1
0.00/0.06	<l0, l24, main_i = 0, {all remain the same}>
0.00/0.06	
0.00/0.06	Graph 2
0.00/0.06	<l24, l30, 103 <= main_i, {all remain the same}>
0.00/0.06	
0.00/0.06	Map Locations to Subgraph:
0.00/0.06	( 0 , 0 )
0.00/0.06	( 24 , 1 )
0.00/0.06	( 30 , 2 )
0.00/0.06	
0.00/0.06	*******************************************************************************************
0.00/0.06	********************************    CHECKING ASSERTIONS    ********************************
0.00/0.06	*******************************************************************************************
0.00/0.06	
0.00/0.06	Proving termination of subgraph 0
0.00/0.06	Proving termination of subgraph 1
0.00/0.06	Checking unfeasibility...
0.00/0.06	Time used: 0.001295
0.00/0.06	
0.00/0.06	> No variable changes in termination graph.
0.00/0.06	Checking conditional unfeasibility...
0.00/0.06	Calling Safety with literal 103 <= main_i and entry <l24, l24, true, {all remain the same}>
0.00/0.06	
0.00/0.06	LOG: CALL check - Post:103 <= main_i - Process 1
0.00/0.06	* Exit transition: <l24, l24, true, {all remain the same}>
0.00/0.06	* Postcondition  : 103 <= main_i
0.00/0.06	Postcodition moved up: 103 <= main_i
0.00/0.06	
0.00/0.06	LOG: Try proving POST
0.00/0.06	
0.00/0.06	LOG: CALL check - Post:103 <= main_i - Process 2
0.00/0.06	* Exit transition: <l0, l24, main_i = 0, {all remain the same}>
0.00/0.06	* Postcondition  : 103 <= main_i
0.00/0.06	
0.00/0.06	LOG: CALL solveLinear
0.00/0.06	
0.00/0.06	LOG: RETURN solveLinear - Elapsed time: 0.000259s
0.00/0.06	> Postcondition is not implied!
0.00/0.06	
0.00/0.06	LOG: RETURN check - Elapsed time: 0.000332s
0.00/0.06	
0.00/0.06	LOG: NarrowEntry size 1
0.00/0.06	Narrowing transition: 
0.00/0.06	<l24, l24, main_i <= 102, {all remain the same}>
0.00/0.06	
0.00/0.06	LOG: Narrow transition size 1
0.00/0.06	ENTRIES:
0.00/0.06	<l0, l24, main_i = 0, {all remain the same}>
0.00/0.06	END ENTRIES:
0.00/0.06	GRAPH:
0.00/0.06	<l24, l24, main_i <= 102, {all remain the same}>
0.00/0.06	END GRAPH:
0.00/0.06	EXIT: <l24, l24, true, {all remain the same}>
0.00/0.06	POST: 103 <= main_i
0.00/0.06	
0.00/0.06	
0.00/0.06	LOG: Try proving POST
0.00/0.06	[34277 : 34278]
0.00/0.06	[34277 : 34279]
0.00/0.06	[34277 : 34280]
0.00/0.06	
0.00/0.06	LOG: Postcondition is not implied - no solution
0.00/0.06	> Postcondition is not implied!
0.00/0.06	
0.00/0.06	LOG: RETURN check - Elapsed time: 0.020341s
0.00/0.06	
0.00/0.06	[34277 : 34282]
0.00/0.06	[34277 : 34286]
0.00/0.06	Successful child: 34282
0.00/0.06	
0.00/0.06	Program does NOT terminate
0.00/0.06	EOF