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


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


YES

Solver Timeout: 4
Global Timeout: 300
Maximum number of concurrent processes: 900
No parsing errors!
Init Location: 0
Transitions:
<l0, l5, true>
<l1, l2, true, par{arg1 -> 0, arg2 -> 0, arg3 -> 0}>
<l2, l2, (arg2 > ~(1)) /\ (arg1 > ~(1)) /\ (arg2 < 1001) /\ (arg2 = arg3), par{arg1 -> (arg1 + arg2), arg2 -> (arg2 + 1), arg3 -> (arg2 + 1)}>
<l2, l3, (arg2 > 1000) /\ (arg2 = arg3), par{arg1 -> 0, arg2 -> 0, arg3 -> 0}>
<l3, l3, (arg2 > ~(1)) /\ (arg1 > ~(1)) /\ (arg2 < 1001) /\ (arg2 = arg3), par{arg1 -> (arg1 + arg2), arg2 -> (arg2 + 2), arg3 -> (arg2 + 2)}>
<l3, l4, (arg2 > 1000) /\ (arg2 = arg3), par{arg1 -> 0, arg2 -> 0, arg3 -> 0}>
<l4, l4, (arg2 > ~(1)) /\ (arg1 > ~(1)) /\ (arg2 < 1001) /\ (arg2 = arg3), par{arg1 -> (arg1 + arg2), arg2 -> (arg2 + 3), arg3 -> (arg2 + 3)}>
<l5, l1, true, par{arg1 -> undef19, arg2 -> undef20, arg3 -> undef21}>

Fresh variables:
undef19, undef20, undef21, 

Undef variables:
undef19, undef20, undef21, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (arg1 = 0) /\ (arg2 = 0) /\ (arg3 = 0)>
<l2, l2, (arg2 > ~(1)) /\ (arg1 > ~(1)) /\ (arg2 < 1001) /\ (arg2 = arg3), par{arg1 -> (arg1 + arg2), arg2 -> (arg2 + 1), arg3 -> (arg2 + 1)}>
<l2, l3, (arg2 > 1000) /\ (arg2 = arg3), par{arg1 -> 0, arg2 -> 0, arg3 -> 0}>
<l3, l3, (arg2 > ~(1)) /\ (arg1 > ~(1)) /\ (arg2 < 1001) /\ (arg2 = arg3), par{arg1 -> (arg1 + arg2), arg2 -> (arg2 + 2), arg3 -> (arg2 + 2)}>
<l3, l4, (arg2 > 1000) /\ (arg2 = arg3), par{arg1 -> 0, arg2 -> 0, arg3 -> 0}>
<l4, l4, (arg2 > ~(1)) /\ (arg1 > ~(1)) /\ (arg2 < 1001) /\ (arg2 = arg3), par{arg1 -> (arg1 + arg2), arg2 -> (arg2 + 3), arg3 -> (arg2 + 3)}>

Fresh variables:
undef19, undef20, undef21, 

Undef variables:
undef19, undef20, undef21, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

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

Graph 2:
Transitions:
<l3, l3, 0 <= arg1 /\ 0 <= arg2 /\ arg2 <= 1000 /\ arg2 = arg3, {arg1 -> arg1 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, rest remain the same}>
Variables:
arg1, arg2, arg3

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

Precedence: 
Graph 0

Graph 1
<l0, l2, arg1 = 0 /\ arg2 = 0 /\ arg3 = 0, {all remain the same}>

Graph 2
<l2, l3, 1001 <= arg2 /\ arg2 = arg3, {arg1 -> 0, arg2 -> 0, arg3 -> 0, rest remain the same}>

Graph 3
<l3, l4, 1001 <= arg2 /\ arg2 = arg3, {arg1 -> 0, arg2 -> 0, arg3 -> 0, rest remain the same}>

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

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

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

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000896s
Ranking function: 1000 - arg2
New Graphs: 
Proving termination of subgraph 2
Checking unfeasibility...
Time used: 0.002336

Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000964s
Ranking function: 500 + (~(1) / 2)*arg2
New Graphs: 
Proving termination of subgraph 3
Checking unfeasibility...
Time used: 0.002243

Checking conditional termination of SCC {l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000951s
Ranking function: (1000 / 3) + (~(1) / 3)*arg2
New Graphs: 
Program Terminates