10.10/10.19	NO
10.10/10.19	
10.10/10.19	Solver Timeout: 4
10.10/10.19	Global Timeout: 300
10.10/10.19	No parsing errors!
10.10/10.19	Init Location: 0
10.10/10.19	Transitions:
10.10/10.19	<l0, l7, true>
10.10/10.19	<l1, l2, true>
10.10/10.19	<l3, l4, true>
10.10/10.19	<l4, l3, (undef12 = undef12), par{j^0 -> (~(1) + j^0), temp^0 -> undef12}>
10.10/10.19	<l4, l1, true, par{i^0 -> (1 + i^0)}>
10.10/10.19	<l2, l5, ((1 + __const_10^0) <= (0 + i^0))>
10.10/10.19	<l2, l3, ((0 + i^0) <= (0 + __const_10^0)), par{j^0 -> (0 + i^0)}>
10.10/10.19	<l6, l1, true, par{i^0 -> 2}>
10.10/10.19	<l7, l6, true>
10.10/10.19	
10.10/10.19	Fresh variables:
10.10/10.19	undef12, 
10.10/10.19	
10.10/10.19	Undef variables:
10.10/10.19	undef12, 
10.10/10.19	
10.10/10.19	Abstraction variables:
10.10/10.19	
10.10/10.19	Exit nodes:
10.10/10.19	
10.10/10.19	Accepting locations:
10.10/10.19	
10.10/10.19	Asserts:
10.10/10.19	
10.10/10.19	Preprocessed LLVMGraph
10.10/10.19	Init Location: 0
10.10/10.19	Transitions:
10.10/10.19	<l0, l5, (i^0 = 2) /\ ((1 + __const_10^0) <= (0 + 2))>
10.10/10.19	<l0, l3, (i^0 = 2) /\ ((0 + 2) <= (0 + __const_10^0)), par{j^0 -> (0 + 2)}>
10.10/10.19	<l3, l3, (undef12 = undef12), par{j^0 -> (~(1) + j^0)}>
10.10/10.19	<l3, l5, ((1 + __const_10^0) <= (0 + (1 + i^0))), par{i^0 -> (1 + i^0)}>
10.10/10.19	<l3, l3, ((0 + (1 + i^0)) <= (0 + __const_10^0)), par{i^0 -> (1 + i^0), j^0 -> (0 + (1 + i^0))}>
10.10/10.19	
10.10/10.19	Fresh variables:
10.10/10.19	undef12, 
10.10/10.19	
10.10/10.19	Undef variables:
10.10/10.19	undef12, 
10.10/10.19	
10.10/10.19	Abstraction variables:
10.10/10.19	
10.10/10.19	Exit nodes:
10.10/10.19	
10.10/10.19	Accepting locations:
10.10/10.19	
10.10/10.19	Asserts:
10.10/10.19	
10.10/10.19	*************************************************************
10.10/10.19	*******************************************************************************************
10.10/10.19	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
10.10/10.19	*******************************************************************************************
10.10/10.19	
10.10/10.19	Init Location: 0
10.10/10.19	Graph 0:
10.10/10.19	Transitions:
10.10/10.19	Variables:
10.10/10.19	
10.10/10.19	Graph 1:
10.10/10.19	Transitions:
10.10/10.19	<l3, l3, true, {j^0 -> -1 + j^0, rest remain the same}>
10.10/10.19	<l3, l3, 1 + i^0 <= __const_10^0, {i^0 -> 1 + i^0, j^0 -> 1 + i^0, rest remain the same}>
10.10/10.19	Variables:
10.10/10.19	j^0, __const_10^0, i^0
10.10/10.19	
10.10/10.19	Graph 2:
10.10/10.19	Transitions:
10.10/10.19	Variables:
10.10/10.19	
10.10/10.19	Precedence: 
10.10/10.19	Graph 0
10.10/10.19	
10.10/10.19	Graph 1
10.10/10.19	<l0, l3, 2 <= __const_10^0 /\ i^0 = 2, {j^0 -> 2, rest remain the same}>
10.10/10.19	
10.10/10.19	Graph 2
10.10/10.19	<l0, l5, __const_10^0 <= 1 /\ i^0 = 2, {all remain the same}>
10.10/10.19	<l3, l5, __const_10^0 <= i^0, {i^0 -> 1 + i^0, rest remain the same}>
10.10/10.19	
10.10/10.19	Map Locations to Subgraph:
10.10/10.19	( 0 , 0 )
10.10/10.19	( 3 , 1 )
10.10/10.19	( 5 , 2 )
10.10/10.19	
10.10/10.19	*******************************************************************************************
10.10/10.19	********************************    CHECKING ASSERTIONS    ********************************
10.10/10.19	*******************************************************************************************
10.10/10.19	
10.10/10.19	Proving termination of subgraph 0
10.10/10.19	Proving termination of subgraph 1
10.10/10.19	Checking unfeasibility...
10.10/10.19	Time used: 0.005498
10.10/10.19	
10.10/10.19	Checking conditional termination of SCC {l3}...
10.10/10.19	
10.10/10.19	LOG: CALL solveLinear
10.10/10.19	
10.10/10.19	LOG: RETURN solveLinear - Elapsed time: 0.001167s
10.10/10.19	Ranking function: __const_10^0 - i^0
10.10/10.19	New Graphs: 
10.10/10.19	Transitions:
10.10/10.19	<l3, l3, true, {j^0 -> -1 + j^0, rest remain the same}>
10.10/10.19	Variables:
10.10/10.19	j^0
10.10/10.19	Checking conditional termination of SCC {l3}...
10.10/10.19	
10.10/10.19	LOG: CALL solveLinear
10.10/10.19	
10.10/10.19	LOG: RETURN solveLinear - Elapsed time: 0.000426s
10.10/10.19	
10.10/10.19	LOG: CALL solveLinear
10.10/10.19	
10.10/10.19	LOG: RETURN solveLinear - Elapsed time: 0.000876s
10.10/10.19	Trying to remove transition: <l3, l3, true, {j^0 -> -1 + j^0, rest remain the same}>
10.10/10.19	Solving with 1 template(s).
10.10/10.19	
10.10/10.19	LOG: CALL solveNonLinearGetFirstSolution
10.10/10.19	
10.10/10.19	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.002869s
10.10/10.19	Time used: 0.002759
10.10/10.19	Solving with 1 template(s).
10.10/10.19	
10.10/10.19	LOG: CALL solveNonLinearGetFirstSolution
10.10/10.19	
10.10/10.19	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012307s
10.10/10.19	Time used: 0.012115
10.10/10.19	Solving with 2 template(s).
10.10/10.19	
10.10/10.19	LOG: CALL solveNonLinearGetFirstSolution
10.10/10.19	
10.10/10.19	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001230s
10.10/10.19	Time used: 4.00057
10.10/10.19	Solving with 3 template(s).
10.10/10.19	
10.10/10.19	LOG: CALL solveNonLinearGetFirstSolution
10.10/10.19	
10.10/10.19	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.005656s
10.10/10.19	Time used: 1.00015
10.10/10.19	Solving with 1 template(s).
10.10/10.19	
10.10/10.19	LOG: CALL solveNonLinearGetFirstSolution
10.10/10.19	
10.10/10.19	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.024798s
10.10/10.19	Time used: 0.012459
10.10/10.19	Improving Solution with cost 1 ...
10.10/10.19	
10.10/10.19	LOG: CALL solveNonLinearGetNextSolution
10.10/10.19	
10.10/10.19	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.025437s
10.10/10.19	Time used: 0.025431
10.10/10.19	
10.10/10.19	LOG: SAT solveNonLinear - Elapsed time: 0.050235s
10.10/10.19	Cost: 1; Total time: 0.03789
10.10/10.19	Termination implied by a set of invariant(s):
10.10/10.19	Invariant at l3: 0 <= __const_10^0 + i^0
10.10/10.19	[ Invariant Graph ]
10.10/10.19	Strengthening and disabling transitions...
10.10/10.19	
10.10/10.19	LOG: CALL solverLinear in Graph for feasibility
10.10/10.19	
10.10/10.19	LOG: RETURN solveLinear in Graph for feasibility
10.10/10.19	Strengthening transition (result): 
10.10/10.19	<l3, l3, 0 <= __const_10^0 + i^0, {j^0 -> -1 + j^0, rest remain the same}>
10.10/10.19	
10.10/10.19	LOG: CALL solverLinear in Graph for feasibility
10.10/10.19	
10.10/10.19	LOG: RETURN solveLinear in Graph for feasibility
10.10/10.19	Strengthening transition (result): 
10.10/10.19	<l3, l3, 1 + i^0 <= __const_10^0 /\ 0 <= __const_10^0 + i^0, {i^0 -> 1 + i^0, j^0 -> 1 + i^0, rest remain the same}>
10.10/10.19	[ Termination Graph ]
10.10/10.19	Strengthening and disabling transitions...
10.10/10.19	
10.10/10.19	LOG: CALL solverLinear in Graph for feasibility
10.10/10.19	
10.10/10.19	LOG: RETURN solveLinear in Graph for feasibility
10.10/10.19	Strengthening transition (result): 
10.10/10.19	<l3, l3, 0 <= __const_10^0 + i^0, {j^0 -> -1 + j^0, rest remain the same}>
10.10/10.19	Quasi-ranking function: 50000 + j^0
10.10/10.19	New Graphs: 
10.10/10.19	Transitions:
10.10/10.19	<l3, l3, 0 <= __const_10^0 + i^0 /\ 50001 + j^0 <= 0, {j^0 -> -1 + j^0, rest remain the same}>
10.10/10.19	Variables:
10.10/10.19	j^0
10.10/10.19	Checking conditional termination of SCC {l3}...
10.10/10.20	
10.10/10.20	LOG: CALL solveLinear
10.10/10.20	
10.10/10.20	LOG: RETURN solveLinear - Elapsed time: 0.000471s
10.10/10.20	
10.10/10.20	LOG: CALL solveLinear
10.10/10.20	
10.10/10.20	LOG: RETURN solveLinear - Elapsed time: 0.001683s
10.10/10.20	Trying to remove transition: <l3, l3, 0 <= __const_10^0 + i^0 /\ 50001 + j^0 <= 0, {j^0 -> -1 + j^0, rest remain the same}>
10.10/10.20	Solving with 1 template(s).
10.10/10.20	
10.10/10.20	LOG: CALL solveNonLinearGetFirstSolution
10.10/10.20	
10.10/10.20	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004120s
10.10/10.20	Time used: 0.003982
10.10/10.20	Solving with 1 template(s).
10.10/10.20	
10.10/10.20	LOG: CALL solveNonLinearGetFirstSolution
10.10/10.20	
10.10/10.20	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015443s
10.10/10.20	Time used: 0.015249
10.10/10.20	Solving with 2 template(s).
10.10/10.20	
10.10/10.20	LOG: CALL solveNonLinearGetFirstSolution
10.10/10.20	
10.10/10.20	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001483s
10.10/10.20	Time used: 4.00067
10.10/10.20	Solving with 3 template(s).
10.10/10.20	
10.10/10.20	LOG: CALL solveNonLinearGetFirstSolution
10.10/10.20	
10.10/10.20	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.006185s
10.10/10.20	Time used: 1.00023
10.10/10.20	Solving with 1 template(s).
10.10/10.20	
10.10/10.20	LOG: CALL solveNonLinearGetFirstSolution
10.10/10.20	
10.10/10.20	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.025807s
10.10/10.20	Time used: 0.013906
10.10/10.20	Termination failed. Trying to show unreachability...
10.10/10.20	Proving unreachability of entry: <l0, l3, 2 <= __const_10^0 /\ i^0 = 2, {j^0 -> 2, rest remain the same}>
10.10/10.20	
10.10/10.20	LOG: CALL check - Post:1 <= 0 - Process 1
10.10/10.20	* Exit transition: <l0, l3, 2 <= __const_10^0 /\ i^0 = 2, {j^0 -> 2, rest remain the same}>
10.10/10.20	* Postcondition  : 1 <= 0
10.10/10.20	
10.10/10.20	LOG: CALL solveLinear
10.10/10.20	
10.10/10.20	LOG: RETURN solveLinear - Elapsed time: 0.001211s
10.10/10.20	> Postcondition is not implied!
10.10/10.20	
10.10/10.20	LOG: RETURN check - Elapsed time: 0.001295s
10.10/10.20	Cannot prove unreachability
10.10/10.20	
10.10/10.20	Proving non-termination of subgraph 1
10.10/10.20	Transitions:
10.10/10.20	<l3, l3, true, {j^0 -> -1 + j^0, rest remain the same}>
10.10/10.20	<l3, l3, 1 + i^0 <= __const_10^0, {i^0 -> 1 + i^0, j^0 -> 1 + i^0, rest remain the same}>
10.10/10.20	Variables:
10.10/10.20	j^0, __const_10^0, i^0
10.10/10.20	
10.10/10.20	Checking conditional non-termination of SCC {l3}...
10.10/10.20	> No exit transition to close.
10.10/10.20	Calling reachability with...
10.10/10.20	Transition: <l3, end, true, {all remain the same}>
10.10/10.20	Conditions: 
10.10/10.20	OPEN EXITS: 
10.10/10.20	<l3, end, true, {all remain the same}>
10.10/10.20	
10.10/10.20	--- Reachability graph ---
10.10/10.20	> Graph without transitions.
10.10/10.20	
10.10/10.20	Calling reachability with...
10.10/10.20	Transition: <l0, l3, 2 <= __const_10^0 /\ i^0 = 2, {j^0 -> 2, rest remain the same}>
10.10/10.20	Conditions: 
10.10/10.20	OPEN EXITS: 
10.10/10.20	<l0, l3, 2 <= __const_10^0 /\ i^0 = 2, {j^0 -> 2, rest remain the same}>
10.10/10.20	
10.10/10.20	> Conditions are reachable!
10.10/10.20	
10.10/10.20	Program does NOT terminate
10.10/10.20	/export/starexec/sandbox2/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
10.10/10.20	/export/starexec/sandbox2/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
10.10/10.20	EOF