/export/starexec/sandbox2/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox2/benchmark/theBenchmark.smt2 /export/starexec/sandbox2/output/output_files


--------------------------------------------------------------------------------


NO

Solver Timeout: 4
Global Timeout: 300
Maximum number of concurrent processes: 900
No parsing errors!
Init Location: 0
Transitions:
<l0, l5, true>
<l1, l2, (undef1 <= arg1) /\ (arg1 > ~(1)) /\ (undef1 > ~(1)), par{arg1 -> undef1, arg2 -> undef2}>
<l3, l2, (arg1 > 0) /\ (undef3 > ~(1)), par{arg1 -> undef3, arg2 -> undef4}>
<l2, l2, (undef5 <= arg1) /\ (undef7 > 0) /\ (arg1 > 0) /\ (undef5 > 0), par{arg1 -> undef5, arg2 -> undef6}>
<l3, l4, (arg2 > ~(1)) /\ (undef8 > ~(1)) /\ (arg1 > 0), par{arg1 -> undef8, arg2 -> 1}>
<l4, l4, (arg1 > 0) /\ (arg2 > 0), par{arg1 -> (arg1 - 1), arg2 -> (arg2 + 1)}>
<l5, l3, true, par{arg1 -> undef12, arg2 -> undef13}>

Fresh variables:
undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef12, undef13, 

Undef variables:
undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef12, undef13, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (undef12 > 0) /\ (undef3 > ~(1)), par{arg1 -> undef3, arg2 -> undef4}>
<l0, l4, (undef13 > ~(1)) /\ (undef8 > ~(1)) /\ (undef12 > 0), par{arg1 -> undef8, arg2 -> 1}>
<l2, l2, (undef5 <= arg1) /\ (undef7 > 0) /\ (arg1 > 0) /\ (undef5 > 0), par{arg1 -> undef5, arg2 -> undef6}>
<l4, l4, (arg1 > 0) /\ (arg2 > 0), par{arg1 -> (arg1 - 1), arg2 -> (arg2 + 1)}>

Fresh variables:
undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef12, undef13, 

Undef variables:
undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef12, undef13, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

*************************************************************
*******************************************************************************************
***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
*******************************************************************************************

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l4, l4, 1 <= arg1 /\ 1 <= arg2, {arg1 -> -1 + arg1, arg2 -> 1 + arg2, rest remain the same}>
Variables:
arg1, arg2

Graph 2:
Transitions:
<l2, l2, 1 <= arg1 /\ 1 <= undef5 /\ 1 <= undef7 /\ undef5 <= arg1, {arg1 -> undef5, arg2 -> undef6, rest remain the same}>
Variables:
arg1, arg2

Precedence: 
Graph 0

Graph 1
<l0, l4, 1 <= undef12 /\ 0 <= undef8 /\ 0 <= undef13, {arg1 -> undef8, arg2 -> 1, rest remain the same}>

Graph 2
<l0, l2, 1 <= undef12 /\ 0 <= undef3, {arg1 -> undef3, arg2 -> undef4, rest remain the same}>

Map Locations to Subgraph:
( 0 , 0 )
( 2 , 2 )
( 4 , 1 )

*******************************************************************************************
********************************    CHECKING ASSERTIONS    ********************************
*******************************************************************************************

Proving termination of subgraph 0
Proving termination of subgraph 1
Checking unfeasibility...
Time used: 0.002371

Checking conditional termination of SCC {l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000691s
Ranking function: -1 + arg1
New Graphs: 
Proving termination of subgraph 2
Checking unfeasibility...
Time used: 0.002068

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000735s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002558s
[62788 : 62789]
[62788 : 62790]
Successful child: 62789
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 1 <= arg1 /\ 1 <= undef5 /\ 1 <= undef7 /\ undef5 <= arg1, {arg1 -> undef5, arg2 -> undef6, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l2, l2, 1 <= arg1 /\ 1 <= undef5 /\ 1 <= undef7 /\ undef5 <= arg1, {arg1 -> undef5, arg2 -> undef6, rest remain the same}>
New Graphs: 

LOG: CALL check - Post:arg1 <= 0 - Process 1
* Exit transition: <l0, l2, 1 <= undef12 /\ 0 <= undef3, {arg1 -> undef3, arg2 -> undef4, rest remain the same}>
* Postcondition  : arg1 <= 0

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000401s
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 0.000487s
INVARIANTS: 
2: 
Quasi-INVARIANTS to narrow Graph: 
2: arg1 <= 0 , 
Narrowing transition: 
<l2, l2, 1 <= arg1 /\ 1 <= undef5 /\ 1 <= undef7 /\ undef5 <= arg1, {arg1 -> undef5, arg2 -> undef6, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l2, l2, 1 <= arg1 /\ 1 <= undef5 /\ 1 <= undef7 /\ undef5 <= arg1, {arg1 -> undef5, arg2 -> undef6, rest remain the same}>
Variables:
arg1, arg2
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000741s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002588s
[62788 : 62794]
[62788 : 62795]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006357s
Time used: 0.005986

[62788 : 62903]
[62788 : 62907]
Successful child: 62907

Program does NOT terminate