5.12/5.14	NO
5.12/5.14	
5.12/5.14	Solver Timeout: 4
5.12/5.14	Global Timeout: 300
5.12/5.14	No parsing errors!
5.12/5.14	Init Location: 0
5.12/5.14	Transitions:
5.12/5.14	<l0, l6, true>
5.12/5.14	<l1, l2, (0 <= (0 + b^0)), par{b^0 -> 1}>
5.12/5.14	<l2, l3, ((1 + b^0) <= 0)>
5.12/5.14	<l2, l3, (1 <= (0 + b^0))>
5.12/5.14	<l3, l4, true, par{b^0 -> 0}>
5.12/5.14	<l4, l1, true>
5.12/5.14	<l5, l1, true>
5.12/5.14	<l6, l5, true>
5.12/5.14	
5.12/5.14	Fresh variables:
5.12/5.14	
5.12/5.14	Undef variables:
5.12/5.14	
5.12/5.14	Abstraction variables:
5.12/5.14	
5.12/5.14	Exit nodes:
5.12/5.14	
5.12/5.14	Accepting locations:
5.12/5.14	
5.12/5.14	Asserts:
5.12/5.14	
5.12/5.14	Preprocessed LLVMGraph
5.12/5.14	Init Location: 0
5.12/5.14	Transitions:
5.12/5.14	<l0, l1, true>
5.12/5.14	<l1, l1, (0 <= (0 + b^0)) /\ (1 <= (0 + 1)), par{b^0 -> 0}>
5.12/5.14	
5.12/5.14	Fresh variables:
5.12/5.14	
5.12/5.14	Undef variables:
5.12/5.14	
5.12/5.14	Abstraction variables:
5.12/5.14	
5.12/5.14	Exit nodes:
5.12/5.14	
5.12/5.14	Accepting locations:
5.12/5.14	
5.12/5.14	Asserts:
5.12/5.14	
5.12/5.14	*************************************************************
5.12/5.14	*******************************************************************************************
5.12/5.14	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
5.12/5.14	*******************************************************************************************
5.12/5.14	
5.12/5.14	Init Location: 0
5.12/5.14	Graph 0:
5.12/5.14	Transitions:
5.12/5.14	Variables:
5.12/5.14	
5.12/5.14	Graph 1:
5.12/5.14	Transitions:
5.12/5.14	<l1, l1, 0 <= b^0, {b^0 -> 0, rest remain the same}>
5.12/5.14	Variables:
5.12/5.14	b^0
5.12/5.14	
5.12/5.14	Precedence: 
5.12/5.14	Graph 0
5.12/5.14	
5.12/5.14	Graph 1
5.12/5.14	<l0, l1, true, {all remain the same}>
5.12/5.14	
5.12/5.14	Map Locations to Subgraph:
5.12/5.14	( 0 , 0 )
5.12/5.14	( 1 , 1 )
5.12/5.14	
5.12/5.14	*******************************************************************************************
5.12/5.14	********************************    CHECKING ASSERTIONS    ********************************
5.12/5.14	*******************************************************************************************
5.12/5.14	
5.12/5.14	Proving termination of subgraph 0
5.12/5.14	Proving termination of subgraph 1
5.12/5.14	Checking unfeasibility...
5.12/5.14	Time used: 0.001744
5.12/5.14	
5.12/5.14	Checking conditional termination of SCC {l1}...
5.12/5.14	
5.12/5.14	LOG: CALL solveLinear
5.12/5.14	
5.12/5.14	LOG: RETURN solveLinear - Elapsed time: 0.000641s
5.12/5.14	
5.12/5.14	LOG: CALL solveLinear
5.12/5.14	
5.12/5.14	LOG: RETURN solveLinear - Elapsed time: 0.001189s
5.12/5.14	Trying to remove transition: <l1, l1, 0 <= b^0, {b^0 -> 0, rest remain the same}>
5.12/5.14	Solving with 1 template(s).
5.12/5.14	
5.12/5.14	LOG: CALL solveNonLinearGetFirstSolution
5.12/5.14	
5.12/5.14	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003184s
5.12/5.14	Time used: 0.003068
5.12/5.14	Solving with 1 template(s).
5.12/5.14	
5.12/5.14	LOG: CALL solveNonLinearGetFirstSolution
5.12/5.14	
5.12/5.14	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004176s
5.12/5.14	Time used: 0.003944
5.12/5.14	Improving Solution with cost 1 ...
5.12/5.14	
5.12/5.14	LOG: CALL solveNonLinearGetNextSolution
5.12/5.14	
5.12/5.14	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.009743s
5.12/5.14	Time used: 0.009738
5.12/5.14	
5.12/5.14	LOG: SAT solveNonLinear - Elapsed time: 0.013919s
5.12/5.14	Cost: 1; Total time: 0.013682
5.12/5.14	Failed at location 1: 1 + b^0 <= 0
5.12/5.14	Before Improving: 
5.12/5.14	Quasi-invariant at l1: 1 + b^0 <= 0
5.12/5.14	Optimizing invariants...
5.12/5.14	
5.12/5.14	LOG: CALL solveLinear
5.12/5.14	
5.12/5.14	LOG: RETURN solveLinear - Elapsed time: 0.001612s
5.12/5.14	Remaining time after improvement: 0.999089
5.12/5.14	Termination implied by a set of quasi-invariant(s):
5.12/5.14	Quasi-invariant at l1: 1 + b^0 <= 0
5.12/5.14	[ Invariant Graph ]
5.12/5.14	Strengthening and disabling transitions...
5.12/5.14	
5.12/5.14	LOG: CALL solverLinear in Graph for feasibility
5.12/5.14	
5.12/5.14	LOG: RETURN solveLinear in Graph for feasibility
5.12/5.14	It's unfeasible. Removing transition: 
5.12/5.14	<l1, l1, 0 <= b^0, {b^0 -> 0, rest remain the same}>
5.12/5.14	[ Termination Graph ]
5.12/5.14	Strengthening and disabling transitions...
5.12/5.14	> It's unfeasible. Removing transition: 
5.12/5.14	<l1, l1, 0 <= b^0, {b^0 -> 0, rest remain the same}>
5.12/5.14	New Graphs: 
5.12/5.14	Calling Safety with literal 1 + b^0 <= 0 and entry <l0, l1, true, {all remain the same}>
5.12/5.14	
5.12/5.14	LOG: CALL check - Post:1 + b^0 <= 0 - Process 1
5.12/5.14	* Exit transition: <l0, l1, true, {all remain the same}>
5.12/5.14	* Postcondition  : 1 + b^0 <= 0
5.12/5.14	
5.12/5.14	LOG: CALL solveLinear
5.12/5.14	
5.12/5.14	LOG: RETURN solveLinear - Elapsed time: 0.000263s
5.12/5.14	> Postcondition is not implied!
5.12/5.14	
5.12/5.14	LOG: RETURN check - Elapsed time: 0.000325s
5.12/5.14	INVARIANTS: 
5.12/5.14	1: 
5.12/5.14	Quasi-INVARIANTS to narrow Graph: 
5.12/5.14	1: 1 + b^0 <= 0 , 
5.12/5.14	Narrowing transition: 
5.12/5.14	<l1, l1, 0 <= b^0, {b^0 -> 0, rest remain the same}>
5.12/5.14	
5.12/5.14	LOG: Narrow transition size 1
5.12/5.14	invGraph after Narrowing: 
5.12/5.14	Transitions:
5.12/5.14	<l1, l1, 0 <= b^0, {b^0 -> 0, rest remain the same}>
5.12/5.14	Variables:
5.12/5.14	b^0
5.12/5.14	Checking conditional termination of SCC {l1}...
5.12/5.14	
5.12/5.14	LOG: CALL solveLinear
5.12/5.14	
5.12/5.14	LOG: RETURN solveLinear - Elapsed time: 0.000588s
5.12/5.14	
5.12/5.14	LOG: CALL solveLinear
5.12/5.14	
5.12/5.14	LOG: RETURN solveLinear - Elapsed time: 0.001168s
5.12/5.14	Trying to remove transition: <l1, l1, 0 <= b^0, {b^0 -> 0, rest remain the same}>
5.12/5.14	Solving with 1 template(s).
5.12/5.14	
5.12/5.14	LOG: CALL solveNonLinearGetFirstSolution
5.12/5.14	
5.12/5.14	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.002832s
5.12/5.14	Time used: 0.002715
5.12/5.14	Solving with 1 template(s).
5.12/5.14	
5.12/5.14	LOG: CALL solveNonLinearGetFirstSolution
5.12/5.14	
5.12/5.14	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003716s
5.12/5.14	Time used: 0.003496
5.12/5.14	Solving with 2 template(s).
5.12/5.14	
5.12/5.14	LOG: CALL solveNonLinearGetFirstSolution
5.12/5.14	
5.12/5.14	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001213s
5.12/5.14	Time used: 4.0006
5.12/5.14	Solving with 3 template(s).
5.12/5.14	
5.12/5.14	LOG: CALL solveNonLinearGetFirstSolution
5.12/5.14	
5.12/5.14	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.038557s
5.12/5.14	Time used: 1.00046
5.12/5.14	Solving with 1 template(s).
5.12/5.14	
5.12/5.14	LOG: CALL solveNonLinearGetFirstSolution
5.12/5.14	
5.12/5.14	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005933s
5.12/5.14	Time used: 0.003006
5.12/5.14	
5.12/5.14	Proving non-termination of subgraph 1
5.12/5.14	Transitions:
5.12/5.14	<l1, l1, 0 <= b^0, {b^0 -> 0, rest remain the same}>
5.12/5.14	Variables:
5.12/5.14	b^0
5.12/5.14	
5.12/5.14	Checking conditional non-termination of SCC {l1}...
5.12/5.14	EXIT TRANSITIONS:
5.12/5.14	<l1, end, 1 + b^0 <= 0, {all remain the same}>
5.12/5.14	
5.12/5.14	Solving with 1 template(s).
5.12/5.14	
5.12/5.14	LOG: CALL solveNonLinearGetFirstSolution
5.12/5.14	
5.12/5.14	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003149s
5.12/5.14	Time used: 0.003005
5.12/5.14	Improving Solution with cost 1 ...
5.12/5.14	
5.12/5.14	LOG: CALL solveNonLinearGetNextSolution
5.12/5.14	
5.12/5.14	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.003899s
5.12/5.14	Time used: 0.003895
5.12/5.14	
5.12/5.14	LOG: SAT solveNonLinear - Elapsed time: 0.007048s
5.12/5.14	Cost: 1; Total time: 0.0069
5.12/5.14	Failed at location 1: 0 <= b^0
5.12/5.14	Before Improving: 
5.12/5.14	Quasi-invariant at l1: 0 <= b^0
5.12/5.14	Optimizing invariants...
5.12/5.14	
5.12/5.14	LOG: CALL solveLinear
5.12/5.14	
5.12/5.14	LOG: RETURN solveLinear - Elapsed time: 0.001283s
5.12/5.14	Remaining time after improvement: 0.99926
5.12/5.14	Non-termination implied by a set of quasi-invariant(s):
5.12/5.14	Quasi-invariant at l1: 0 <= b^0
5.12/5.14	
5.12/5.14	Strengthening and disabling EXIT transitions...
5.12/5.14	Closed exits from l1: 1
5.12/5.14	
5.12/5.14	Strengthening and disabling transitions...
5.12/5.14	
5.12/5.14	LOG: CALL solverLinear in Graph for feasibility
5.12/5.14	
5.12/5.14	LOG: RETURN solveLinear in Graph for feasibility
5.12/5.14	Strengthening transition (result): 
5.12/5.14	<l1, l1, 0 <= b^0, {b^0 -> 0, rest remain the same}>
5.12/5.14	
5.12/5.14	Calling reachability with...
5.12/5.14	Transition: <l1, end, true, {all remain the same}>
5.12/5.14	Conditions: 0 <= b^0, 
5.12/5.14	OPEN EXITS: 
5.12/5.14	<l1, end, 0 <= b^0, {all remain the same}>
5.12/5.14	
5.12/5.14	--- Reachability graph ---
5.12/5.14	> Graph without transitions.
5.12/5.14	
5.12/5.14	Calling reachability with...
5.12/5.14	Transition: <l0, l1, true, {all remain the same}>
5.12/5.14	Conditions: 0 <= b^0, 
5.12/5.14	OPEN EXITS: 
5.12/5.14	<l0, l1, 0 <= b^0, {all remain the same}>
5.12/5.14	
5.12/5.14	> Conditions are reachable!
5.12/5.14	
5.12/5.14	Program does NOT terminate
5.12/5.14	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
5.12/5.14	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
5.12/5.14	EOF