55.73/29.11	NO
55.73/29.11	
55.73/29.11	Solver Timeout: 4
55.73/29.11	Global Timeout: 300
55.73/29.11	Maximum number of concurrent processes: 900
55.73/29.11	*******************************************************************************************
55.73/29.11	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
55.73/29.11	*******************************************************************************************
55.73/29.11	
55.73/29.11	
55.73/29.11	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
55.73/29.11	
55.73/29.11	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
55.73/29.11	+                                                                  +
55.73/29.11	Init Location: 0
55.73/29.11	Transitions:
55.73/29.11	<l0, l1, true, seq{main__func_return_ -> 0, main_j -> 0, main_i -> 0}>
55.73/29.11	<l1, l2, true>
55.73/29.11	<l2, l8, not((main_i <= main_j))>
55.73/29.11	<l2, l3, (main_i <= main_j)>
55.73/29.11	<l3, l4, ((main_j - main_i) < 1)>
55.73/29.11	<l3, l6, not(((main_j - main_i) < 1))>
55.73/29.11	<l4, l5, true, seq{main_j -> (main_j + 2)}>
55.73/29.11	<l5, l6, true>
55.73/29.11	<l6, l7, true, seq{main_i -> (main_i + 1)}>
55.73/29.11	<l7, l2, true>
55.73/29.11	<l8, l9, true, seq{main__func_return_ -> 0}>
55.73/29.11	
55.73/29.11	Fresh variables:
55.73/29.11	
55.73/29.11	Undef variables:
55.73/29.11	
55.73/29.11	Abstraction variables:
55.73/29.11	
55.73/29.11	Exit nodes:
55.73/29.11	
55.73/29.11	Accepting locations:
55.73/29.11	
55.73/29.11	Asserts:
55.73/29.11	
55.73/29.11	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
55.73/29.11	       
55.73/29.11	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
55.73/29.11	       
55.73/29.11	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
55.73/29.11	
55.73/29.11	Init Location: 0
55.73/29.11	Transitions:
55.73/29.11	<l0, l1, true, seq{main__func_return_ -> 0, main_j -> 0, main_i -> 0}>
55.73/29.11	<l1, l2, true>
55.73/29.11	<l2, l3, (main_i <= main_j)>
55.73/29.11	<l2, l8, not((main_i <= main_j))>
55.73/29.11	<l3, l4, ((main_j - main_i) < 1)>
55.73/29.11	<l3, l6, not(((main_j - main_i) < 1))>
55.73/29.11	<l4, l5, true, seq{main_j -> (main_j + 2)}>
55.73/29.11	<l5, l6, true>
55.73/29.11	<l6, l7, true, seq{main_i -> (main_i + 1)}>
55.73/29.11	<l7, l2, true>
55.73/29.11	<l8, l9, true, seq{main__func_return_ -> 0}>
55.73/29.11	
55.73/29.11	Fresh variables:
55.73/29.11	
55.73/29.11	Undef variables:
55.73/29.11	
55.73/29.11	Abstraction variables:
55.73/29.11	
55.73/29.11	Exit nodes:
55.73/29.11	9, 
55.73/29.11	Accepting locations:
55.73/29.11	
55.73/29.11	Asserts:
55.73/29.11	
55.73/29.11	+                                                                  +
55.73/29.11	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
55.73/29.11	
55.73/29.11	
55.73/29.11	Function Return and Parameters Information [1 functions]:
55.73/29.11	    function name: main [1 return + 0 parameters]        demangled: main
55.73/29.11	        main__func_return_      [function result] : int
55.73/29.11	
55.73/29.11	
55.73/29.11	AST Ident Scanner Information [4 idents]:
55.73/29.11	__VERIFIER_nondet_int | function | [integer, ()] | <line: 3, col: 1>
55.73/29.11	main | function | [integer, ()] | <line: 5, col: 1>
55.73/29.11	i | local variable | integer | <line: 6, col: 5> | <line: 9, col: 5> <line: 11, col: 12> <line: 12, col: 15> <line: 13, col: 9> <line: 13, col: 13>
55.73/29.11	j | local variable | integer | <line: 7, col: 5> | <line: 8, col: 5> <line: 11, col: 17> <line: 12, col: 13> <line: 12, col: 24> <line: 12, col: 28>
55.73/29.11	
55.73/29.11	Main function: main
55.73/29.11	Preprocessed LLVMGraph
55.73/29.11	Init Location: 0
55.73/29.11	Transitions:
55.73/29.11	<l0, l2, (main_i = 0) /\ (main_j = 0)>
55.73/29.11	<l2, l2, (main_i <= main_j) /\ ((main_j - main_i) < 1), par{main_i -> (main_i + 1), main_j -> (main_j + 2)}>
55.73/29.11	<l2, l2, (main_i <= main_j) /\ not(((main_j - main_i) < 1)), par{main_i -> (main_i + 1)}>
55.73/29.11	<l2, l9, not((main_i <= main_j))>
55.73/29.11	
55.73/29.11	Fresh variables:
55.73/29.11	
55.73/29.11	Undef variables:
55.73/29.11	
55.73/29.11	Abstraction variables:
55.73/29.11	
55.73/29.11	Exit nodes:
55.73/29.11	9, 
55.73/29.11	Accepting locations:
55.73/29.11	
55.73/29.11	Asserts:
55.73/29.11	
55.73/29.11	*************************************************************
55.73/29.11	*******************************************************************************************
55.73/29.11	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
55.73/29.11	*******************************************************************************************
55.73/29.11	
55.73/29.11	Init Location: 0
55.73/29.11	Graph 0:
55.73/29.11	Transitions:
55.73/29.11	Variables:
55.73/29.11	
55.73/29.11	Graph 1:
55.73/29.11	Transitions:
55.73/29.11	<l2, l2, main_i = main_j, {main_i -> 1 + main_i, main_j -> 2 + main_j, rest remain the same}>
55.73/29.11	<l2, l2, 1 + main_i <= main_j, {main_i -> 1 + main_i, rest remain the same}>
55.73/29.11	Variables:
55.73/29.11	main_i, main_j
55.73/29.11	
55.73/29.11	Graph 2:
55.73/29.11	Transitions:
55.73/29.11	Variables:
55.73/29.11	
55.73/29.11	Precedence: 
55.73/29.11	Graph 0
55.73/29.11	
55.73/29.11	Graph 1
55.73/29.11	<l0, l2, main_i = 0 /\ main_j = 0, {all remain the same}>
55.73/29.11	
55.73/29.11	Graph 2
55.73/29.11	<l2, l9, 1 + main_j <= main_i, {all remain the same}>
55.73/29.11	
55.73/29.11	Map Locations to Subgraph:
55.73/29.11	( 0 , 0 )
55.73/29.11	( 2 , 1 )
55.73/29.11	( 9 , 2 )
55.73/29.11	
55.73/29.11	*******************************************************************************************
55.73/29.11	********************************    CHECKING ASSERTIONS    ********************************
55.73/29.11	*******************************************************************************************
55.73/29.11	
55.73/29.11	Proving termination of subgraph 0
55.73/29.11	Proving termination of subgraph 1
55.73/29.11	Checking unfeasibility...
55.73/29.11	Time used: 0.009931
55.73/29.11	
55.73/29.11	Checking conditional termination of SCC {l2}...
55.73/29.11	
55.73/29.11	LOG: CALL solveLinear
55.73/29.11	
55.73/29.11	LOG: RETURN solveLinear - Elapsed time: 0.000865s
55.73/29.11	
55.73/29.11	LOG: CALL solveLinear
55.73/29.11	
55.73/29.11	LOG: RETURN solveLinear - Elapsed time: 0.005084s
55.73/29.11	[37742 : 37744]
55.73/29.11	[37742 : 37745]
55.73/29.11	Solving with 1 template(s).
55.73/29.11	
55.73/29.11	LOG: CALL solveNonLinearGetFirstSolution
55.73/29.11	
55.73/29.11	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.026294s
55.73/29.11	Time used: 0.025752
55.73/29.11	Improving Solution with cost 1 ...
55.73/29.11	
55.73/29.11	LOG: CALL solveNonLinearGetNextSolution
55.73/29.11	
55.73/29.11	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000702s
55.73/29.11	Time used: 1.00065
55.73/29.11	
55.73/29.11	LOG: SAT solveNonLinear - Elapsed time: 1.026997s
55.73/29.11	Cost: 1; Total time: 1.02641
55.73/29.11	Termination implied by a set of invariant(s):
55.73/29.11	Invariant at l2: main_j <= 1 + main_i
55.73/29.11	[ Invariant Graph ]
55.73/29.11	Strengthening and disabling transitions...
55.73/29.11	
55.73/29.11	LOG: CALL solverLinear in Graph for feasibility
55.73/29.11	
55.73/29.11	LOG: RETURN solveLinear in Graph for feasibility
55.73/29.11	Strengthening transition (result): 
55.73/29.11	<l2, l2, main_i = main_j, {main_i -> 1 + main_i, main_j -> 2 + main_j, rest remain the same}>
55.73/29.11	
55.73/29.11	LOG: CALL solverLinear in Graph for feasibility
55.73/29.11	
55.73/29.11	LOG: RETURN solveLinear in Graph for feasibility
55.73/29.11	Strengthening transition (result): 
55.73/29.11	<l2, l2, 1 + main_i = main_j, {main_i -> 1 + main_i, rest remain the same}>
55.73/29.11	[ Termination Graph ]
55.73/29.11	Strengthening and disabling transitions...
55.73/29.11	
55.73/29.11	LOG: CALL solverLinear in Graph for feasibility
55.73/29.11	
55.73/29.11	LOG: RETURN solveLinear in Graph for feasibility
55.73/29.11	Strengthening transition (result): 
55.73/29.11	<l2, l2, main_i = main_j, {main_i -> 1 + main_i, main_j -> 2 + main_j, rest remain the same}>
55.73/29.11	
55.73/29.11	LOG: CALL solverLinear in Graph for feasibility
55.73/29.11	
55.73/29.11	LOG: RETURN solveLinear in Graph for feasibility
55.73/29.11	Strengthening transition (result): 
55.73/29.11	<l2, l2, 1 + main_i = main_j, {main_i -> 1 + main_i, rest remain the same}>
55.73/29.11	Quasi-ranking function: 50000 - 2*main_i + main_j
55.73/29.11	New Graphs: 
55.73/29.11	Transitions:
55.73/29.11	<l2, l2, main_i = main_j, {main_i -> 1 + main_i, main_j -> 2 + main_j, rest remain the same}>
55.73/29.11	<l2, l2, 50001 + main_j <= 2*main_i /\ 1 + main_i = main_j, {main_i -> 1 + main_i, rest remain the same}>
55.73/29.11	Variables:
55.73/29.11	main_i, main_j
55.73/29.11	Checking conditional termination of SCC {l2}...
55.73/29.11	
55.73/29.11	LOG: CALL solveLinear
55.73/29.11	
55.73/29.11	LOG: RETURN solveLinear - Elapsed time: 0.000827s
55.73/29.11	
55.73/29.11	LOG: CALL solveLinear
55.73/29.11	
55.73/29.11	LOG: RETURN solveLinear - Elapsed time: 0.007038s
55.73/29.11	[37742 : 37749]
55.73/29.11	[37742 : 37750]
55.73/29.11	Solving with 1 template(s).
55.73/29.11	
55.73/29.11	LOG: CALL solveNonLinearGetFirstSolution
55.73/29.11	
55.73/29.11	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.027858s
55.73/29.11	Time used: 0.026914
55.73/29.11	Improving Solution with cost 1 ...
55.73/29.11	
55.73/29.11	LOG: CALL solveNonLinearGetNextSolution
55.73/29.11	
55.73/29.11	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000569s
55.73/29.11	Time used: 1.00039
55.73/29.11	
55.73/29.11	LOG: SAT solveNonLinear - Elapsed time: 1.028428s
55.73/29.11	Cost: 1; Total time: 1.02731
55.73/29.11	Termination implied by a set of invariant(s):
55.73/29.11	Invariant at l2: main_i <= 1 + main_j
55.73/29.11	[ Invariant Graph ]
55.73/29.11	Strengthening and disabling transitions...
55.73/29.11	
55.73/29.11	LOG: CALL solverLinear in Graph for feasibility
55.73/29.11	
55.73/29.11	LOG: RETURN solveLinear in Graph for feasibility
55.73/29.11	Strengthening transition (result): 
55.73/29.11	<l2, l2, main_i = main_j, {main_i -> 1 + main_i, main_j -> 2 + main_j, rest remain the same}>
55.73/29.11	
55.73/29.11	LOG: CALL solverLinear in Graph for feasibility
55.73/29.11	
55.73/29.11	LOG: RETURN solveLinear in Graph for feasibility
55.73/29.11	Strengthening transition (result): 
55.73/29.11	<l2, l2, 1 + main_i = main_j, {main_i -> 1 + main_i, rest remain the same}>
55.73/29.11	[ Termination Graph ]
55.73/29.11	Strengthening and disabling transitions...
55.73/29.11	
55.73/29.11	LOG: CALL solverLinear in Graph for feasibility
55.73/29.11	
55.73/29.11	LOG: RETURN solveLinear in Graph for feasibility
55.73/29.11	Strengthening transition (result): 
55.73/29.11	<l2, l2, main_i = main_j, {main_i -> 1 + main_i, main_j -> 2 + main_j, rest remain the same}>
55.73/29.11	
55.73/29.11	LOG: CALL solverLinear in Graph for feasibility
55.73/29.11	
55.73/29.11	LOG: RETURN solveLinear in Graph for feasibility
55.73/29.11	Strengthening transition (result): 
55.73/29.11	<l2, l2, 50001 + main_j <= 2*main_i /\ 1 + main_i = main_j, {main_i -> 1 + main_i, rest remain the same}>
55.73/29.11	Quasi-ranking function: 50000 - main_i
55.73/29.11	New Graphs: 
55.73/29.11	Transitions:
55.73/29.11	<l2, l2, 50001 <= main_i /\ main_i = main_j, {main_i -> 1 + main_i, main_j -> 2 + main_j, rest remain the same}>
55.73/29.11	<l2, l2, 50001 <= main_i /\ 50001 + main_j <= 2*main_i /\ 1 + main_i = main_j, {main_i -> 1 + main_i, rest remain the same}>
55.73/29.11	Variables:
55.73/29.11	main_i, main_j
55.73/29.11	Checking conditional termination of SCC {l2}...
55.73/29.11	
55.73/29.11	LOG: CALL solveLinear
55.73/29.11	
55.73/29.11	LOG: RETURN solveLinear - Elapsed time: 0.001020s
55.73/29.11	
55.73/29.11	LOG: CALL solveLinear
55.73/29.11	
55.73/29.11	LOG: RETURN solveLinear - Elapsed time: 0.012640s
55.73/29.11	[37742 : 37754]
55.73/29.11	[37742 : 37755]
55.73/29.11	Solving with 1 template(s).
55.73/29.11	
55.73/29.11	LOG: CALL solveNonLinearGetFirstSolution
55.73/29.11	
55.73/29.11	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.031059s
55.73/29.11	Time used: 0.030118
55.73/29.11	Improving Solution with cost 1 ...
55.73/29.11	
55.73/29.11	LOG: CALL solveNonLinearGetNextSolution
55.73/29.11	
55.73/29.11	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.004417s
55.73/29.11	Time used: 1.00433
55.73/29.11	
55.73/29.11	LOG: SAT solveNonLinear - Elapsed time: 1.035476s
55.73/29.11	Cost: 1; Total time: 1.03445
55.73/29.11	Quasi-ranking function: 50000 - main_i - main_j
55.73/29.11	New Graphs: 
55.73/29.11	Transitions:
55.73/29.11	<l2, l2, 50001 <= main_i /\ 50001 <= main_i + main_j /\ main_i = main_j, {main_i -> 1 + main_i, main_j -> 2 + main_j, rest remain the same}>
55.73/29.11	<l2, l2, 50001 <= main_i /\ 50001 <= main_i + main_j /\ 50001 + main_j <= 2*main_i /\ 1 + main_i = main_j, {main_i -> 1 + main_i, rest remain the same}>
55.73/29.11	Variables:
55.73/29.11	main_i, main_j
55.73/29.11	Checking conditional termination of SCC {l2}...
55.73/29.11	
55.73/29.11	LOG: CALL solveLinear
55.73/29.11	
55.73/29.11	LOG: RETURN solveLinear - Elapsed time: 0.001209s
55.73/29.11	
55.73/29.11	LOG: CALL solveLinear
55.73/29.11	
55.73/29.11	LOG: RETURN solveLinear - Elapsed time: 0.014670s
55.73/29.11	[37742 : 37761]
55.73/29.11	[37742 : 37762]
55.73/29.11	Solving with 1 template(s).
55.73/29.11	
55.73/29.11	LOG: CALL solveNonLinearGetFirstSolution
55.73/29.11	
55.73/29.11	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.035646s
55.73/29.11	Time used: 0.03449
55.73/29.11	Improving Solution with cost 1 ...
55.73/29.11	
55.73/29.11	LOG: CALL solveNonLinearGetNextSolution
55.73/29.11	
55.73/29.11	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000521s
55.73/29.11	Time used: 1.00046
55.73/29.11	
55.73/29.11	LOG: SAT solveNonLinear - Elapsed time: 1.036167s
55.73/29.11	Cost: 1; Total time: 1.03495
55.73/29.11	Quasi-ranking function: 50000 - main_j
55.73/29.11	New Graphs: 
55.73/29.11	Transitions:
55.73/29.11	<l2, l2, 50001 <= main_i /\ 50001 <= main_i + main_j /\ 50001 <= main_j /\ main_i = main_j, {main_i -> 1 + main_i, main_j -> 2 + main_j, rest remain the same}>
55.73/29.11	<l2, l2, 50001 <= main_i /\ 50001 <= main_i + main_j /\ 50001 + main_j <= 2*main_i /\ 1 + main_i = main_j, {main_i -> 1 + main_i, rest remain the same}>
55.73/29.11	Variables:
55.73/29.11	main_i, main_j
55.73/29.11	Checking conditional termination of SCC {l2}...
55.73/29.11	
55.73/29.11	LOG: CALL solveLinear
55.73/29.11	
55.73/29.11	LOG: RETURN solveLinear - Elapsed time: 0.001363s
55.73/29.11	
55.73/29.11	LOG: CALL solveLinear
55.73/29.11	
55.73/29.11	LOG: RETURN solveLinear - Elapsed time: 0.011312s
55.73/29.11	[37742 : 37766]
55.73/29.11	[37742 : 37767]
55.73/29.11	Solving with 1 template(s).
55.73/29.11	
55.73/29.11	LOG: CALL solveNonLinearGetFirstSolution
55.73/29.11	
55.73/29.11	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.102312s
55.73/29.11	Time used: 4.10065
55.73/29.11	Termination failed. Trying to show unreachability...
55.73/29.11	Proving unreachability of entry: <l0, l2, main_i = 0 /\ main_j = 0, {all remain the same}>
55.73/29.11	
55.73/29.11	LOG: CALL check - Post:1 <= 0 - Process 1
55.73/29.11	* Exit transition: <l0, l2, main_i = 0 /\ main_j = 0, {all remain the same}>
55.73/29.11	* Postcondition  : 1 <= 0
55.73/29.11	
55.73/29.11	LOG: CALL solveLinear
55.73/29.11	
55.73/29.11	LOG: RETURN solveLinear - Elapsed time: 0.011274s
55.73/29.11	> Postcondition is not implied!
55.73/29.11	
55.73/29.11	LOG: RETURN check - Elapsed time: 0.011401s
55.73/29.11	Cannot prove unreachability
55.73/29.11	
55.73/29.11	[37742 : 37923]
55.73/29.11	[37742 : 37927]
55.73/29.11	Successful child: 37923
55.73/29.11	
55.73/29.11	Program does NOT terminate
55.73/29.11	EOF