/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, l10, true>
<l1, l2, (1 <= (0 + x^0)), par{x^0 -> (~(1) + x^0)}>
<l2, l1, true>
<l3, l1, ((0 + y^0) <= 0)>
<l3, l4, (1 <= (0 + y^0)), par{y^0 -> (~(1) + y^0)}>
<l4, l3, true>
<l5, l3, ((0 + z^0) <= (0 + x^0))>
<l5, l6, ((1 + x^0) <= (0 + z^0)), par{x^0 -> (1 + x^0)}>
<l6, l5, true>
<l7, l5, ((0 + y^0) <= (0 + z^0))>
<l7, l8, ((1 + z^0) <= (0 + y^0)), par{y^0 -> (~(1) + y^0)}>
<l8, l7, true>
<l9, l7, true, par{x^0 -> 0}>
<l10, l9, true>

Fresh variables:

Undef variables:

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l7, (x^0 = 0)>
<l1, l1, (1 <= (0 + x^0)), par{x^0 -> (~(1) + x^0)}>
<l3, l1, ((0 + y^0) <= 0)>
<l3, l3, (1 <= (0 + y^0)), par{y^0 -> (~(1) + y^0)}>
<l5, l3, ((0 + z^0) <= (0 + x^0))>
<l5, l5, ((1 + x^0) <= (0 + z^0)), par{x^0 -> (1 + x^0)}>
<l7, l5, ((0 + y^0) <= (0 + z^0))>
<l7, l7, ((1 + z^0) <= (0 + y^0)), par{y^0 -> (~(1) + y^0)}>

Fresh variables:

Undef variables:

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l7, l7, 1 + z^0 <= y^0, {y^0 -> -1 + y^0, rest remain the same}>
Variables:
y^0, z^0

Graph 2:
Transitions:
<l5, l5, 1 + x^0 <= z^0, {x^0 -> 1 + x^0, rest remain the same}>
Variables:
x^0, z^0

Graph 3:
Transitions:
<l3, l3, 1 <= y^0, {y^0 -> -1 + y^0, rest remain the same}>
Variables:
y^0

Graph 4:
Transitions:
<l1, l1, 1 <= x^0, {x^0 -> -1 + x^0, rest remain the same}>
Variables:
x^0

Precedence: 
Graph 0

Graph 1
<l0, l7, x^0 = 0, {all remain the same}>

Graph 2
<l7, l5, y^0 <= z^0, {all remain the same}>

Graph 3
<l5, l3, z^0 <= x^0, {all remain the same}>

Graph 4
<l3, l1, y^0 <= 0, {all remain the same}>

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

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

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

Checking conditional termination of SCC {l7}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000569s
Ranking function: -1 + y^0 - z^0
New Graphs: 
Proving termination of subgraph 2
Checking unfeasibility...
Time used: 0.001564

Checking conditional termination of SCC {l5}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000795s
Ranking function: -1 - x^0 + z^0
New Graphs: 
Proving termination of subgraph 3
Checking unfeasibility...
Time used: 0.001248

Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000552s
Ranking function: -1 + y^0
New Graphs: 
Proving termination of subgraph 4
Checking unfeasibility...
Time used: 0.001193

Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000553s
Ranking function: -1 + x^0
New Graphs: 
Program Terminates