15.87/13.82	NO
15.87/13.82	
15.87/13.82	Solver Timeout: 4
15.87/13.82	Global Timeout: 300
15.87/13.82	Maximum number of concurrent processes: 900
15.87/13.82	*******************************************************************************************
15.87/13.82	*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
15.87/13.82	*******************************************************************************************
15.87/13.82	
15.87/13.82	
15.87/13.82	List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :
15.87/13.82	
15.87/13.82	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
15.87/13.82	+                                                                  +
15.87/13.82	Init Location: 0
15.87/13.82	Transitions:
15.87/13.82	<l0, l1, true, seq{main__func_return_ -> 0, main_i -> 0}>
15.87/13.82	<l1, l2, true>
15.87/13.82	<l2, l25, not((main_i < 100))>
15.87/13.82	<l2, l3, (main_i < 100)>
15.87/13.82	<l3, l4, true, seq{main_a -> (main_i + 2), main_j -> 0}>
15.87/13.82	<l4, l5, true>
15.87/13.82	<l5, l23, not((main_j < main_a))>
15.87/13.82	<l5, l6, (main_j < main_a)>
15.87/13.82	<l6, l7, true, seq{main_k -> ((main_i + main_j) + 3)}>
15.87/13.82	<l7, l8, true>
15.87/13.82	<l8, l21, not((main_k >= 0))>
15.87/13.82	<l8, l9, (main_k >= 0)>
15.87/13.82	<l9, l10, true, seq{main_b -> (((main_i + main_j) + main_k) + 4), main_l -> 0}>
15.87/13.82	<l10, l11, true>
15.87/13.82	<l11, l19, not((main_l < main_b))>
15.87/13.82	<l11, l12, (main_l < main_b)>
15.87/13.82	<l12, l13, true, seq{main_m -> ((((main_i + main_j) + main_k) + main_l) + 1000)}>
15.87/13.82	<l13, l14, true>
15.87/13.82	<l14, l17, not((main_m >= 0))>
15.87/13.82	<l14, l15, (main_m >= 0)>
15.87/13.82	<l15, l16, true, seq{main_m -> (main_m - 0)}>
15.87/13.82	<l16, l14, true>
15.87/13.82	<l17, l18, true, seq{main_l -> (main_l + 1)}>
15.87/13.82	<l18, l11, true>
15.87/13.82	<l19, l20, true, seq{main_k -> (main_k - 1)}>
15.87/13.82	<l20, l8, true>
15.87/13.82	<l21, l22, true, seq{main_j -> (main_j + 1)}>
15.87/13.82	<l22, l5, true>
15.87/13.82	<l23, l24, true, seq{main_i -> (main_i + 1)}>
15.87/13.82	<l24, l2, true>
15.87/13.82	<l25, l26, true, seq{main__func_return_ -> 0}>
15.87/13.82	
15.87/13.82	Fresh variables:
15.87/13.82	
15.87/13.82	Undef variables:
15.87/13.82	
15.87/13.82	Abstraction variables:
15.87/13.82	
15.87/13.82	Exit nodes:
15.87/13.82	
15.87/13.82	Accepting locations:
15.87/13.82	
15.87/13.82	Asserts:
15.87/13.82	
15.87/13.82	+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
15.87/13.82	       
15.87/13.82	+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
15.87/13.82	       
15.87/13.82	+ After preprocess (paralelization): ++++++++++++++++++++++++++++++
15.87/13.82	
15.87/13.82	Init Location: 0
15.87/13.82	Transitions:
15.87/13.82	<l0, l1, true, seq{main__func_return_ -> 0, main_i -> 0}>
15.87/13.82	<l1, l2, true>
15.87/13.82	<l2, l3, (main_i < 100)>
15.87/13.82	<l2, l25, not((main_i < 100))>
15.87/13.82	<l3, l4, true, seq{main_a -> (main_i + 2), main_j -> 0}>
15.87/13.82	<l4, l5, true>
15.87/13.82	<l5, l6, (main_j < main_a)>
15.87/13.82	<l5, l23, not((main_j < main_a))>
15.87/13.82	<l6, l7, true, seq{main_k -> ((main_i + main_j) + 3)}>
15.87/13.82	<l7, l8, true>
15.87/13.82	<l8, l9, (main_k >= 0)>
15.87/13.82	<l8, l21, not((main_k >= 0))>
15.87/13.82	<l9, l10, true, seq{main_b -> (((main_i + main_j) + main_k) + 4), main_l -> 0}>
15.87/13.82	<l10, l11, true>
15.87/13.82	<l11, l12, (main_l < main_b)>
15.87/13.82	<l11, l19, not((main_l < main_b))>
15.87/13.82	<l12, l13, true, seq{main_m -> ((((main_i + main_j) + main_k) + main_l) + 1000)}>
15.87/13.82	<l13, l14, true>
15.87/13.82	<l14, l15, (main_m >= 0)>
15.87/13.82	<l14, l17, not((main_m >= 0))>
15.87/13.82	<l15, l16, true, seq{main_m -> (main_m - 0)}>
15.87/13.82	<l16, l14, true>
15.87/13.82	<l17, l18, true, seq{main_l -> (main_l + 1)}>
15.87/13.82	<l18, l11, true>
15.87/13.82	<l19, l20, true, seq{main_k -> (main_k - 1)}>
15.87/13.82	<l20, l8, true>
15.87/13.82	<l21, l22, true, seq{main_j -> (main_j + 1)}>
15.87/13.82	<l22, l5, true>
15.87/13.82	<l23, l24, true, seq{main_i -> (main_i + 1)}>
15.87/13.82	<l24, l2, true>
15.87/13.82	<l25, l26, true, seq{main__func_return_ -> 0}>
15.87/13.82	
15.87/13.82	Fresh variables:
15.87/13.82	
15.87/13.82	Undef variables:
15.87/13.82	
15.87/13.82	Abstraction variables:
15.87/13.82	
15.87/13.82	Exit nodes:
15.87/13.82	26, 
15.87/13.82	Accepting locations:
15.87/13.82	
15.87/13.82	Asserts:
15.87/13.82	
15.87/13.82	+                                                                  +
15.87/13.82	+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
15.87/13.82	
15.87/13.82	
15.87/13.82	Function Return and Parameters Information [1 functions]:
15.87/13.82	    function name: main [1 return + 0 parameters]        demangled: main
15.87/13.82	        main__func_return_      [function result] : int
15.87/13.82	
15.87/13.82	
15.87/13.82	AST Ident Scanner Information [9 idents]:
15.87/13.82	__VERIFIER_nondet_int | function | [integer, ()] | <line: 3, col: 1>
15.87/13.82	main | function | [integer, ()] | <line: 5, col: 1>
15.87/13.82	i | local variable | integer | <line: 6, col: 5> | <line: 13, col: 5> <line: 15, col: 12> <line: 16, col: 13> <line: 19, col: 17> <line: 21, col: 21> <line: 24, col: 25> <line: 34, col: 9> <line: 34, col: 13>
15.87/13.82	j | local variable | integer | <line: 7, col: 5> | <line: 17, col: 9> <line: 18, col: 16> <line: 19, col: 19> <line: 21, col: 23> <line: 24, col: 27> <line: 32, col: 13> <line: 32, col: 17>
15.87/13.82	k | local variable | integer | <line: 8, col: 5> | <line: 19, col: 13> <line: 20, col: 20> <line: 21, col: 25> <line: 24, col: 29> <line: 30, col: 17> <line: 30, col: 21>
15.87/13.82	l | local variable | integer | <line: 9, col: 5> | <line: 22, col: 17> <line: 23, col: 24> <line: 24, col: 31> <line: 28, col: 21> <line: 28, col: 25>
15.87/13.82	m | local variable | integer | <line: 10, col: 5> | <line: 24, col: 21> <line: 25, col: 28> <line: 26, col: 25> <line: 26, col: 29>
15.87/13.82	a | local variable | integer | <line: 11, col: 5> | <line: 16, col: 9> <line: 18, col: 20>
15.87/13.82	b | local variable | integer | <line: 12, col: 5> | <line: 21, col: 17> <line: 23, col: 28>
15.87/13.82	
15.87/13.82	Main function: main
15.87/13.82	Preprocessed LLVMGraph
15.87/13.82	Init Location: 0
15.87/13.82	Transitions:
15.87/13.82	<l0, l5, (main_i = 0) /\ (0 < 100), par{main_j -> 0, main_a -> (0 + 2)}>
15.87/13.82	<l5, l11, (main_j < main_a) /\ (((main_i + main_j) + 3) >= 0), par{main_k -> ((main_i + main_j) + 3), main_l -> 0, main_b -> (((main_i + main_j) + ((main_i + main_j) + 3)) + 4)}>
15.87/13.82	<l5, l5, (main_j < main_a) /\ not((((main_i + main_j) + 3) >= 0)), par{main_j -> (main_j + 1), main_k -> ((main_i + main_j) + 3)}>
15.87/13.82	<l5, l5, not((main_j < main_a)) /\ ((main_i + 1) < 100), par{main_i -> (main_i + 1), main_j -> 0, main_a -> ((main_i + 1) + 2)}>
15.87/13.82	<l5, l26, not((main_j < main_a)) /\ not(((main_i + 1) < 100)), par{main_i -> (main_i + 1)}>
15.87/13.82	<l11, l14, (main_l < main_b), par{main_m -> ((((main_i + main_j) + main_k) + main_l) + 1000)}>
15.87/13.82	<l11, l11, not((main_l < main_b)) /\ ((main_k - 1) >= 0), par{main_k -> (main_k - 1), main_l -> 0, main_b -> (((main_i + main_j) + (main_k - 1)) + 4)}>
15.87/13.82	<l11, l5, not((main_l < main_b)) /\ not(((main_k - 1) >= 0)), par{main_j -> (main_j + 1), main_k -> (main_k - 1)}>
15.87/13.82	<l14, l14, (main_m >= 0), par{main_m -> (main_m - 0)}>
15.87/13.82	<l14, l11, not((main_m >= 0)), par{main_l -> (main_l + 1)}>
15.87/13.82	
15.87/13.82	Fresh variables:
15.87/13.82	
15.87/13.82	Undef variables:
15.87/13.82	
15.87/13.82	Abstraction variables:
15.87/13.82	
15.87/13.82	Exit nodes:
15.87/13.82	26, 
15.87/13.82	Accepting locations:
15.87/13.82	
15.87/13.82	Asserts:
15.87/13.82	
15.87/13.82	*************************************************************
15.87/13.82	*******************************************************************************************
15.87/13.82	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
15.87/13.82	*******************************************************************************************
15.87/13.82	
15.87/13.82	Init Location: 0
15.87/13.82	Graph 0:
15.87/13.82	Transitions:
15.87/13.82	Variables:
15.87/13.82	
15.87/13.82	Graph 1:
15.87/13.82	Transitions:
15.87/13.82	<l5, l11, 1 + main_j <= main_a /\ 0 <= 3 + main_i + main_j, {main_k -> 3 + main_i + main_j, main_l -> 0, main_b -> 7 + 2*main_i + 2*main_j, rest remain the same}>
15.87/13.82	<l5, l5, 4 + main_i + main_j <= 0 /\ 1 + main_j <= main_a, {main_j -> 1 + main_j, main_k -> 3 + main_i + main_j, rest remain the same}>
15.87/13.82	<l5, l5, main_a <= main_j /\ main_i <= 98, {main_i -> 1 + main_i, main_j -> 0, main_a -> 3 + main_i, rest remain the same}>
15.87/13.82	<l11, l14, 1 + main_l <= main_b, {main_m -> 1000 + main_i + main_j + main_k + main_l, rest remain the same}>
15.87/13.82	<l11, l11, main_b <= main_l /\ 1 <= main_k, {main_k -> -1 + main_k, main_l -> 0, main_b -> 3 + main_i + main_j + main_k, rest remain the same}>
15.87/13.82	<l11, l5, main_k <= 0 /\ main_b <= main_l, {main_j -> 1 + main_j, main_k -> -1 + main_k, rest remain the same}>
15.87/13.82	<l14, l14, 0 <= main_m, {all remain the same}>
15.87/13.82	<l14, l11, 1 + main_m <= 0, {main_l -> 1 + main_l, rest remain the same}>
15.87/13.82	Variables:
15.87/13.82	main_i, main_j, main_k, main_a, main_b, main_l, main_m
15.87/13.82	
15.87/13.82	Graph 2:
15.87/13.82	Transitions:
15.87/13.82	Variables:
15.87/13.82	
15.87/13.82	Precedence: 
15.87/13.82	Graph 0
15.87/13.82	
15.87/13.82	Graph 1
15.87/13.82	<l0, l5, main_i = 0, {main_j -> 0, main_a -> 2, rest remain the same}>
15.87/13.82	
15.87/13.82	Graph 2
15.87/13.82	<l5, l26, main_a <= main_j /\ 99 <= main_i, {main_i -> 1 + main_i, rest remain the same}>
15.87/13.82	
15.87/13.82	Map Locations to Subgraph:
15.87/13.82	( 0 , 0 )
15.87/13.82	( 5 , 1 )
15.87/13.82	( 11 , 1 )
15.87/13.82	( 14 , 1 )
15.87/13.82	( 26 , 2 )
15.87/13.82	
15.87/13.82	*******************************************************************************************
15.87/13.82	********************************    CHECKING ASSERTIONS    ********************************
15.87/13.82	*******************************************************************************************
15.87/13.82	
15.87/13.82	Proving termination of subgraph 0
15.87/13.82	Proving termination of subgraph 1
15.87/13.82	Checking unfeasibility...
15.87/13.82	Time used: 0.840246
15.87/13.82	Some transition disabled by a set of invariant(s):
15.87/13.82	Invariant at l11: main_b <= 4 + main_i + main_j + main_k + 2*main_l
15.87/13.82	Invariant at l14: 0 <= main_m
15.87/13.82	
15.87/13.82	Strengthening and disabling transitions...
15.87/13.82	> It's unfeasible. Removing transition: 
15.87/13.82	<l14, l11, 1 + main_m <= 0, {main_l -> 1 + main_l, rest remain the same}>
15.87/13.82	
15.87/13.82	LOG: CALL solverLinear in Graph for feasibility
15.87/13.82	
15.87/13.82	LOG: RETURN solveLinear in Graph for feasibility
15.87/13.82	
15.87/13.82	LOG: CALL solverLinear in Graph for feasibility
15.87/13.82	
15.87/13.82	LOG: RETURN solveLinear in Graph for feasibility
15.87/13.82	Strengthening transition (result): 
15.87/13.82	<l11, l14, 1 + main_l <= main_b /\ main_b <= 4 + main_i + main_j + main_k + 2*main_l, {main_m -> 1000 + main_i + main_j + main_k + main_l, rest remain the same}>
15.87/13.82	
15.87/13.82	LOG: CALL solverLinear in Graph for feasibility
15.87/13.82	
15.87/13.82	LOG: RETURN solveLinear in Graph for feasibility
15.87/13.82	Strengthening transition (result): 
15.87/13.82	<l11, l11, main_b <= main_l /\ 1 <= main_k /\ main_b <= 4 + main_i + main_j + main_k + 2*main_l, {main_k -> -1 + main_k, main_l -> 0, main_b -> 3 + main_i + main_j + main_k, rest remain the same}>
15.87/13.82	
15.87/13.82	LOG: CALL solverLinear in Graph for feasibility
15.87/13.82	
15.87/13.82	LOG: RETURN solveLinear in Graph for feasibility
15.87/13.82	Strengthening transition (result): 
15.87/13.82	<l11, l5, main_k <= 0 /\ main_b <= main_l /\ main_b <= 4 + main_i + main_j + main_k + 2*main_l, {main_j -> 1 + main_j, main_k -> -1 + main_k, rest remain the same}>
15.87/13.82	
15.87/13.82	LOG: CALL solverLinear in Graph for feasibility
15.87/13.82	
15.87/13.82	LOG: RETURN solveLinear in Graph for feasibility
15.87/13.82	Strengthening transition (result): 
15.87/13.82	<l14, l14, 0 <= main_m, {all remain the same}>
15.87/13.82	Checking unfeasibility...
15.87/13.82	Time used: 0.0997
15.87/13.82	Some transition disabled by a set of invariant(s):
15.87/13.82	Invariant at l5: 1 + main_i <= main_j + main_a
15.87/13.82	Invariant at l11: 1 + main_l <= main_b
15.87/13.82	
15.87/13.82	Strengthening and disabling transitions...
15.87/13.82	> It's unfeasible. Removing transition: 
15.87/13.82	<l11, l11, main_b <= main_l /\ 1 <= main_k /\ main_b <= 4 + main_i + main_j + main_k + 2*main_l, {main_k -> -1 + main_k, main_l -> 0, main_b -> 3 + main_i + main_j + main_k, rest remain the same}>
15.87/13.82	> It's unfeasible. Removing transition: 
15.87/13.82	<l11, l5, main_k <= 0 /\ main_b <= main_l /\ main_b <= 4 + main_i + main_j + main_k + 2*main_l, {main_j -> 1 + main_j, main_k -> -1 + main_k, rest remain the same}>
15.87/13.82	
15.87/13.82	LOG: CALL solverLinear in Graph for feasibility
15.87/13.82	
15.87/13.82	LOG: RETURN solveLinear in Graph for feasibility
15.87/13.82	Strengthening transition (result): 
15.87/13.82	<l5, l11, 1 + main_i <= main_j + main_a /\ 1 + main_j <= main_a /\ 0 <= 3 + main_i + main_j, {main_k -> 3 + main_i + main_j, main_l -> 0, main_b -> 7 + 2*main_i + 2*main_j, rest remain the same}>
15.87/13.82	
15.87/13.82	LOG: CALL solverLinear in Graph for feasibility
15.87/13.82	
15.87/13.82	LOG: RETURN solveLinear in Graph for feasibility
15.87/13.82	Strengthening transition (result): 
15.87/13.82	<l5, l5, 4 + main_i + main_j <= 0 /\ 1 + main_i <= main_j + main_a /\ 1 + main_j <= main_a, {main_j -> 1 + main_j, main_k -> 3 + main_i + main_j, rest remain the same}>
15.87/13.82	
15.87/13.82	LOG: CALL solverLinear in Graph for feasibility
15.87/13.82	
15.87/13.82	LOG: RETURN solveLinear in Graph for feasibility
15.87/13.82	Strengthening transition (result): 
15.87/13.82	<l5, l5, main_a <= main_j /\ 1 + main_i <= main_j + main_a /\ main_i <= 98, {main_i -> 1 + main_i, main_j -> 0, main_a -> 3 + main_i, rest remain the same}>
15.87/13.82	
15.87/13.82	LOG: CALL solverLinear in Graph for feasibility
15.87/13.82	
15.87/13.82	LOG: RETURN solveLinear in Graph for feasibility
15.87/13.82	Strengthening transition (result): 
15.87/13.82	<l11, l14, 1 + main_l <= main_b /\ main_b <= 4 + main_i + main_j + main_k + 2*main_l, {main_m -> 1000 + main_i + main_j + main_k + main_l, rest remain the same}>
15.87/13.82	Checking unfeasibility...
15.87/13.82	Time used: 0.3135
15.87/13.82	Some transition disabled by a set of invariant(s):
15.87/13.82	Invariant at l5: main_a <= 2 + main_i
15.87/13.82	Invariant at l11: main_l <= 1 + main_a + main_b
15.87/13.82	Invariant at l14: main_l <= 1 + main_a + main_b
15.87/13.82	
15.87/13.82	Strengthening and disabling transitions...
15.87/13.82	> It's unfeasible. Removing transition: 
15.87/13.82	<l5, l5, 4 + main_i + main_j <= 0 /\ 1 + main_i <= main_j + main_a /\ 1 + main_j <= main_a, {main_j -> 1 + main_j, main_k -> 3 + main_i + main_j, rest remain the same}>
15.87/13.82	
15.87/13.82	LOG: CALL solverLinear in Graph for feasibility
15.87/13.82	
15.87/13.82	LOG: RETURN solveLinear in Graph for feasibility
15.87/13.82	Strengthening transition (result): 
15.87/13.82	<l5, l11, 1 + main_i <= main_j + main_a /\ 1 + main_j <= main_a /\ 0 <= 3 + main_i + main_j /\ main_a <= 2 + main_i, {main_k -> 3 + main_i + main_j, main_l -> 0, main_b -> 7 + 2*main_i + 2*main_j, rest remain the same}>
15.87/13.82	
15.87/13.82	LOG: CALL solverLinear in Graph for feasibility
15.87/13.82	
15.87/13.82	LOG: RETURN solveLinear in Graph for feasibility
15.87/13.82	Strengthening transition (result): 
15.87/13.82	<l5, l5, main_a <= main_j /\ 1 + main_i <= main_j + main_a /\ main_i <= 98 /\ main_a <= 2 + main_i, {main_i -> 1 + main_i, main_j -> 0, main_a -> 3 + main_i, rest remain the same}>
15.87/13.82	
15.87/13.82	LOG: CALL solverLinear in Graph for feasibility
15.87/13.82	
15.87/13.82	LOG: RETURN solveLinear in Graph for feasibility
15.87/13.82	Strengthening transition (result): 
15.87/13.82	<l11, l14, 1 + main_l <= main_b /\ main_l <= 1 + main_a + main_b /\ main_b <= 4 + main_i + main_j + main_k + 2*main_l, {main_m -> 1000 + main_i + main_j + main_k + main_l, rest remain the same}>
15.87/13.82	
15.87/13.82	LOG: CALL solverLinear in Graph for feasibility
15.87/13.82	
15.87/13.82	LOG: RETURN solveLinear in Graph for feasibility
15.87/13.82	Strengthening transition (result): 
15.87/13.82	<l14, l14, 0 <= main_m /\ main_l <= 1 + main_a + main_b, {all remain the same}>
15.87/13.82	Checking unfeasibility...
15.87/13.82	Time used: 0.042178
15.87/13.82	Some transition disabled by a set of invariant(s):
15.87/13.82	Invariant at l5: 1 + main_j <= main_a
15.87/13.82	Invariant at l14: 1 <= main_m
15.87/13.82	
15.87/13.82	Strengthening and disabling transitions...
15.87/13.82	> It's unfeasible. Removing transition: 
15.87/13.82	<l5, l5, main_a <= main_j /\ 1 + main_i <= main_j + main_a /\ main_i <= 98 /\ main_a <= 2 + main_i, {main_i -> 1 + main_i, main_j -> 0, main_a -> 3 + main_i, rest remain the same}>
15.87/13.82	
15.87/13.82	LOG: CALL solverLinear in Graph for feasibility
15.87/13.82	
15.87/13.82	LOG: RETURN solveLinear in Graph for feasibility
15.87/13.82	Strengthening transition (result): 
15.87/13.82	<l5, l11, 1 + main_i <= main_j + main_a /\ 1 + main_j <= main_a /\ 0 <= 3 + main_i + main_j /\ main_a <= 2 + main_i, {main_k -> 3 + main_i + main_j, main_l -> 0, main_b -> 7 + 2*main_i + 2*main_j, rest remain the same}>
15.87/13.82	
15.87/13.82	LOG: CALL solverLinear in Graph for feasibility
15.87/13.82	
15.87/13.82	LOG: RETURN solveLinear in Graph for feasibility
15.87/13.82	
15.87/13.82	LOG: CALL solverLinear in Graph for feasibility
15.87/13.82	
15.87/13.82	LOG: RETURN solveLinear in Graph for feasibility
15.87/13.82	Strengthening transition (result): 
15.87/13.82	<l14, l14, 1 <= main_m /\ main_l <= 1 + main_a + main_b, {all remain the same}>
15.87/13.82	Checking unfeasibility...
15.87/13.82	Time used: 4.10051
15.87/13.82	
15.87/13.82	Analyzing SCC {l5}...
15.87/13.82	No cycles found.
15.87/13.82	
15.87/13.82	Proving termination of subgraph 4
15.87/13.82	Analyzing SCC {l11}...
15.87/13.82	No cycles found.
15.87/13.82	
15.87/13.82	Proving termination of subgraph 5
15.87/13.82	Checking unfeasibility...
15.87/13.82	Time used: 0.00412
15.87/13.82	
15.87/13.82	> No variable changes in termination graph.
15.87/13.82	Checking conditional unfeasibility...
15.87/13.82	Calling Safety with literal 1 + main_m <= 0 and entry <l14, l14, true, {all remain the same}>
15.87/13.82	
15.87/13.82	LOG: CALL check - Post:1 + main_m <= 0 - Process 1
15.87/13.82	* Exit transition: <l14, l14, true, {all remain the same}>
15.87/13.82	* Postcondition  : 1 + main_m <= 0
15.87/13.82	Postcodition moved up: 1 + main_m <= 0
15.87/13.82	
15.87/13.82	LOG: Try proving POST
15.87/13.82	
15.87/13.82	LOG: CALL check - Post:1 + main_m <= 0 - Process 2
15.87/13.82	* Exit transition: <l11, l14, 1 + main_l <= main_b /\ main_l <= 1 + main_a + main_b /\ main_b <= 4 + main_i + main_j + main_k + 2*main_l, {main_m -> 1000 + main_i + main_j + main_k + main_l, rest remain the same}>
15.87/13.82	* Postcondition  : 1 + main_m <= 0
15.87/13.82	Postcodition moved up: 1001 + main_i + main_j + main_k + main_l <= 0
15.87/13.82	
15.87/13.82	LOG: Try proving POST
15.87/13.82	
15.87/13.82	LOG: CALL check - Post:1001 + main_i + main_j + main_k + main_l <= 0 - Process 3
15.87/13.82	* Exit transition: <l5, l11, 1 + main_i <= main_j + main_a /\ 1 + main_j <= main_a /\ 0 <= 3 + main_i + main_j /\ main_a <= 2 + main_i, {main_k -> 3 + main_i + main_j, main_l -> 0, main_b -> 7 + 2*main_i + 2*main_j, rest remain the same}>
15.87/13.82	* Postcondition  : 1001 + main_i + main_j + main_k + main_l <= 0
15.87/13.82	Postcodition moved up: 502 + main_i + main_j <= 0
15.87/13.82	
15.87/13.82	LOG: Try proving POST
15.87/13.82	
15.87/13.82	LOG: CALL check - Post:502 + main_i + main_j <= 0 - Process 4
15.87/13.82	* Exit transition: <l0, l5, main_i = 0, {main_j -> 0, main_a -> 2, rest remain the same}>
15.87/13.82	* Postcondition  : 502 + main_i + main_j <= 0
15.87/13.82	
15.87/13.82	LOG: CALL solveLinear
15.87/13.82	
15.87/13.82	LOG: RETURN solveLinear - Elapsed time: 0.000412s
15.87/13.82	> Postcondition is not implied!
15.87/13.82	
15.87/13.82	LOG: RETURN check - Elapsed time: 0.000493s
15.87/13.82	
15.87/13.82	LOG: NarrowEntry size 1
15.87/13.82	ENTRIES:
15.87/13.82	<l0, l5, main_i = 0, {main_j -> 0, main_a -> 2, rest remain the same}>
15.87/13.82	END ENTRIES:
15.87/13.82	GRAPH:
15.87/13.82	END GRAPH:
15.87/13.82	EXIT: <l5, l11, 1 + main_i <= main_j + main_a /\ 1 + main_j <= main_a /\ 0 <= 3 + main_i + main_j /\ main_a <= 2 + main_i, {main_k -> 3 + main_i + main_j, main_l -> 0, main_b -> 7 + 2*main_i + 2*main_j, rest remain the same}>
15.87/13.82	POST: 1001 + main_i + main_j + main_k + main_l <= 0
15.87/13.82	
15.87/13.82	
15.87/13.82	LOG: Try proving POST
15.87/13.82	[46970 : 46972]
15.87/13.82	[46970 : 46973]
15.87/13.82	
15.87/13.82	LOG: Postcondition is not implied - no solution
15.87/13.82	> Postcondition is not implied!
15.87/13.82	
15.87/13.82	LOG: RETURN check - Elapsed time: 0.042641s
15.87/13.82	
15.87/13.82	LOG: NarrowEntry size 1
15.87/13.82	ENTRIES:
15.87/13.82	<l5, l11, 1 + main_i <= main_j + main_a /\ 1 + main_j <= main_a /\ 0 <= 3 + main_i + main_j /\ main_a <= 2 + main_i, {main_k -> 3 + main_i + main_j, main_l -> 0, main_b -> 7 + 2*main_i + 2*main_j, rest remain the same}>
15.87/13.82	END ENTRIES:
15.87/13.82	GRAPH:
15.87/13.82	END GRAPH:
15.87/13.82	EXIT: <l11, l14, 1 + main_l <= main_b /\ main_l <= 1 + main_a + main_b /\ main_b <= 4 + main_i + main_j + main_k + 2*main_l, {main_m -> 1000 + main_i + main_j + main_k + main_l, rest remain the same}>
15.87/13.82	POST: 1 + main_m <= 0
15.87/13.82	
15.87/13.82	
15.87/13.82	LOG: Try proving POST
15.87/13.82	[46970 : 46974]
15.87/13.82	[46970 : 46975]
15.87/13.82	[46970 : 46976]
15.87/13.82	
15.87/13.82	LOG: Postcondition is not implied - no solution
15.87/13.82	> Postcondition is not implied!
15.87/13.82	
15.87/13.82	LOG: RETURN check - Elapsed time: 4.156598s
15.87/13.82	
15.87/13.82	LOG: NarrowEntry size 1
15.87/13.82	Narrowing transition: 
15.87/13.82	<l14, l14, 1 <= main_m /\ main_l <= 1 + main_a + main_b, {all remain the same}>
15.87/13.82	
15.87/13.82	LOG: Narrow transition size 1
15.87/13.82	ENTRIES:
15.87/13.82	<l11, l14, 1 + main_l <= main_b /\ main_l <= 1 + main_a + main_b /\ 0 <= 1000 + main_i + main_j + main_k + main_l /\ main_b <= 4 + main_i + main_j + main_k + 2*main_l, {main_m -> 1000 + main_i + main_j + main_k + main_l, rest remain the same}>
15.87/13.82	END ENTRIES:
15.87/13.82	GRAPH:
15.87/13.82	<l14, l14, 1 <= main_m /\ main_l <= 1 + main_a + main_b, {all remain the same}>
15.87/13.82	END GRAPH:
15.87/13.82	EXIT: <l14, l14, true, {all remain the same}>
15.87/13.82	POST: 1 + main_m <= 0
15.87/13.82	
15.87/13.82	
15.87/13.82	LOG: Try proving POST
15.87/13.82	[46970 : 46979]
15.87/13.82	[46970 : 46980]
15.87/13.82	[46970 : 46981]
15.87/13.82	
15.87/13.82	LOG: Postcondition is not implied - no solution
15.87/13.82	> Postcondition is not implied!
15.87/13.82	
15.87/13.82	LOG: RETURN check - Elapsed time: 8.275593s
15.87/13.82	
15.87/13.82	[46970 : 47134]
15.87/13.82	[46970 : 47138]
15.87/13.82	Successful child: 47134
15.87/13.82	
15.87/13.82	Program does NOT terminate
15.87/13.82	EOF