3.33/3.36	NO
3.33/3.36	
3.33/3.36	Solver Timeout: 4
3.33/3.36	Global Timeout: 300
3.33/3.36	No parsing errors!
3.33/3.36	Init Location: 0
3.33/3.36	Transitions:
3.33/3.36	<l0, l11, true>
3.33/3.36	<l1, l2, true>
3.33/3.36	<l2, l1, true>
3.33/3.36	<l3, l4, true>
3.33/3.36	<l5, l3, (1 <= (0 + pIrb^0)) /\ (undef35 = undef35), par{ntStatus^0 -> undef35}>
3.33/3.36	<l5, l3, ((0 + pIrb^0) <= 0)>
3.33/3.36	<l6, l5, (undef54 = undef54), par{pIrb^0 -> undef54}>
3.33/3.36	<l7, l6, ((1 + ResourceIrp^0) <= 0)>
3.33/3.36	<l7, l6, (1 <= (0 + ResourceIrp^0))>
3.33/3.36	<l7, l3, ((0 + ResourceIrp^0) <= 0) /\ (0 <= (0 + ResourceIrp^0))>
3.33/3.36	<l8, l3, ((0 + IsochResourceData^0) <= 0)>
3.33/3.36	<l8, l7, (1 <= (0 + IsochResourceData^0)) /\ (undef100 = undef100) /\ (undef93 = undef93) /\ (undef94 = undef94), par{ResourceIrp^0 -> (0 + undef94), StackSize^0 -> undef93, ___rho_99_^0 -> undef94}>
3.33/3.36	<l9, l1, ((0 + k4^0) <= 0) /\ (undef110 = 1), par{keR^0 -> 0}>
3.33/3.36	<l9, l8, (1 <= (0 + k4^0)) /\ (undef120 = 1), par{k4^0 -> (~(1) + k4^0), keR^0 -> 0}>
3.33/3.36	<l4, l9, (undef130 = 1), par{keA^0 -> 0}>
3.33/3.36	<l10, l4, true, par{keA^0 -> 0, keR^0 -> 0}>
3.33/3.36	<l11, l10, true>
3.33/3.36	
3.33/3.36	Fresh variables:
3.33/3.36	undef35, undef54, undef93, undef94, undef100, undef110, undef120, undef130, 
3.33/3.36	
3.33/3.36	Undef variables:
3.33/3.36	undef35, undef54, undef93, undef94, undef100, undef110, undef120, undef130, 
3.33/3.36	
3.33/3.36	Abstraction variables:
3.33/3.36	
3.33/3.36	Exit nodes:
3.33/3.36	
3.33/3.36	Accepting locations:
3.33/3.36	
3.33/3.36	Asserts:
3.33/3.36	
3.33/3.36	Preprocessed LLVMGraph
3.33/3.36	Init Location: 0
3.33/3.36	Transitions:
3.33/3.36	<l0, l4, true>
3.33/3.36	<l1, l1, true>
3.33/3.36	<l4, l1, (undef130 = 1) /\ ((0 + k4^0) <= 0) /\ (undef110 = 1)>
3.33/3.36	<l4, l4, (undef130 = 1) /\ (1 <= (0 + k4^0)) /\ (undef120 = 1) /\ ((0 + IsochResourceData^0) <= 0), par{k4^0 -> (~(1) + k4^0)}>
3.33/3.36	<l4, l4, (undef130 = 1) /\ (1 <= (0 + k4^0)) /\ (undef120 = 1) /\ (1 <= (0 + IsochResourceData^0)) /\ (undef100 = undef100) /\ (undef93 = undef93) /\ (undef94 = undef94) /\ ((1 + (0 + undef94)) <= 0) /\ (undef54 = undef54) /\ (1 <= (0 + undef54)) /\ (undef35 = undef35), par{k4^0 -> (~(1) + k4^0)}>
3.33/3.36	<l4, l4, (undef130 = 1) /\ (1 <= (0 + k4^0)) /\ (undef120 = 1) /\ (1 <= (0 + IsochResourceData^0)) /\ (undef100 = undef100) /\ (undef93 = undef93) /\ (undef94 = undef94) /\ ((1 + (0 + undef94)) <= 0) /\ (undef54 = undef54) /\ ((0 + undef54) <= 0), par{k4^0 -> (~(1) + k4^0)}>
3.33/3.36	<l4, l4, (undef130 = 1) /\ (1 <= (0 + k4^0)) /\ (undef120 = 1) /\ (1 <= (0 + IsochResourceData^0)) /\ (undef100 = undef100) /\ (undef93 = undef93) /\ (undef94 = undef94) /\ (1 <= (0 + (0 + undef94))) /\ (undef54 = undef54) /\ (1 <= (0 + undef54)) /\ (undef35 = undef35), par{k4^0 -> (~(1) + k4^0)}>
3.33/3.36	<l4, l4, (undef130 = 1) /\ (1 <= (0 + k4^0)) /\ (undef120 = 1) /\ (1 <= (0 + IsochResourceData^0)) /\ (undef100 = undef100) /\ (undef93 = undef93) /\ (undef94 = undef94) /\ (1 <= (0 + (0 + undef94))) /\ (undef54 = undef54) /\ ((0 + undef54) <= 0), par{k4^0 -> (~(1) + k4^0)}>
3.33/3.36	<l4, l4, (undef130 = 1) /\ (1 <= (0 + k4^0)) /\ (undef120 = 1) /\ (1 <= (0 + IsochResourceData^0)) /\ (undef100 = undef100) /\ (undef93 = undef93) /\ (undef94 = undef94) /\ ((0 + (0 + undef94)) <= 0) /\ (0 <= (0 + (0 + undef94))), par{k4^0 -> (~(1) + k4^0)}>
3.33/3.36	
3.33/3.36	Fresh variables:
3.33/3.36	undef35, undef54, undef93, undef94, undef100, undef110, undef120, undef130, 
3.33/3.36	
3.33/3.36	Undef variables:
3.33/3.36	undef35, undef54, undef93, undef94, undef100, undef110, undef120, undef130, 
3.33/3.36	
3.33/3.36	Abstraction variables:
3.33/3.36	
3.33/3.36	Exit nodes:
3.33/3.36	
3.33/3.36	Accepting locations:
3.33/3.36	
3.33/3.36	Asserts:
3.33/3.36	
3.33/3.36	*************************************************************
3.33/3.36	*******************************************************************************************
3.33/3.36	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
3.33/3.36	*******************************************************************************************
3.33/3.36	
3.33/3.36	Init Location: 0
3.33/3.36	Graph 0:
3.33/3.36	Transitions:
3.33/3.36	Variables:
3.33/3.36	
3.33/3.36	Graph 1:
3.33/3.36	Transitions:
3.33/3.36	<l4, l4, 1 <= k4^0 /\ IsochResourceData^0 <= 0 /\ undef120 = 1 /\ undef130 = 1, {k4^0 -> -1 + k4^0, rest remain the same}>
3.33/3.36	<l4, l4, 1 <= IsochResourceData^0 /\ 1 <= k4^0 /\ 1 <= undef54 /\ 1 + undef94 <= 0 /\ undef120 = 1 /\ undef130 = 1, {k4^0 -> -1 + k4^0, rest remain the same}>
3.33/3.36	<l4, l4, 1 <= IsochResourceData^0 /\ 1 <= k4^0 /\ 1 + undef94 <= 0 /\ undef54 <= 0 /\ undef120 = 1 /\ undef130 = 1, {k4^0 -> -1 + k4^0, rest remain the same}>
3.33/3.36	<l4, l4, 1 <= IsochResourceData^0 /\ 1 <= k4^0 /\ 1 <= undef54 /\ 1 <= undef94 /\ undef120 = 1 /\ undef130 = 1, {k4^0 -> -1 + k4^0, rest remain the same}>
3.33/3.36	<l4, l4, 1 <= IsochResourceData^0 /\ 1 <= k4^0 /\ 1 <= undef94 /\ undef54 <= 0 /\ undef120 = 1 /\ undef130 = 1, {k4^0 -> -1 + k4^0, rest remain the same}>
3.33/3.36	<l4, l4, 1 <= IsochResourceData^0 /\ 1 <= k4^0 /\ undef94 = 0 /\ undef120 = 1 /\ undef130 = 1, {k4^0 -> -1 + k4^0, rest remain the same}>
3.33/3.36	Variables:
3.33/3.36	IsochResourceData^0, k4^0
3.33/3.36	
3.33/3.36	Graph 2:
3.33/3.36	Transitions:
3.33/3.36	<l1, l1, true, {all remain the same}>
3.33/3.36	Variables:
3.33/3.36	
3.33/3.36	Precedence: 
3.33/3.36	Graph 0
3.33/3.36	
3.33/3.36	Graph 1
3.33/3.36	<l0, l4, true, {all remain the same}>
3.33/3.36	
3.33/3.36	Graph 2
3.33/3.36	<l4, l1, k4^0 <= 0 /\ undef110 = 1 /\ undef130 = 1, {all remain the same}>
3.33/3.36	
3.33/3.36	Map Locations to Subgraph:
3.33/3.36	( 0 , 0 )
3.33/3.36	( 1 , 2 )
3.33/3.36	( 4 , 1 )
3.33/3.36	
3.33/3.36	*******************************************************************************************
3.33/3.36	********************************    CHECKING ASSERTIONS    ********************************
3.33/3.36	*******************************************************************************************
3.33/3.36	
3.33/3.36	Proving termination of subgraph 0
3.33/3.36	Proving termination of subgraph 1
3.33/3.36	Checking unfeasibility...
3.33/3.36	Time used: 0.0135
3.33/3.36	
3.33/3.36	Checking conditional termination of SCC {l4}...
3.33/3.36	
3.33/3.36	LOG: CALL solveLinear
3.33/3.36	
3.33/3.36	LOG: RETURN solveLinear - Elapsed time: 0.004659s
3.33/3.36	Ranking function: -2 + IsochResourceData^0 + k4^0
3.33/3.36	New Graphs: 
3.33/3.36	Transitions:
3.33/3.36	<l4, l4, 1 <= k4^0 /\ IsochResourceData^0 <= 0 /\ undef120 = 1 /\ undef130 = 1, {k4^0 -> -1 + k4^0, rest remain the same}>
3.33/3.36	Variables:
3.33/3.36	IsochResourceData^0, k4^0
3.33/3.36	Checking conditional termination of SCC {l4}...
3.33/3.36	
3.33/3.36	LOG: CALL solveLinear
3.33/3.36	
3.33/3.36	LOG: RETURN solveLinear - Elapsed time: 0.000846s
3.33/3.36	Ranking function: -1 + k4^0
3.33/3.36	New Graphs: 
3.33/3.36	Proving termination of subgraph 2
3.33/3.36	Checking unfeasibility...
3.33/3.36	Time used: 0.000844
3.33/3.36	
3.33/3.36	> No variable changes in termination graph.
3.33/3.36	Checking conditional unfeasibility...
3.33/3.36	Termination failed. Trying to show unreachability...
3.33/3.36	Proving unreachability of entry: <l4, l1, k4^0 <= 0 /\ undef110 = 1 /\ undef130 = 1, {all remain the same}>
3.33/3.36	
3.33/3.36	LOG: CALL check - Post:1 <= 0 - Process 1
3.33/3.36	* Exit transition: <l4, l1, k4^0 <= 0 /\ undef110 = 1 /\ undef130 = 1, {all remain the same}>
3.33/3.36	* Postcondition  : 1 <= 0
3.33/3.36	Postcodition moved up: 1 <= 0
3.33/3.36	
3.33/3.36	LOG: Try proving POST
3.33/3.36	Postcondition: 1 <= 0
3.33/3.36	
3.33/3.36	LOG: CALL check - Post:1 <= 0 - Process 2
3.33/3.36	* Exit transition: <l0, l4, undef110 = 1 /\ undef130 = 1, {all remain the same}>
3.33/3.36	* Postcondition  : 1 <= 0
3.33/3.36	
3.33/3.36	LOG: CALL solveLinear
3.33/3.36	
3.33/3.36	LOG: RETURN solveLinear - Elapsed time: 0.000440s
3.33/3.36	> Postcondition is not implied!
3.33/3.36	
3.33/3.36	LOG: RETURN check - Elapsed time: 0.000513s
3.33/3.36	
3.33/3.36	LOG: NarrowEntry size 1
3.33/3.36	Narrowing transition: 
3.33/3.36	<l4, l4, 1 <= k4^0 /\ IsochResourceData^0 <= 0 /\ undef120 = 1 /\ undef130 = 1, {k4^0 -> -1 + k4^0, rest remain the same}>
3.33/3.36	
3.33/3.36	LOG: Narrow transition size 1
3.33/3.36	Narrowing transition: 
3.33/3.36	<l4, l4, 1 <= IsochResourceData^0 /\ 1 <= k4^0 /\ 1 <= undef54 /\ 1 + undef94 <= 0 /\ undef120 = 1 /\ undef130 = 1, {k4^0 -> -1 + k4^0, rest remain the same}>
3.33/3.36	
3.33/3.36	LOG: Narrow transition size 1
3.33/3.36	Narrowing transition: 
3.33/3.36	<l4, l4, 1 <= IsochResourceData^0 /\ 1 <= k4^0 /\ 1 + undef94 <= 0 /\ undef54 <= 0 /\ undef120 = 1 /\ undef130 = 1, {k4^0 -> -1 + k4^0, rest remain the same}>
3.33/3.36	
3.33/3.36	LOG: Narrow transition size 1
3.33/3.36	Narrowing transition: 
3.33/3.36	<l4, l4, 1 <= IsochResourceData^0 /\ 1 <= k4^0 /\ 1 <= undef54 /\ 1 <= undef94 /\ undef120 = 1 /\ undef130 = 1, {k4^0 -> -1 + k4^0, rest remain the same}>
3.33/3.36	
3.33/3.36	LOG: Narrow transition size 1
3.33/3.36	Narrowing transition: 
3.33/3.36	<l4, l4, 1 <= IsochResourceData^0 /\ 1 <= k4^0 /\ 1 <= undef94 /\ undef54 <= 0 /\ undef120 = 1 /\ undef130 = 1, {k4^0 -> -1 + k4^0, rest remain the same}>
3.33/3.36	
3.33/3.36	LOG: Narrow transition size 1
3.33/3.36	Narrowing transition: 
3.33/3.36	<l4, l4, 1 <= IsochResourceData^0 /\ 1 <= k4^0 /\ undef94 = 0 /\ undef120 = 1 /\ undef130 = 1, {k4^0 -> -1 + k4^0, rest remain the same}>
3.33/3.36	
3.33/3.36	LOG: Narrow transition size 1
3.33/3.36	ENTRIES:
3.33/3.36	<l0, l4, 0 <= 0 /\ undef110 = 1 /\ undef130 = 1, {all remain the same}>
3.33/3.36	END ENTRIES:
3.33/3.36	GRAPH:
3.33/3.36	<l4, l4, 1 <= k4^0 /\ 0 <= 0 /\ IsochResourceData^0 <= 0 /\ undef110 = 1 /\ undef120 = 1 /\ undef130 = 1, {k4^0 -> -1 + k4^0, rest remain the same}>
3.33/3.36	<l4, l4, 1 <= IsochResourceData^0 /\ 1 <= k4^0 /\ 1 <= undef54 /\ 1 + undef94 <= 0 /\ 0 <= 0 /\ undef110 = 1 /\ undef120 = 1 /\ undef130 = 1, {k4^0 -> -1 + k4^0, rest remain the same}>
3.33/3.36	<l4, l4, 1 <= IsochResourceData^0 /\ 1 <= k4^0 /\ 1 + undef94 <= 0 /\ 0 <= 0 /\ undef54 <= 0 /\ undef110 = 1 /\ undef120 = 1 /\ undef130 = 1, {k4^0 -> -1 + k4^0, rest remain the same}>
3.33/3.36	<l4, l4, 1 <= IsochResourceData^0 /\ 1 <= k4^0 /\ 1 <= undef54 /\ 1 <= undef94 /\ 0 <= 0 /\ undef110 = 1 /\ undef120 = 1 /\ undef130 = 1, {k4^0 -> -1 + k4^0, rest remain the same}>
3.33/3.36	<l4, l4, 1 <= IsochResourceData^0 /\ 1 <= k4^0 /\ 1 <= undef94 /\ 0 <= 0 /\ undef54 <= 0 /\ undef110 = 1 /\ undef120 = 1 /\ undef130 = 1, {k4^0 -> -1 + k4^0, rest remain the same}>
3.33/3.36	<l4, l4, 1 <= IsochResourceData^0 /\ 1 <= k4^0 /\ 0 <= 0 /\ undef94 = 0 /\ undef110 = 1 /\ undef120 = 1 /\ undef130 = 1, {k4^0 -> -1 + k4^0, rest remain the same}>
3.33/3.36	END GRAPH:
3.33/3.36	EXIT: <l4, l1, k4^0 <= 0 /\ undef110 = 1 /\ undef130 = 1, {all remain the same}>
3.33/3.36	POST: 1 <= 0
3.33/3.36	
3.33/3.36	
3.33/3.36	LOG: Try proving POST
3.33/3.36	Solving with 1 template(s).
3.33/3.36	
3.33/3.36	LOG: CALL solveNonLinearGetFirstSolution
3.33/3.36	
3.33/3.36	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.028423s
3.33/3.36	Time used: 0.02811
3.33/3.36	Improving Solution with cost 51 ...
3.33/3.36	
3.33/3.36	LOG: CALL solveNonLinearGetNextSolution
3.33/3.36	
3.33/3.36	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000884s
3.33/3.36	Time used: 1.00087
3.33/3.36	
3.33/3.36	LOG: SAT solveNonLinear - Elapsed time: 1.029307s
3.33/3.36	Cost: 51; Total time: 1.02898
3.33/3.36	Failed at location 4: 1 + IsochResourceData^0 <= 0
3.33/3.36	Before Improving: 
3.33/3.36	Quasi-invariant at l4: 1 + IsochResourceData^0 <= 0
3.33/3.36	Optimizing invariants...
3.33/3.36	
3.33/3.36	LOG: CALL solveLinear
3.33/3.36	
3.33/3.36	LOG: RETURN solveLinear - Elapsed time: 0.009989s
3.33/3.36	Remaining time after improvement: 0.996879
3.33/3.36	Some transition disabled by a set of quasi-invariant(s):
3.33/3.36	Quasi-invariant at l4: 1 + IsochResourceData^0 <= 0
3.33/3.36	
3.33/3.36	LOG: NEXT CALL check - disable
3.33/3.36	
3.33/3.36	LOG: CALL check - Post:1 + IsochResourceData^0 <= 0 - Process 3
3.33/3.36	* Exit transition: <l0, l4, 0 <= 0 /\ undef110 = 1 /\ undef130 = 1, {all remain the same}>
3.33/3.36	* Postcondition  : 1 + IsochResourceData^0 <= 0
3.33/3.36	
3.33/3.36	LOG: CALL solveLinear
3.33/3.36	
3.33/3.36	LOG: RETURN solveLinear - Elapsed time: 0.000934s
3.33/3.36	> Postcondition is not implied!
3.33/3.36	
3.33/3.36	LOG: RETURN check - Elapsed time: 0.001020s
3.33/3.36	Solving with 2 template(s).
3.33/3.36	
3.33/3.36	LOG: CALL solveNonLinearGetFirstSolution
3.33/3.36	
3.33/3.36	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.117003s
3.33/3.36	Time used: 0.116468
3.33/3.36	Improving Solution with cost 51 ...
3.33/3.36	
3.33/3.36	LOG: CALL solveNonLinearGetNextSolution
3.33/3.36	
3.33/3.36	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001483s
3.33/3.36	Time used: 1.00148
3.33/3.36	
3.33/3.36	LOG: SAT solveNonLinear - Elapsed time: 1.118486s
3.33/3.36	Cost: 51; Total time: 1.11794
3.33/3.36	Failed at location 4: k4^0 <= IsochResourceData^0
3.33/3.36	Before Improving: 
3.33/3.36	Quasi-invariant at l4: k4^0 <= IsochResourceData^0
3.33/3.36	Optimizing invariants...
3.33/3.36	
3.33/3.36	LOG: CALL solveLinear
3.33/3.36	
3.33/3.36	LOG: RETURN solveLinear - Elapsed time: 0.060872s
3.33/3.36	Remaining time after improvement: 0.9946
3.33/3.36	Some transition disabled by a set of quasi-invariant(s):
3.33/3.36	Quasi-invariant at l4: k4^0 <= IsochResourceData^0
3.33/3.36	
3.33/3.36	LOG: NEXT CALL check - disable
3.33/3.36	
3.33/3.36	LOG: CALL check - Post:k4^0 <= IsochResourceData^0 - Process 4
3.33/3.36	* Exit transition: <l0, l4, 0 <= 0 /\ undef110 = 1 /\ undef130 = 1, {all remain the same}>
3.33/3.36	* Postcondition  : k4^0 <= IsochResourceData^0
3.33/3.36	
3.33/3.36	LOG: CALL solveLinear
3.33/3.36	
3.33/3.36	LOG: RETURN solveLinear - Elapsed time: 0.001552s
3.33/3.36	> Postcondition is not implied!
3.33/3.36	
3.33/3.36	LOG: RETURN check - Elapsed time: 0.001651s
3.33/3.36	Solving with 3 template(s).
3.33/3.36	
3.33/3.36	LOG: CALL solveNonLinearGetFirstSolution
3.33/3.36	
3.33/3.36	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.817803s
3.33/3.36	Time used: 0.817101
3.33/3.36	Improving Solution with cost 51 ...
3.33/3.36	
3.33/3.36	LOG: CALL solveNonLinearGetNextSolution
3.33/3.36	
3.33/3.36	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.183768s
3.33/3.36	Time used: 0.183749
3.33/3.36	
3.33/3.36	LOG: SAT solveNonLinear - Elapsed time: 1.001571s
3.33/3.36	Cost: 51; Total time: 1.00085
3.33/3.36	Failed at location 4: IsochResourceData^0 <= 0
3.33/3.36	Before Improving: 
3.33/3.36	Quasi-invariant at l4: IsochResourceData^0 <= 0
3.33/3.36	Optimizing invariants...
3.33/3.36	
3.33/3.36	LOG: CALL solveLinear
3.33/3.36	
3.33/3.36	LOG: RETURN solveLinear - Elapsed time: 0.010812s
3.33/3.36	Remaining time after improvement: 0.993646
3.33/3.36	Some transition disabled by a set of quasi-invariant(s):
3.33/3.36	Quasi-invariant at l4: IsochResourceData^0 <= 0
3.33/3.36	
3.33/3.36	LOG: NEXT CALL check - disable
3.33/3.36	
3.33/3.36	LOG: CALL check - Post:IsochResourceData^0 <= 0 - Process 5
3.33/3.36	* Exit transition: <l0, l4, 0 <= 0 /\ undef110 = 1 /\ undef130 = 1, {all remain the same}>
3.33/3.36	* Postcondition  : IsochResourceData^0 <= 0
3.33/3.36	
3.33/3.36	LOG: CALL solveLinear
3.33/3.36	
3.33/3.36	LOG: RETURN solveLinear - Elapsed time: 0.001708s
3.33/3.36	> Postcondition is not implied!
3.33/3.36	
3.33/3.36	LOG: RETURN check - Elapsed time: 0.001795s
3.33/3.36	
3.33/3.36	LOG: Postcondition is not implied - no solution
3.33/3.36	> Postcondition is not implied!
3.33/3.36	
3.33/3.36	LOG: RETURN check - Elapsed time: 3.262961s
3.33/3.36	Cannot prove unreachability
3.33/3.36	
3.33/3.36	Proving non-termination of subgraph 2
3.33/3.36	Transitions:
3.33/3.36	<l1, l1, true, {all remain the same}>
3.33/3.36	Variables:
3.33/3.36	
3.33/3.36	Checking conditional non-termination of SCC {l1}...
3.33/3.36	> No exit transition to close.
3.33/3.36	Calling reachability with...
3.33/3.36	Transition: <l1, end, true, {all remain the same}>
3.33/3.36	Conditions: 
3.33/3.36	OPEN EXITS: 
3.33/3.36	<l1, end, true, {all remain the same}>
3.33/3.36	
3.33/3.36	--- Reachability graph ---
3.33/3.36	> Graph without transitions.
3.33/3.36	
3.33/3.36	Calling reachability with...
3.33/3.36	Transition: <l4, l1, k4^0 <= 0 /\ undef110 = 1 /\ undef130 = 1, {all remain the same}>
3.33/3.37	Conditions: 
3.33/3.37	OPEN EXITS: 
3.33/3.37	<l4, l1, k4^0 <= 0, {all remain the same}> (condsUp: undef110 = 1, undef130 = 1)
3.33/3.37	
3.33/3.37	--- Reachability graph ---
3.33/3.37	> Graph without transitions.
3.33/3.37	
3.33/3.37	Calling reachability with...
3.33/3.37	Transition: <l0, l4, true, {all remain the same}>
3.33/3.37	Conditions: k4^0 <= 0, undef110 = 1, undef130 = 1, 
3.33/3.37	OPEN EXITS: 
3.33/3.37	<l0, l4, k4^0 <= 0 /\ undef110 = 1 /\ undef130 = 1, {all remain the same}>
3.33/3.37	
3.33/3.37	> Conditions are reachable!
3.33/3.37	
3.33/3.37	Program does NOT terminate
3.33/3.37	/export/starexec/sandbox2/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
3.33/3.37	/export/starexec/sandbox2/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
3.33/3.37	EOF