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


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


NO

Solver Timeout: 4
Global Timeout: 300
Maximum number of concurrent processes: 900
No parsing errors!
Init Location: 0
Transitions:
<l0, l5, true>
<l1, l2, (undef3 > ~(1)) /\ (arg2 > 1) /\ ((undef4 - (2 * undef5)) = 1) /\ (undef4 > ~(1)) /\ (arg1 > 0)>
<l2, l3, (undef6 > ~(1)) /\ (arg2 > 1) /\ ((undef8 - (2 * undef9)) = 1) /\ (undef8 > ~(1)) /\ (arg1 > 0) /\ ((undef8 - (2 * undef9)) < 2) /\ ((undef8 - (2 * undef9)) >= 0), par{arg1 -> undef6, arg2 -> undef7}>
<l1, l2, (undef12 > ~(1)) /\ (arg2 > 1) /\ (undef13 > ~(1)) /\ ((undef13 - (2 * undef14)) = 0) /\ (arg1 > 0)>
<l2, l4, (undef17 > ~(1)) /\ (arg2 > 1) /\ (undef18 > ~(1)) /\ ((undef18 - (2 * undef19)) = 0) /\ (arg1 > 0) /\ ((undef18 - (2 * undef19)) < 2) /\ ((undef18 - (2 * undef19)) >= 0), par{arg1 -> (0 - undef17), arg2 -> undef16}>
<l3, l3, (0 = arg1), par{arg1 -> 0, arg2 -> undef21}>
<l3, l3, (arg1 > 0), par{arg1 -> (arg1 - 1), arg2 -> undef23}>
<l4, l3, (0 = arg1), par{arg1 -> 0, arg2 -> undef25}>
<l4, l4, (arg1 < 0), par{arg1 -> (arg1 + 1), arg2 -> undef27}>
<l5, l1, true, par{arg1 -> undef28, arg2 -> undef29}>

Fresh variables:
undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef12, undef13, undef14, undef16, undef17, undef18, undef19, undef21, undef23, undef25, undef27, undef28, undef29, 

Undef variables:
undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef12, undef13, undef14, undef16, undef17, undef18, undef19, undef21, undef23, undef25, undef27, undef28, undef29, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l3, (undef3 > ~(1)) /\ (undef29 > 1) /\ ((undef4 - (2 * undef5)) = 1) /\ (undef4 > ~(1)) /\ (undef28 > 0) /\ (undef6 > ~(1)) /\ (undef29 > 1) /\ ((undef8 - (2 * undef9)) = 1) /\ (undef8 > ~(1)) /\ (undef28 > 0) /\ ((undef8 - (2 * undef9)) < 2) /\ ((undef8 - (2 * undef9)) >= 0), par{arg1 -> undef6}>
<l0, l4, (undef3 > ~(1)) /\ (undef29 > 1) /\ ((undef4 - (2 * undef5)) = 1) /\ (undef4 > ~(1)) /\ (undef28 > 0) /\ (undef17 > ~(1)) /\ (undef29 > 1) /\ (undef18 > ~(1)) /\ ((undef18 - (2 * undef19)) = 0) /\ (undef28 > 0) /\ ((undef18 - (2 * undef19)) < 2) /\ ((undef18 - (2 * undef19)) >= 0), par{arg1 -> (0 - undef17)}>
<l0, l3, (undef12 > ~(1)) /\ (undef29 > 1) /\ (undef13 > ~(1)) /\ ((undef13 - (2 * undef14)) = 0) /\ (undef28 > 0) /\ (undef6 > ~(1)) /\ (undef29 > 1) /\ ((undef8 - (2 * undef9)) = 1) /\ (undef8 > ~(1)) /\ (undef28 > 0) /\ ((undef8 - (2 * undef9)) < 2) /\ ((undef8 - (2 * undef9)) >= 0), par{arg1 -> undef6}>
<l0, l4, (undef12 > ~(1)) /\ (undef29 > 1) /\ (undef13 > ~(1)) /\ ((undef13 - (2 * undef14)) = 0) /\ (undef28 > 0) /\ (undef17 > ~(1)) /\ (undef29 > 1) /\ (undef18 > ~(1)) /\ ((undef18 - (2 * undef19)) = 0) /\ (undef28 > 0) /\ ((undef18 - (2 * undef19)) < 2) /\ ((undef18 - (2 * undef19)) >= 0), par{arg1 -> (0 - undef17)}>
<l3, l3, (0 = arg1), par{arg1 -> 0}>
<l3, l3, (arg1 > 0), par{arg1 -> (arg1 - 1)}>
<l4, l3, (0 = arg1), par{arg1 -> 0}>
<l4, l4, (arg1 < 0), par{arg1 -> (arg1 + 1)}>

Fresh variables:
undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef12, undef13, undef14, undef16, undef17, undef18, undef19, undef21, undef23, undef25, undef27, undef28, undef29, 

Undef variables:
undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef12, undef13, undef14, undef16, undef17, undef18, undef19, undef21, undef23, undef25, undef27, undef28, undef29, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

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

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

Precedence: 
Graph 0

Graph 1
<l0, l4, 1 <= undef28 /\ 2 <= undef29 /\ 0 <= undef3 /\ 0 <= undef4 /\ 0 <= undef17 /\ 0 <= undef18 /\ undef4 = 1 + 2*undef5 /\ undef18 = 2*undef19, {arg1 -> -undef17, rest remain the same}>
<l0, l4, 1 <= undef28 /\ 2 <= undef29 /\ 0 <= undef12 /\ 0 <= undef13 /\ 0 <= undef17 /\ 0 <= undef18 /\ undef13 = 2*undef14 /\ undef18 = 2*undef19, {arg1 -> -undef17, rest remain the same}>

Graph 2
<l0, l3, 1 <= undef28 /\ 2 <= undef29 /\ 0 <= undef3 /\ 0 <= undef4 /\ 0 <= undef6 /\ 0 <= undef8 /\ undef4 = 1 + 2*undef5 /\ undef8 = 1 + 2*undef9, {arg1 -> undef6, rest remain the same}>
<l0, l3, 1 <= undef28 /\ 2 <= undef29 /\ 0 <= undef6 /\ 0 <= undef8 /\ 0 <= undef12 /\ 0 <= undef13 /\ undef8 = 1 + 2*undef9 /\ undef13 = 2*undef14, {arg1 -> undef6, rest remain the same}>
<l4, l3, arg1 = 0, {arg1 -> 0, rest remain the same}>

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

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

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

Checking conditional termination of SCC {l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000680s
Ranking function: -1 - arg1
New Graphs: 
Proving termination of subgraph 2
Checking unfeasibility...
Time used: 0.00321

Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000839s
Ranking function: -1 + arg1
New Graphs: 
Transitions:
<l3, l3, arg1 = 0, {arg1 -> 0, rest remain the same}>
Variables:
arg1
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000337s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000850s
[55373 : 55374]
[55373 : 55375]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005048s
Time used: 0.004829
Termination failed. Trying to show unreachability...
Proving unreachability of entry: <l0, l3, 1 <= undef28 /\ 2 <= undef29 /\ 0 <= undef3 /\ 0 <= undef4 /\ 0 <= undef6 /\ 0 <= undef8 /\ undef4 = 1 + 2*undef5 /\ undef8 = 1 + 2*undef9, {arg1 -> undef6, rest remain the same}>

LOG: CALL check - Post:1 <= 0 - Process 1
* Exit transition: <l0, l3, 1 <= undef28 /\ 2 <= undef29 /\ 0 <= undef3 /\ 0 <= undef4 /\ 0 <= undef6 /\ 0 <= undef8 /\ undef4 = 1 + 2*undef5 /\ undef8 = 1 + 2*undef9, {arg1 -> undef6, rest remain the same}>
* Postcondition  : 1 <= 0

LOG: CALL solveLinear

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

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

[55373 : 55379]
[55373 : 55383]
Successful child: 55379

Program does NOT terminate