5.36/5.39	NO
5.36/5.39	
5.36/5.39	Solver Timeout: 4
5.36/5.39	Global Timeout: 300
5.36/5.39	No parsing errors!
5.36/5.39	Init Location: 0
5.36/5.39	Transitions:
5.36/5.39	<l0, l10, true>
5.36/5.39	<l1, l2, true>
5.36/5.39	<l2, l3, ((1 + a_13^0) <= 1), par{result_11^0 -> (0 + temp0_14^0)}>
5.36/5.39	<l2, l4, (1 <= (0 + a_13^0)) /\ (undef19 = undef19) /\ (undef18 = (0 + undef19)) /\ (undef15 = undef15) /\ ((0 + a_13^0) <= (0 + (2 * undef18))) /\ ((0 + (2 * undef18)) <= (0 + a_13^0)) /\ (undef13 = (0 + undef18)) /\ ((0 + undef13) <= (0 + undef18)) /\ ((0 + undef18) <= (0 + undef13)) /\ (1 <= (0 + (2 * undef18))), par{a_13^0 -> undef13, nondet_12^0 -> undef15, x_15^0 -> undef18}>
5.36/5.39	<l4, l2, true>
5.36/5.39	<l2, l5, (undef27 = undef27) /\ (1 <= (0 + a_13^0)) /\ (undef32 = undef32) /\ (undef28 = undef28), par{a_21^0 -> undef27, nondet_12^0 -> undef28, x_15^0 -> (0 + undef32)}>
5.36/5.39	<l5, l6, ((1 + a_13^0) <= (0 + (2 * x_15^0)))>
5.36/5.39	<l5, l6, ((1 + (2 * x_15^0)) <= (0 + a_13^0))>
5.36/5.39	<l6, l7, (undef45 = (1 + (3 * a_13^0))) /\ ((0 + undef45) <= (1 + (3 * a_21^0))) /\ ((1 + (3 * a_21^0)) <= (0 + undef45)), par{a_13^0 -> undef45}>
5.36/5.39	<l7, l8, ((1 + a_21^0) <= (0 + (2 * x_15^0)))>
5.36/5.39	<l7, l8, ((1 + (2 * x_15^0)) <= (0 + a_21^0))>
5.36/5.39	<l8, l9, (1 <= (0 + a_21^0))>
5.36/5.39	<l9, l2, true>
5.36/5.39	<l10, l1, true>
5.36/5.39	
5.36/5.39	Fresh variables:
5.36/5.39	undef13, undef15, undef18, undef19, undef27, undef28, undef32, undef45, 
5.36/5.39	
5.36/5.39	Undef variables:
5.36/5.39	undef13, undef15, undef18, undef19, undef27, undef28, undef32, undef45, 
5.36/5.39	
5.36/5.39	Abstraction variables:
5.36/5.39	
5.36/5.39	Exit nodes:
5.36/5.39	
5.36/5.39	Accepting locations:
5.36/5.39	
5.36/5.39	Asserts:
5.36/5.39	
5.36/5.39	Preprocessed LLVMGraph
5.36/5.39	Init Location: 0
5.36/5.39	Transitions:
5.36/5.39	<l0, l2, true>
5.36/5.39	<l2, l3, ((1 + a_13^0) <= 1)>
5.36/5.39	<l2, l2, (1 <= (0 + a_13^0)) /\ (undef19 = undef19) /\ (undef18 = (0 + undef19)) /\ (undef15 = undef15) /\ ((0 + a_13^0) <= (0 + (2 * undef18))) /\ ((0 + (2 * undef18)) <= (0 + a_13^0)) /\ (undef13 = (0 + undef18)) /\ ((0 + undef13) <= (0 + undef18)) /\ ((0 + undef18) <= (0 + undef13)) /\ (1 <= (0 + (2 * undef18))), par{a_13^0 -> undef13}>
5.36/5.39	<l2, l2, (undef27 = undef27) /\ (1 <= (0 + a_13^0)) /\ (undef32 = undef32) /\ (undef28 = undef28) /\ ((1 + a_13^0) <= (0 + (2 * (0 + undef32)))) /\ (undef45 = (1 + (3 * a_13^0))) /\ ((0 + undef45) <= (1 + (3 * undef27))) /\ ((1 + (3 * undef27)) <= (0 + undef45)) /\ ((1 + undef27) <= (0 + (2 * (0 + undef32)))) /\ (1 <= (0 + undef27)), par{a_13^0 -> undef45}>
5.36/5.39	<l2, l2, (undef27 = undef27) /\ (1 <= (0 + a_13^0)) /\ (undef32 = undef32) /\ (undef28 = undef28) /\ ((1 + (2 * (0 + undef32))) <= (0 + a_13^0)) /\ (undef45 = (1 + (3 * a_13^0))) /\ ((0 + undef45) <= (1 + (3 * undef27))) /\ ((1 + (3 * undef27)) <= (0 + undef45)) /\ ((1 + (2 * (0 + undef32))) <= (0 + undef27)) /\ (1 <= (0 + undef27)), par{a_13^0 -> undef45}>
5.36/5.39	
5.36/5.39	Fresh variables:
5.36/5.39	undef13, undef15, undef18, undef19, undef27, undef28, undef32, undef45, 
5.36/5.39	
5.36/5.39	Undef variables:
5.36/5.39	undef13, undef15, undef18, undef19, undef27, undef28, undef32, undef45, 
5.36/5.39	
5.36/5.39	Abstraction variables:
5.36/5.39	
5.36/5.39	Exit nodes:
5.36/5.39	
5.36/5.39	Accepting locations:
5.36/5.39	
5.36/5.39	Asserts:
5.36/5.39	
5.36/5.39	*************************************************************
5.36/5.39	*******************************************************************************************
5.36/5.39	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
5.36/5.39	*******************************************************************************************
5.36/5.39	
5.36/5.39	Init Location: 0
5.36/5.39	Graph 0:
5.36/5.39	Transitions:
5.36/5.39	Variables:
5.36/5.39	
5.36/5.39	Graph 1:
5.36/5.39	Transitions:
5.36/5.39	<l2, l2, 1 <= a_13^0 /\ 1 <= undef18 /\ a_13^0 = 2*undef18 /\ undef13 = undef18 /\ undef18 = undef19, {a_13^0 -> undef13, rest remain the same}>
5.36/5.39	<l2, l2, 1 + a_13^0 <= 2*undef32 /\ 1 <= a_13^0 /\ 1 + undef27 <= 2*undef32 /\ 1 <= undef27 /\ 1 + 3*a_13^0 = undef45 /\ 1 + 3*undef27 = undef45, {a_13^0 -> undef45, rest remain the same}>
5.36/5.39	<l2, l2, 1 <= a_13^0 /\ 1 + 2*undef32 <= a_13^0 /\ 1 <= undef27 /\ 1 + 2*undef32 <= undef27 /\ 1 + 3*a_13^0 = undef45 /\ 1 + 3*undef27 = undef45, {a_13^0 -> undef45, rest remain the same}>
5.36/5.39	Variables:
5.36/5.39	a_13^0
5.36/5.39	
5.36/5.39	Graph 2:
5.36/5.39	Transitions:
5.36/5.39	Variables:
5.36/5.39	
5.36/5.39	Precedence: 
5.36/5.39	Graph 0
5.36/5.39	
5.36/5.39	Graph 1
5.36/5.39	<l0, l2, true, {all remain the same}>
5.36/5.39	
5.36/5.39	Graph 2
5.36/5.39	<l2, l3, a_13^0 <= 0, {all remain the same}>
5.36/5.39	
5.36/5.39	Map Locations to Subgraph:
5.36/5.39	( 0 , 0 )
5.36/5.39	( 2 , 1 )
5.36/5.39	( 3 , 2 )
5.36/5.39	
5.36/5.39	*******************************************************************************************
5.36/5.39	********************************    CHECKING ASSERTIONS    ********************************
5.36/5.39	*******************************************************************************************
5.36/5.39	
5.36/5.39	Proving termination of subgraph 0
5.36/5.39	Proving termination of subgraph 1
5.36/5.39	Checking unfeasibility...
5.36/5.39	Time used: 0.004919
5.36/5.39	
5.36/5.39	Checking conditional termination of SCC {l2}...
5.36/5.39	
5.36/5.39	LOG: CALL solveLinear
5.36/5.39	
5.36/5.39	LOG: RETURN solveLinear - Elapsed time: 0.002128s
5.36/5.39	
5.36/5.39	LOG: CALL solveLinear
5.36/5.39	
5.36/5.39	LOG: RETURN solveLinear - Elapsed time: 0.021740s
5.36/5.39	Trying to remove transition: <l2, l2, 1 <= a_13^0 /\ 1 + 2*undef32 <= a_13^0 /\ 1 <= undef27 /\ 1 + 2*undef32 <= undef27 /\ 1 + 3*a_13^0 = undef45 /\ 1 + 3*undef27 = undef45, {a_13^0 -> undef45, rest remain the same}>
5.36/5.39	Solving with 1 template(s).
5.36/5.39	
5.36/5.39	LOG: CALL solveNonLinearGetFirstSolution
5.36/5.39	
5.36/5.39	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009690s
5.36/5.39	Time used: 0.00892
5.36/5.39	Trying to remove transition: <l2, l2, 1 + a_13^0 <= 2*undef32 /\ 1 <= a_13^0 /\ 1 + undef27 <= 2*undef32 /\ 1 <= undef27 /\ 1 + 3*a_13^0 = undef45 /\ 1 + 3*undef27 = undef45, {a_13^0 -> undef45, rest remain the same}>
5.36/5.39	Solving with 1 template(s).
5.36/5.39	
5.36/5.39	LOG: CALL solveNonLinearGetFirstSolution
5.36/5.39	
5.36/5.39	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009400s
5.36/5.39	Time used: 0.008763
5.36/5.39	Trying to remove transition: <l2, l2, 1 <= a_13^0 /\ 1 <= undef18 /\ a_13^0 = 2*undef18 /\ undef13 = undef18 /\ undef18 = undef19, {a_13^0 -> undef13, rest remain the same}>
5.36/5.39	Solving with 1 template(s).
5.36/5.39	
5.36/5.39	LOG: CALL solveNonLinearGetFirstSolution
5.36/5.39	
5.36/5.39	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009357s
5.36/5.39	Time used: 0.008709
5.36/5.39	Solving with 1 template(s).
5.36/5.39	
5.36/5.39	LOG: CALL solveNonLinearGetFirstSolution
5.36/5.39	
5.36/5.39	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.023134s
5.36/5.39	Time used: 0.022351
5.36/5.39	Improving Solution with cost 1 ...
5.36/5.39	
5.36/5.39	LOG: CALL solveNonLinearGetNextSolution
5.36/5.39	
5.36/5.39	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.054020s
5.36/5.39	Time used: 0.054007
5.36/5.39	
5.36/5.39	LOG: SAT solveNonLinear - Elapsed time: 0.077154s
5.36/5.39	Cost: 1; Total time: 0.076358
5.36/5.39	Failed at location 2: a_13^0 <= 0
5.36/5.39	Before Improving: 
5.36/5.39	Quasi-invariant at l2: a_13^0 <= 0
5.36/5.39	Optimizing invariants...
5.36/5.39	
5.36/5.39	LOG: CALL solveLinear
5.36/5.39	
5.36/5.39	LOG: RETURN solveLinear - Elapsed time: 0.009658s
5.36/5.39	Remaining time after improvement: 0.996249
5.36/5.39	Termination implied by a set of quasi-invariant(s):
5.36/5.39	Quasi-invariant at l2: a_13^0 <= 0
5.36/5.39	[ Invariant Graph ]
5.36/5.39	Strengthening and disabling transitions...
5.36/5.39	
5.36/5.39	LOG: CALL solverLinear in Graph for feasibility
5.36/5.39	
5.36/5.39	LOG: RETURN solveLinear in Graph for feasibility
5.36/5.39	It's unfeasible. Removing transition: 
5.36/5.39	<l2, l2, 1 <= a_13^0 /\ 1 <= undef18 /\ a_13^0 = 2*undef18 /\ undef13 = undef18 /\ undef18 = undef19, {a_13^0 -> undef13, rest remain the same}>
5.36/5.39	
5.36/5.39	LOG: CALL solverLinear in Graph for feasibility
5.36/5.39	
5.36/5.39	LOG: RETURN solveLinear in Graph for feasibility
5.36/5.39	It's unfeasible. Removing transition: 
5.36/5.39	<l2, l2, 1 + a_13^0 <= 2*undef32 /\ 1 <= a_13^0 /\ 1 + undef27 <= 2*undef32 /\ 1 <= undef27 /\ 1 + 3*a_13^0 = undef45 /\ 1 + 3*undef27 = undef45, {a_13^0 -> undef45, rest remain the same}>
5.36/5.39	
5.36/5.39	LOG: CALL solverLinear in Graph for feasibility
5.36/5.39	
5.36/5.39	LOG: RETURN solveLinear in Graph for feasibility
5.36/5.39	It's unfeasible. Removing transition: 
5.36/5.39	<l2, l2, 1 <= a_13^0 /\ 1 + 2*undef32 <= a_13^0 /\ 1 <= undef27 /\ 1 + 2*undef32 <= undef27 /\ 1 + 3*a_13^0 = undef45 /\ 1 + 3*undef27 = undef45, {a_13^0 -> undef45, rest remain the same}>
5.36/5.39	[ Termination Graph ]
5.36/5.39	Strengthening and disabling transitions...
5.36/5.39	> It's unfeasible. Removing transition: 
5.36/5.39	<l2, l2, 1 <= a_13^0 /\ 1 + 2*undef32 <= a_13^0 /\ 1 <= undef27 /\ 1 + 2*undef32 <= undef27 /\ 1 + 3*a_13^0 = undef45 /\ 1 + 3*undef27 = undef45, {a_13^0 -> undef45, rest remain the same}>
5.36/5.39	
5.36/5.39	LOG: CALL solverLinear in Graph for feasibility
5.36/5.39	
5.36/5.39	LOG: RETURN solveLinear in Graph for feasibility
5.36/5.39	It's unfeasible. Removing transition: 
5.36/5.39	<l2, l2, 1 <= a_13^0 /\ 1 <= undef18 /\ a_13^0 = 2*undef18 /\ undef13 = undef18 /\ undef18 = undef19, {a_13^0 -> undef13, rest remain the same}>
5.36/5.39	
5.36/5.39	LOG: CALL solverLinear in Graph for feasibility
5.36/5.39	
5.36/5.39	LOG: RETURN solveLinear in Graph for feasibility
5.36/5.39	It's unfeasible. Removing transition: 
5.36/5.39	<l2, l2, 1 + a_13^0 <= 2*undef32 /\ 1 <= a_13^0 /\ 1 + undef27 <= 2*undef32 /\ 1 <= undef27 /\ 1 + 3*a_13^0 = undef45 /\ 1 + 3*undef27 = undef45, {a_13^0 -> undef45, rest remain the same}>
5.36/5.39	New Graphs: 
5.36/5.39	Calling Safety with literal a_13^0 <= 0 and entry <l0, l2, true, {all remain the same}>
5.36/5.39	
5.36/5.39	LOG: CALL check - Post:a_13^0 <= 0 - Process 1
5.36/5.39	* Exit transition: <l0, l2, true, {all remain the same}>
5.36/5.39	* Postcondition  : a_13^0 <= 0
5.36/5.39	
5.36/5.39	LOG: CALL solveLinear
5.36/5.39	
5.36/5.39	LOG: RETURN solveLinear - Elapsed time: 0.000582s
5.36/5.39	> Postcondition is not implied!
5.36/5.39	
5.36/5.39	LOG: RETURN check - Elapsed time: 0.000645s
5.36/5.39	INVARIANTS: 
5.36/5.39	2: 
5.36/5.39	Quasi-INVARIANTS to narrow Graph: 
5.36/5.39	2: a_13^0 <= 0 , 
5.36/5.39	Narrowing transition: 
5.36/5.39	<l2, l2, 1 <= a_13^0 /\ 1 <= undef18 /\ a_13^0 = 2*undef18 /\ undef13 = undef18 /\ undef18 = undef19, {a_13^0 -> undef13, rest remain the same}>
5.36/5.39	
5.36/5.39	LOG: Narrow transition size 1
5.36/5.39	Narrowing transition: 
5.36/5.39	<l2, l2, 1 + a_13^0 <= 2*undef32 /\ 1 <= a_13^0 /\ 1 + undef27 <= 2*undef32 /\ 1 <= undef27 /\ 1 + 3*a_13^0 = undef45 /\ 1 + 3*undef27 = undef45, {a_13^0 -> undef45, rest remain the same}>
5.36/5.39	
5.36/5.39	LOG: Narrow transition size 1
5.36/5.39	Narrowing transition: 
5.36/5.39	<l2, l2, 1 <= a_13^0 /\ 1 + 2*undef32 <= a_13^0 /\ 1 <= undef27 /\ 1 + 2*undef32 <= undef27 /\ 1 + 3*a_13^0 = undef45 /\ 1 + 3*undef27 = undef45, {a_13^0 -> undef45, rest remain the same}>
5.36/5.39	
5.36/5.39	LOG: Narrow transition size 1
5.36/5.39	invGraph after Narrowing: 
5.36/5.39	Transitions:
5.36/5.39	<l2, l2, 1 <= a_13^0 /\ 1 <= undef18 /\ a_13^0 = 2*undef18 /\ undef13 = undef18 /\ undef18 = undef19, {a_13^0 -> undef13, rest remain the same}>
5.36/5.39	<l2, l2, 1 + a_13^0 <= 2*undef32 /\ 1 <= a_13^0 /\ 1 + undef27 <= 2*undef32 /\ 1 <= undef27 /\ 1 + 3*a_13^0 = undef45 /\ 1 + 3*undef27 = undef45, {a_13^0 -> undef45, rest remain the same}>
5.36/5.39	<l2, l2, 1 <= a_13^0 /\ 1 + 2*undef32 <= a_13^0 /\ 1 <= undef27 /\ 1 + 2*undef32 <= undef27 /\ 1 + 3*a_13^0 = undef45 /\ 1 + 3*undef27 = undef45, {a_13^0 -> undef45, rest remain the same}>
5.36/5.39	Variables:
5.36/5.39	a_13^0
5.36/5.39	Checking conditional termination of SCC {l2}...
5.36/5.39	
5.36/5.39	LOG: CALL solveLinear
5.36/5.39	
5.36/5.39	LOG: RETURN solveLinear - Elapsed time: 0.002004s
5.36/5.39	
5.36/5.39	LOG: CALL solveLinear
5.36/5.39	
5.36/5.39	LOG: RETURN solveLinear - Elapsed time: 0.019759s
5.36/5.39	Trying to remove transition: <l2, l2, 1 <= a_13^0 /\ 1 + 2*undef32 <= a_13^0 /\ 1 <= undef27 /\ 1 + 2*undef32 <= undef27 /\ 1 + 3*a_13^0 = undef45 /\ 1 + 3*undef27 = undef45, {a_13^0 -> undef45, rest remain the same}>
5.36/5.39	Solving with 1 template(s).
5.36/5.39	
5.36/5.39	LOG: CALL solveNonLinearGetFirstSolution
5.36/5.39	
5.36/5.39	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009692s
5.36/5.39	Time used: 0.008854
5.36/5.39	Trying to remove transition: <l2, l2, 1 + a_13^0 <= 2*undef32 /\ 1 <= a_13^0 /\ 1 + undef27 <= 2*undef32 /\ 1 <= undef27 /\ 1 + 3*a_13^0 = undef45 /\ 1 + 3*undef27 = undef45, {a_13^0 -> undef45, rest remain the same}>
5.36/5.39	Solving with 1 template(s).
5.36/5.39	
5.36/5.39	LOG: CALL solveNonLinearGetFirstSolution
5.36/5.39	
5.36/5.39	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009463s
5.36/5.39	Time used: 0.008753
5.36/5.39	Trying to remove transition: <l2, l2, 1 <= a_13^0 /\ 1 <= undef18 /\ a_13^0 = 2*undef18 /\ undef13 = undef18 /\ undef18 = undef19, {a_13^0 -> undef13, rest remain the same}>
5.36/5.39	Solving with 1 template(s).
5.36/5.39	
5.36/5.39	LOG: CALL solveNonLinearGetFirstSolution
5.36/5.39	
5.36/5.39	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009434s
5.36/5.39	Time used: 0.008732
5.36/5.39	Solving with 1 template(s).
5.36/5.39	
5.36/5.39	LOG: CALL solveNonLinearGetFirstSolution
5.36/5.39	
5.36/5.39	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.028275s
5.36/5.39	Time used: 0.02759
5.36/5.39	Solving with 2 template(s).
5.36/5.39	
5.36/5.39	LOG: CALL solveNonLinearGetFirstSolution
5.36/5.39	
5.36/5.39	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.016256s
5.36/5.39	Time used: 4.01417
5.36/5.39	Solving with 3 template(s).
5.36/5.39	
5.36/5.39	LOG: CALL solveNonLinearGetFirstSolution
5.36/5.39	
5.36/5.39	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.016782s
5.36/5.39	Time used: 1.00103
5.36/5.39	Solving with 1 template(s).
5.36/5.39	
5.36/5.39	LOG: CALL solveNonLinearGetFirstSolution
5.36/5.39	
5.36/5.39	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.043436s
5.36/5.39	Time used: 0.019651
5.36/5.39	
5.36/5.39	Proving non-termination of subgraph 1
5.36/5.39	Transitions:
5.36/5.39	<l2, l2, 1 <= a_13^0 /\ 1 <= undef18 /\ a_13^0 = 2*undef18 /\ undef13 = undef18 /\ undef18 = undef19, {a_13^0 -> undef13, rest remain the same}>
5.36/5.39	<l2, l2, 1 + a_13^0 <= 2*undef32 /\ 1 <= a_13^0 /\ 1 + undef27 <= 2*undef32 /\ 1 <= undef27 /\ 1 + 3*a_13^0 = undef45 /\ 1 + 3*undef27 = undef45, {a_13^0 -> undef45, rest remain the same}>
5.36/5.39	<l2, l2, 1 <= a_13^0 /\ 1 + 2*undef32 <= a_13^0 /\ 1 <= undef27 /\ 1 + 2*undef32 <= undef27 /\ 1 + 3*a_13^0 = undef45 /\ 1 + 3*undef27 = undef45, {a_13^0 -> undef45, rest remain the same}>
5.36/5.39	Variables:
5.36/5.39	a_13^0
5.36/5.39	
5.36/5.39	Checking that every undef value has an assignment...
5.36/5.39	
5.36/5.39	LOG: CALL solveLinear
5.36/5.39	
5.36/5.39	LOG: RETURN solveLinear - Elapsed time: 0.002307s
5.36/5.39	Checking conditional non-termination of SCC {l2}...
5.36/5.39	> No assignment for some undef value.
5.36/5.39	> Checking if the negation of the conditions of every pending exit is quasi-invariant... YES
5.36/5.39	Calling reachability with...
5.36/5.39	Transition: <l2, end, true, {all remain the same}>
5.36/5.39	Conditions: 1 <= a_13^0, 
5.36/5.39	OPEN EXITS: 
5.36/5.39	<l2, end, 1 <= a_13^0, {all remain the same}>
5.36/5.39	
5.36/5.39	--- Reachability graph ---
5.36/5.39	> Graph without transitions.
5.36/5.39	
5.36/5.39	Calling reachability with...
5.36/5.39	Transition: <l0, l2, true, {all remain the same}>
5.36/5.39	Conditions: 1 <= a_13^0, 
5.36/5.39	OPEN EXITS: 
5.36/5.39	<l0, l2, 1 <= a_13^0, {all remain the same}>
5.36/5.39	
5.36/5.39	> Conditions are reachable!
5.36/5.39	
5.36/5.39	Program does NOT terminate
5.36/5.39	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
5.36/5.39	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
5.36/5.39	EOF