/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, l13, true>
<l1, l2, true>
<l3, l4, true, par{Inner10^0 -> (1 + Inner10^0)}>
<l5, l6, true>
<l7, l3, (undef63 = undef63), par{Pcnt13^0 -> (1 + Pcnt13^0), Ptotal11^0 -> undef63}>
<l7, l3, (undef74 = undef74), par{Ncnt14^0 -> (1 + Ncnt14^0), Ntotal12^0 -> undef74}>
<l8, l9, (10 <= (0 + Inner10^0)), par{Outer9^0 -> (1 + Outer9^0)}>
<l8, l7, ((1 + Inner10^0) <= 10)>
<l10, l11, (10 <= (0 + Outer9^0)) /\ (undef135 = undef135), par{Negcnt^0 -> (0 + Ncnt14^0), Negtotal^0 -> (0 + Ntotal12^0), Poscnt^0 -> (0 + Pcnt13^0), Postotal^0 -> (0 + Ptotal11^0), StopTime3^0 -> 1500, TotalTime4^0 -> undef135}>
<l10, l4, ((1 + Outer9^0) <= 10), par{Inner10^0 -> 0}>
<l9, l10, true>
<l4, l8, true>
<l6, l1, (10 <= (0 + InnerIndex7^0)), par{OuterIndex6^0 -> (1 + OuterIndex6^0)}>
<l6, l5, ((1 + InnerIndex7^0) <= 10) /\ (undef217 = undef217), par{InnerIndex7^0 -> (1 + InnerIndex7^0), Seed^0 -> undef217, ret_RandomInteger15^0 -> (0 + undef217)}>
<l2, l9, (10 <= (0 + OuterIndex6^0)), par{Ncnt14^0 -> 0, Ntotal12^0 -> 0, Outer9^0 -> 0, Pcnt13^0 -> 0, Ptotal11^0 -> 0, StartTime2^0 -> 1000}>
<l2, l5, ((1 + OuterIndex6^0) <= 10), par{InnerIndex7^0 -> 0}>
<l12, l1, true, par{OuterIndex6^0 -> 0, Seed^0 -> 0}>
<l13, l12, true>

Fresh variables:
undef63, undef74, undef135, undef217, 

Undef variables:
undef63, undef74, undef135, undef217, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l5, (OuterIndex6^0 = 0) /\ ((1 + 0) <= 10), par{InnerIndex7^0 -> 0}>
<l4, l11, (10 <= (0 + Inner10^0)) /\ (10 <= (0 + (1 + Outer9^0))) /\ (undef135 = undef135), par{Outer9^0 -> (1 + Outer9^0)}>
<l4, l4, (10 <= (0 + Inner10^0)) /\ ((1 + (1 + Outer9^0)) <= 10), par{Inner10^0 -> 0, Outer9^0 -> (1 + Outer9^0)}>
<l4, l4, ((1 + Inner10^0) <= 10) /\ (undef63 = undef63), par{Inner10^0 -> (1 + Inner10^0), Pcnt13^0 -> (1 + Pcnt13^0), Ptotal11^0 -> undef63}>
<l4, l4, ((1 + Inner10^0) <= 10) /\ (undef74 = undef74), par{Inner10^0 -> (1 + Inner10^0), Ncnt14^0 -> (1 + Ncnt14^0), Ntotal12^0 -> undef74}>
<l5, l4, (10 <= (0 + InnerIndex7^0)) /\ (10 <= (0 + (1 + OuterIndex6^0))) /\ ((1 + 0) <= 10), par{Inner10^0 -> 0, Ncnt14^0 -> 0, Ntotal12^0 -> 0, Outer9^0 -> 0, OuterIndex6^0 -> (1 + OuterIndex6^0), Pcnt13^0 -> 0, Ptotal11^0 -> 0}>
<l5, l5, (10 <= (0 + InnerIndex7^0)) /\ ((1 + (1 + OuterIndex6^0)) <= 10), par{InnerIndex7^0 -> 0, OuterIndex6^0 -> (1 + OuterIndex6^0)}>
<l5, l5, ((1 + InnerIndex7^0) <= 10) /\ (undef217 = undef217), par{InnerIndex7^0 -> (1 + InnerIndex7^0)}>

Fresh variables:
undef63, undef74, undef135, undef217, 

Undef variables:
undef63, undef74, undef135, undef217, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l5, l5, 10 <= InnerIndex7^0 /\ OuterIndex6^0 <= 8, {InnerIndex7^0 -> 0, OuterIndex6^0 -> 1 + OuterIndex6^0, rest remain the same}>
<l5, l5, InnerIndex7^0 <= 9, {InnerIndex7^0 -> 1 + InnerIndex7^0, rest remain the same}>
Variables:
InnerIndex7^0, OuterIndex6^0

Graph 2:
Transitions:
<l4, l4, 10 <= Inner10^0 /\ Outer9^0 <= 8, {Inner10^0 -> 0, Outer9^0 -> 1 + Outer9^0, rest remain the same}>
<l4, l4, Inner10^0 <= 9, {Inner10^0 -> 1 + Inner10^0, Pcnt13^0 -> 1 + Pcnt13^0, Ptotal11^0 -> undef63, rest remain the same}>
<l4, l4, Inner10^0 <= 9, {Inner10^0 -> 1 + Inner10^0, Ncnt14^0 -> 1 + Ncnt14^0, Ntotal12^0 -> undef74, rest remain the same}>
Variables:
Inner10^0, Outer9^0, Pcnt13^0, Ptotal11^0, Ncnt14^0, Ntotal12^0

Graph 3:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l5, OuterIndex6^0 = 0, {InnerIndex7^0 -> 0, rest remain the same}>

Graph 2
<l5, l4, 10 <= InnerIndex7^0 /\ 9 <= OuterIndex6^0, {Inner10^0 -> 0, Ncnt14^0 -> 0, Ntotal12^0 -> 0, Outer9^0 -> 0, OuterIndex6^0 -> 1 + OuterIndex6^0, Pcnt13^0 -> 0, Ptotal11^0 -> 0, rest remain the same}>

Graph 3
<l4, l11, 10 <= Inner10^0 /\ 9 <= Outer9^0, {Outer9^0 -> 1 + Outer9^0, rest remain the same}>

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

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

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

Checking conditional termination of SCC {l5}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001301s
Ranking function: 8 - OuterIndex6^0
New Graphs: 
Transitions:
<l5, l5, InnerIndex7^0 <= 9, {InnerIndex7^0 -> 1 + InnerIndex7^0, rest remain the same}>
Variables:
InnerIndex7^0
Checking conditional termination of SCC {l5}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000576s
Ranking function: 9 - InnerIndex7^0
New Graphs: 
Proving termination of subgraph 2
Checking unfeasibility...
Time used: 0.029507

Checking conditional termination of SCC {l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002773s
Ranking function: 8 - Outer9^0
New Graphs: 
Transitions:
<l4, l4, Inner10^0 <= 9, {Inner10^0 -> 1 + Inner10^0, Pcnt13^0 -> 1 + Pcnt13^0, Ptotal11^0 -> undef63, rest remain the same}>
<l4, l4, Inner10^0 <= 9, {Inner10^0 -> 1 + Inner10^0, Ncnt14^0 -> 1 + Ncnt14^0, Ntotal12^0 -> undef74, rest remain the same}>
Variables:
Inner10^0, Ncnt14^0, Ntotal12^0, Pcnt13^0, Ptotal11^0
Checking conditional termination of SCC {l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001218s
Ranking function: 9 - Inner10^0
New Graphs: 
Proving termination of subgraph 3
Analyzing SCC {l11}...
No cycles found.

Program Terminates