/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, l43, true>
<l1, l2, ((0 + ip^0) <= (0 + j^0))>
<l1, l3, ((0 + j^0) <= (~(1) + ip^0)) /\ (undef29 = undef29) /\ (undef30 = undef30), par{g^0 -> undef29, h^0 -> undef30, j^0 -> (1 + j^0)}>
<l3, l1, true>
<l4, l5, (0 <= (0 + theta^0))>
<l4, l5, ((1 + theta^0) <= 0), par{t^0 -> (0 + (~(1) * t^0))}>
<l6, l7, ((1 + n^0) <= (0 + iq^0)), par{ip^0 -> (1 + ip^0)}>
<l6, l8, ((0 + iq^0) <= (0 + n^0)), par{iq^0 -> (1 + iq^0)}>
<l9, l4, (undef202 = undef202) /\ (undef208 = undef208) /\ (undef209 = undef209) /\ (undef200 = undef200), par{t^0 -> undef200, theta^0 -> undef202, tmp___2^0 -> undef208, tmp___3^0 -> undef209}>
<l5, l3, (undef239 = undef239) /\ (undef217 = undef217) /\ (undef225 = undef225) /\ (undef228 = undef228) /\ (undef219 = undef219), par{c^0 -> undef217, h^0 -> undef219, s^0 -> undef225, tau^0 -> undef228, tmp___6^0 -> undef239}>
<l10, l9, ((1 + tmp___5^0) <= ((0 + g^0) + tmp___4^0))>
<l10, l9, (((1 + g^0) + tmp___4^0) <= (0 + tmp___5^0))>
<l10, l5, (((0 + g^0) + tmp___4^0) <= (0 + tmp___5^0)) /\ ((0 + tmp___5^0) <= ((0 + g^0) + tmp___4^0)) /\ (undef308 = undef308), par{t^0 -> undef308}>
<l11, l12, ((0 + tmp___7^0) <= (0 + tresh^0))>
<l11, l10, ((1 + tresh^0) <= (0 + tmp___7^0)) /\ (undef354 = undef354) /\ (undef372 = undef372) /\ (undef373 = undef373), par{h^0 -> undef354, tmp___4^0 -> undef372, tmp___5^0 -> undef373}>
<l13, l11, (undef402 = undef402), par{tmp___7^0 -> undef402}>
<l14, l13, true>
<l15, l13, true>
<l12, l16, true, par{iq^0 -> (1 + iq^0)}>
<l17, l15, ((1 + tmp___11^0) <= ((0 + g^0) + tmp___10^0))>
<l17, l15, (((1 + g^0) + tmp___10^0) <= (0 + tmp___11^0))>
<l17, l12, (((0 + g^0) + tmp___10^0) <= (0 + tmp___11^0)) /\ ((0 + tmp___11^0) <= ((0 + g^0) + tmp___10^0))>
<l18, l14, ((1 + tmp___9^0) <= ((0 + g^0) + tmp___8^0))>
<l18, l14, (((1 + g^0) + tmp___8^0) <= (0 + tmp___9^0))>
<l18, l17, (((0 + g^0) + tmp___8^0) <= (0 + tmp___9^0)) /\ ((0 + tmp___9^0) <= ((0 + g^0) + tmp___8^0)) /\ (undef637 = undef637) /\ (undef638 = undef638), par{tmp___10^0 -> undef637, tmp___11^0 -> undef638}>
<l8, l6, true>
<l19, l13, ((0 + i^0) <= 4)>
<l19, l18, (5 <= (0 + i^0)) /\ (undef727 = undef727) /\ (undef728 = undef728), par{tmp___8^0 -> undef727, tmp___9^0 -> undef728}>
<l20, l21, ((1 + n^0) <= (0 + iq^0)), par{ip^0 -> (1 + ip^0)}>
<l20, l19, ((0 + iq^0) <= (0 + n^0)) /\ (undef774 = undef774) /\ (undef758 = undef758), par{g^0 -> undef758, tmp___1^0 -> undef774}>
<l16, l20, true>
<l22, l23, ((0 + n^0) <= (0 + ip^0))>
<l22, l16, ((0 + ip^0) <= (~(1) + n^0))>
<l24, l25, ((1 + n^0) <= (0 + ip^0))>
<l24, l8, ((0 + ip^0) <= (0 + n^0))>
<l21, l22, true>
<l26, l21, (4 <= (0 + i^0)), par{tresh^0 -> 0}>
<l26, l21, ((1 + i^0) <= 4) /\ (undef999 = undef999), par{tresh^0 -> undef999}>
<l27, l26, (1 <= (0 + sm^0))>
<l27, l26, ((1 + sm^0) <= 0)>
<l27, l28, ((0 + sm^0) <= 0) /\ (0 <= (0 + sm^0))>
<l7, l24, true>
<l29, l30, ((1 + n^0) <= (0 + iq^0)), par{ip^0 -> (1 + ip^0)}>
<l29, l31, ((0 + iq^0) <= (0 + n^0)) /\ (undef1149 = undef1149), par{iq^0 -> (1 + iq^0), sm^0 -> ((0 + sm^0) + undef1149), tmp___0^0 -> undef1149}>
<l31, l29, true>
<l32, l27, ((0 + n^0) <= (0 + ip^0))>
<l32, l31, ((0 + ip^0) <= (~(1) + n^0))>
<l30, l32, true>
<l33, l28, (51 <= (0 + i^0))>
<l33, l30, ((0 + i^0) <= 50), par{sm^0 -> 0}>
<l34, l33, true>
<l35, l7, true>
<l36, l34, ((1 + n^0) <= (0 + ip^0))>
<l36, l25, ((0 + ip^0) <= (0 + n^0)) /\ (undef1418 = undef1418), par{ip^0 -> (1 + ip^0), tmp^0 -> undef1418}>
<l25, l36, true>
<l37, l34, ((1 + n^0) <= (0 + ip^0)), par{i^0 -> (1 + i^0)}>
<l37, l23, ((0 + ip^0) <= (0 + n^0)), par{ip^0 -> (1 + ip^0)}>
<l23, l37, true>
<l38, l12, ((1 + n^0) <= (0 + j^0))>
<l38, l39, ((0 + j^0) <= (0 + n^0)) /\ (undef1568 = undef1568) /\ (undef1569 = undef1569), par{g^0 -> undef1568, h^0 -> undef1569, j^0 -> (1 + j^0)}>
<l39, l38, true>
<l40, l39, ((1 + n^0) <= (0 + j^0))>
<l40, l41, ((0 + j^0) <= (0 + n^0)) /\ (undef1649 = undef1649) /\ (undef1650 = undef1650), par{g^0 -> undef1649, h^0 -> undef1650, j^0 -> (1 + j^0)}>
<l41, l40, true>
<l42, l41, ((0 + iq^0) <= (0 + j^0))>
<l42, l2, ((0 + j^0) <= (~(1) + iq^0)) /\ (undef1730 = undef1730) /\ (undef1731 = undef1731), par{g^0 -> undef1730, h^0 -> undef1731, j^0 -> (1 + j^0)}>
<l2, l42, true>
<l43, l35, true>

Fresh variables:
undef29, undef30, undef200, undef202, undef208, undef209, undef217, undef219, undef225, undef228, undef239, undef308, undef354, undef372, undef373, undef402, undef637, undef638, undef727, undef728, undef758, undef774, undef999, undef1149, undef1418, undef1568, undef1569, undef1649, undef1650, undef1730, undef1731, 

Undef variables:
undef29, undef30, undef200, undef202, undef208, undef209, undef217, undef219, undef225, undef228, undef239, undef308, undef354, undef372, undef373, undef402, undef637, undef638, undef727, undef728, undef758, undef774, undef999, undef1149, undef1418, undef1568, undef1569, undef1649, undef1650, undef1730, undef1731, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l25, ((1 + n^0) <= (0 + ip^0))>
<l0, l8, ((0 + ip^0) <= (0 + n^0))>
<l8, l25, ((1 + n^0) <= (0 + iq^0)) /\ ((1 + n^0) <= (0 + (1 + ip^0))), par{ip^0 -> (1 + ip^0)}>
<l8, l8, ((1 + n^0) <= (0 + iq^0)) /\ ((0 + (1 + ip^0)) <= (0 + n^0)), par{ip^0 -> (1 + ip^0)}>
<l8, l8, ((0 + iq^0) <= (0 + n^0)), par{iq^0 -> (1 + iq^0)}>
<l25, l28, ((1 + n^0) <= (0 + ip^0)) /\ (51 <= (0 + i^0))>
<l25, l28, ((1 + n^0) <= (0 + ip^0)) /\ ((0 + i^0) <= 50) /\ ((0 + n^0) <= (0 + ip^0)) /\ ((0 + 0) <= 0) /\ (0 <= (0 + 0)), par{sm^0 -> 0}>
<l25, l25, ((0 + ip^0) <= (0 + n^0)) /\ (undef1418 = undef1418), par{ip^0 -> (1 + ip^0)}>

Fresh variables:
undef29, undef30, undef200, undef202, undef208, undef209, undef217, undef219, undef225, undef228, undef239, undef308, undef354, undef372, undef373, undef402, undef637, undef638, undef727, undef728, undef758, undef774, undef999, undef1149, undef1418, undef1568, undef1569, undef1649, undef1650, undef1730, undef1731, 

Undef variables:
undef29, undef30, undef200, undef202, undef208, undef209, undef217, undef219, undef225, undef228, undef239, undef308, undef354, undef372, undef373, undef402, undef637, undef638, undef727, undef728, undef758, undef774, undef999, undef1149, undef1418, undef1568, undef1569, undef1649, undef1650, undef1730, undef1731, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l8, l8, 1 + ip^0 <= n^0 /\ 1 + n^0 <= iq^0, {ip^0 -> 1 + ip^0, rest remain the same}>
<l8, l8, iq^0 <= n^0, {iq^0 -> 1 + iq^0, rest remain the same}>
Variables:
ip^0, iq^0, n^0

Graph 2:
Transitions:
<l25, l25, ip^0 <= n^0, {ip^0 -> 1 + ip^0, rest remain the same}>
Variables:
ip^0, n^0

Graph 3:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l8, ip^0 <= n^0, {all remain the same}>

Graph 2
<l0, l25, 1 + n^0 <= ip^0, {all remain the same}>
<l8, l25, n^0 <= ip^0 /\ 1 + n^0 <= iq^0, {ip^0 -> 1 + ip^0, rest remain the same}>

Graph 3
<l25, l28, 1 + n^0 <= ip^0 /\ 51 <= i^0, {all remain the same}>
<l25, l28, 1 + n^0 <= ip^0 /\ i^0 <= 50, {sm^0 -> 0, rest remain the same}>

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

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

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

Checking conditional termination of SCC {l8}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001980s
Ranking function: -iq^0 + n^0
New Graphs: 
Transitions:
<l8, l8, 1 + ip^0 <= n^0 /\ 1 + n^0 <= iq^0, {ip^0 -> 1 + ip^0, rest remain the same}>
Variables:
ip^0, iq^0, n^0
Checking conditional termination of SCC {l8}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001275s
Ranking function: -1 - ip^0 + n^0
New Graphs: 
Proving termination of subgraph 2
Checking unfeasibility...
Time used: 0.003036
Some transition disabled by a set of invariant(s):
Invariant at l25: 1 + n^0 <= ip^0

Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l25, l25, ip^0 <= n^0, {ip^0 -> 1 + ip^0, rest remain the same}>
Checking unfeasibility...
Time used: 7.7e-05

Analyzing SCC {l25}...
No cycles found.

Proving termination of subgraph 3
Analyzing SCC {l28}...
No cycles found.

Program Terminates