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