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


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


YES

Solver Timeout: 4
Global Timeout: 300
Maximum number of concurrent processes: 900
No parsing errors!
Init Location: 0
Transitions:
<l0, l4, true>
<l1, l2, true, par{arg1 -> 0}>
<l2, l2, (arg1 < 100), par{arg1 -> (arg1 + 1)}>
<l2, l3, (arg1 > 99), par{arg1 -> 5}>
<l3, l3, (arg1 < 21), par{arg1 -> (arg1 + 3)}>
<l4, l1, true, par{arg1 -> undef5}>

Fresh variables:
undef5, 

Undef variables:
undef5, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (arg1 = 0)>
<l2, l2, (arg1 < 100), par{arg1 -> (arg1 + 1)}>
<l2, l3, (arg1 > 99), par{arg1 -> 5}>
<l3, l3, (arg1 < 21), par{arg1 -> (arg1 + 3)}>

Fresh variables:
undef5, 

Undef variables:
undef5, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l2, arg1 <= 99, {arg1 -> 1 + arg1, rest remain the same}>
Variables:
arg1

Graph 2:
Transitions:
<l3, l3, arg1 <= 20, {arg1 -> 3 + arg1, rest remain the same}>
Variables:
arg1

Precedence: 
Graph 0

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

Graph 2
<l2, l3, 100 <= arg1, {arg1 -> 5, rest remain the same}>

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

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

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

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000491s
Ranking function: 99 - arg1
New Graphs: 
Proving termination of subgraph 2
Checking unfeasibility...
Time used: 0.032102

Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000642s
Ranking function: (20 / 3) + (~(1) / 3)*arg1
New Graphs: 
Program Terminates