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


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


NO

Solver Timeout: 4
Global Timeout: 300
Maximum number of concurrent processes: 900
No parsing errors!
Init Location: 0
Transitions:
<l0, l11, true>
<l1, l2, true>
<l2, l1, true>
<l3, l4, true>
<l5, l3, (1 <= (0 + pIrb^0)) /\ (undef35 = undef35), par{ntStatus^0 -> undef35}>
<l5, l3, ((0 + pIrb^0) <= 0)>
<l6, l5, (undef54 = undef54), par{pIrb^0 -> undef54}>
<l7, l6, ((1 + ResourceIrp^0) <= 0)>
<l7, l6, (1 <= (0 + ResourceIrp^0))>
<l7, l3, ((0 + ResourceIrp^0) <= 0) /\ (0 <= (0 + ResourceIrp^0))>
<l8, l3, ((0 + IsochResourceData^0) <= 0)>
<l8, l7, (1 <= (0 + IsochResourceData^0)) /\ (undef100 = undef100) /\ (undef93 = undef93) /\ (undef94 = undef94), par{ResourceIrp^0 -> (0 + undef94), StackSize^0 -> undef93, ___rho_99_^0 -> undef94}>
<l9, l1, ((0 + k4^0) <= 0) /\ (undef110 = 1), par{keR^0 -> 0}>
<l9, l8, (1 <= (0 + k4^0)) /\ (undef120 = 1), par{k4^0 -> (~(1) + k4^0), keR^0 -> 0}>
<l4, l9, (undef130 = 1), par{keA^0 -> 0}>
<l10, l4, true, par{keA^0 -> 0, keR^0 -> 0}>
<l11, l10, true>

Fresh variables:
undef35, undef54, undef93, undef94, undef100, undef110, undef120, undef130, 

Undef variables:
undef35, undef54, undef93, undef94, undef100, undef110, undef120, undef130, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l4, true>
<l1, l1, true>
<l4, l1, (undef130 = 1) /\ ((0 + k4^0) <= 0) /\ (undef110 = 1)>
<l4, l4, (undef130 = 1) /\ (1 <= (0 + k4^0)) /\ (undef120 = 1) /\ ((0 + IsochResourceData^0) <= 0), par{k4^0 -> (~(1) + k4^0)}>
<l4, l4, (undef130 = 1) /\ (1 <= (0 + k4^0)) /\ (undef120 = 1) /\ (1 <= (0 + IsochResourceData^0)) /\ (undef100 = undef100) /\ (undef93 = undef93) /\ (undef94 = undef94) /\ ((1 + (0 + undef94)) <= 0) /\ (undef54 = undef54) /\ (1 <= (0 + undef54)) /\ (undef35 = undef35), par{k4^0 -> (~(1) + k4^0)}>
<l4, l4, (undef130 = 1) /\ (1 <= (0 + k4^0)) /\ (undef120 = 1) /\ (1 <= (0 + IsochResourceData^0)) /\ (undef100 = undef100) /\ (undef93 = undef93) /\ (undef94 = undef94) /\ ((1 + (0 + undef94)) <= 0) /\ (undef54 = undef54) /\ ((0 + undef54) <= 0), par{k4^0 -> (~(1) + k4^0)}>
<l4, l4, (undef130 = 1) /\ (1 <= (0 + k4^0)) /\ (undef120 = 1) /\ (1 <= (0 + IsochResourceData^0)) /\ (undef100 = undef100) /\ (undef93 = undef93) /\ (undef94 = undef94) /\ (1 <= (0 + (0 + undef94))) /\ (undef54 = undef54) /\ (1 <= (0 + undef54)) /\ (undef35 = undef35), par{k4^0 -> (~(1) + k4^0)}>
<l4, l4, (undef130 = 1) /\ (1 <= (0 + k4^0)) /\ (undef120 = 1) /\ (1 <= (0 + IsochResourceData^0)) /\ (undef100 = undef100) /\ (undef93 = undef93) /\ (undef94 = undef94) /\ (1 <= (0 + (0 + undef94))) /\ (undef54 = undef54) /\ ((0 + undef54) <= 0), par{k4^0 -> (~(1) + k4^0)}>
<l4, l4, (undef130 = 1) /\ (1 <= (0 + k4^0)) /\ (undef120 = 1) /\ (1 <= (0 + IsochResourceData^0)) /\ (undef100 = undef100) /\ (undef93 = undef93) /\ (undef94 = undef94) /\ ((0 + (0 + undef94)) <= 0) /\ (0 <= (0 + (0 + undef94))), par{k4^0 -> (~(1) + k4^0)}>

Fresh variables:
undef35, undef54, undef93, undef94, undef100, undef110, undef120, undef130, 

Undef variables:
undef35, undef54, undef93, undef94, undef100, undef110, undef120, undef130, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l4, l4, 1 <= k4^0 /\ IsochResourceData^0 <= 0 /\ undef120 = 1 /\ undef130 = 1, {k4^0 -> -1 + k4^0, rest remain the same}>
<l4, l4, 1 <= IsochResourceData^0 /\ 1 <= k4^0 /\ 1 <= undef54 /\ 1 + undef94 <= 0 /\ undef120 = 1 /\ undef130 = 1, {k4^0 -> -1 + k4^0, rest remain the same}>
<l4, l4, 1 <= IsochResourceData^0 /\ 1 <= k4^0 /\ 1 + undef94 <= 0 /\ undef54 <= 0 /\ undef120 = 1 /\ undef130 = 1, {k4^0 -> -1 + k4^0, rest remain the same}>
<l4, l4, 1 <= IsochResourceData^0 /\ 1 <= k4^0 /\ 1 <= undef54 /\ 1 <= undef94 /\ undef120 = 1 /\ undef130 = 1, {k4^0 -> -1 + k4^0, rest remain the same}>
<l4, l4, 1 <= IsochResourceData^0 /\ 1 <= k4^0 /\ 1 <= undef94 /\ undef54 <= 0 /\ undef120 = 1 /\ undef130 = 1, {k4^0 -> -1 + k4^0, rest remain the same}>
<l4, l4, 1 <= IsochResourceData^0 /\ 1 <= k4^0 /\ undef94 = 0 /\ undef120 = 1 /\ undef130 = 1, {k4^0 -> -1 + k4^0, rest remain the same}>
Variables:
IsochResourceData^0, k4^0

Graph 2:
Transitions:
<l1, l1, true, {all remain the same}>
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l4, true, {all remain the same}>

Graph 2
<l4, l1, k4^0 <= 0 /\ undef110 = 1 /\ undef130 = 1, {all remain the same}>

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

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

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

Checking conditional termination of SCC {l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004565s
Ranking function: -2 + IsochResourceData^0 + k4^0
New Graphs: 
Transitions:
<l4, l4, 1 <= k4^0 /\ IsochResourceData^0 <= 0 /\ undef120 = 1 /\ undef130 = 1, {k4^0 -> -1 + k4^0, rest remain the same}>
Variables:
IsochResourceData^0, k4^0
Checking conditional termination of SCC {l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000852s
Ranking function: -1 + k4^0
New Graphs: 
Proving termination of subgraph 2
Checking unfeasibility...
Time used: 0.000838

> No variable changes in termination graph.
Checking conditional unfeasibility...
Termination failed. Trying to show unreachability...
Proving unreachability of entry: <l4, l1, k4^0 <= 0 /\ undef110 = 1 /\ undef130 = 1, {all remain the same}>

LOG: CALL check - Post:1 <= 0 - Process 1
* Exit transition: <l4, l1, k4^0 <= 0 /\ undef110 = 1 /\ undef130 = 1, {all remain the same}>
* Postcondition  : 1 <= 0
Postcodition moved up: 1 <= 0

LOG: Try proving POST

LOG: CALL check - Post:1 <= 0 - Process 2
* Exit transition: <l0, l4, undef110 = 1 /\ undef130 = 1, {all remain the same}>
* Postcondition  : 1 <= 0

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000427s
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 0.000496s

LOG: NarrowEntry size 1
Narrowing transition: 
<l4, l4, 1 <= k4^0 /\ IsochResourceData^0 <= 0 /\ undef120 = 1 /\ undef130 = 1, {k4^0 -> -1 + k4^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l4, l4, 1 <= IsochResourceData^0 /\ 1 <= k4^0 /\ 1 <= undef54 /\ 1 + undef94 <= 0 /\ undef120 = 1 /\ undef130 = 1, {k4^0 -> -1 + k4^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l4, l4, 1 <= IsochResourceData^0 /\ 1 <= k4^0 /\ 1 + undef94 <= 0 /\ undef54 <= 0 /\ undef120 = 1 /\ undef130 = 1, {k4^0 -> -1 + k4^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l4, l4, 1 <= IsochResourceData^0 /\ 1 <= k4^0 /\ 1 <= undef54 /\ 1 <= undef94 /\ undef120 = 1 /\ undef130 = 1, {k4^0 -> -1 + k4^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l4, l4, 1 <= IsochResourceData^0 /\ 1 <= k4^0 /\ 1 <= undef94 /\ undef54 <= 0 /\ undef120 = 1 /\ undef130 = 1, {k4^0 -> -1 + k4^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l4, l4, 1 <= IsochResourceData^0 /\ 1 <= k4^0 /\ undef94 = 0 /\ undef120 = 1 /\ undef130 = 1, {k4^0 -> -1 + k4^0, rest remain the same}>

LOG: Narrow transition size 1
ENTRIES:
<l0, l4, 0 <= 0 /\ undef110 = 1 /\ undef130 = 1, {all remain the same}>
END ENTRIES:
GRAPH:
<l4, l4, 1 <= k4^0 /\ 0 <= 0 /\ IsochResourceData^0 <= 0 /\ undef110 = 1 /\ undef120 = 1 /\ undef130 = 1, {k4^0 -> -1 + k4^0, rest remain the same}>
<l4, l4, 1 <= IsochResourceData^0 /\ 1 <= k4^0 /\ 1 <= undef54 /\ 1 + undef94 <= 0 /\ 0 <= 0 /\ undef110 = 1 /\ undef120 = 1 /\ undef130 = 1, {k4^0 -> -1 + k4^0, rest remain the same}>
<l4, l4, 1 <= IsochResourceData^0 /\ 1 <= k4^0 /\ 1 + undef94 <= 0 /\ 0 <= 0 /\ undef54 <= 0 /\ undef110 = 1 /\ undef120 = 1 /\ undef130 = 1, {k4^0 -> -1 + k4^0, rest remain the same}>
<l4, l4, 1 <= IsochResourceData^0 /\ 1 <= k4^0 /\ 1 <= undef54 /\ 1 <= undef94 /\ 0 <= 0 /\ undef110 = 1 /\ undef120 = 1 /\ undef130 = 1, {k4^0 -> -1 + k4^0, rest remain the same}>
<l4, l4, 1 <= IsochResourceData^0 /\ 1 <= k4^0 /\ 1 <= undef94 /\ 0 <= 0 /\ undef54 <= 0 /\ undef110 = 1 /\ undef120 = 1 /\ undef130 = 1, {k4^0 -> -1 + k4^0, rest remain the same}>
<l4, l4, 1 <= IsochResourceData^0 /\ 1 <= k4^0 /\ 0 <= 0 /\ undef94 = 0 /\ undef110 = 1 /\ undef120 = 1 /\ undef130 = 1, {k4^0 -> -1 + k4^0, rest remain the same}>
END GRAPH:
EXIT: <l4, l1, k4^0 <= 0 /\ undef110 = 1 /\ undef130 = 1, {all remain the same}>
POST: 1 <= 0


LOG: Try proving POST
[10071 : 10072]
[10071 : 10073]
[10071 : 10074]

LOG: Postcondition is not implied - no solution
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 1.210550s
Cannot prove unreachability

[10071 : 10075]
[10071 : 10076]
Successful child: 10075

Program does NOT terminate