/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, l7, true>
<l1, l2, (8 <= (0 + i20^0)), par{i20^0 -> 0}>
<l1, l3, ((1 + i20^0) <= 8) /\ (undef24 = undef24) /\ (undef55 = undef55) /\ (undef29 = undef29) /\ (undef54 = undef54) /\ (undef30 = undef30) /\ (undef53 = undef53) /\ (undef31 = undef31) /\ (undef52 = undef52) /\ (undef41 = 4433) /\ (undef56 = undef56) /\ (undef44 = 6270) /\ (undef45 = ~(15137)) /\ (undef57 = ((0 + undef52) + undef55)) /\ (undef58 = ((0 + undef53) + undef54)) /\ (undef59 = ((0 + undef52) + undef54)) /\ (undef61 = ((0 + undef53) + undef55)) /\ (undef46 = 9633) /\ (undef40 = undef40) /\ (undef47 = 2446) /\ (undef32 = undef32) /\ (undef48 = 16819) /\ (undef33 = undef33) /\ (undef49 = 25172) /\ (undef34 = undef34) /\ (undef50 = 12299) /\ (undef35 = undef35) /\ (undef51 = ~(7373)) /\ (undef36 = undef36) /\ (undef42 = ~(20995)) /\ (undef37 = undef37) /\ (undef43 = ~(16069)) /\ (undef60 = undef60) /\ (undef62 = undef62), par{constant22^0 -> ~(3196), i20^0 -> (1 + i20^0), tmp03^0 -> undef24, tmp1011^0 -> ((0 + undef24) + undef31), tmp1112^0 -> ((0 + undef29) + undef30), tmp1213^0 -> ((0 + undef29) + (~(1) * undef30)), tmp1314^0 -> ((0 + undef24) + (~(1) * undef31)), tmp14^0 -> undef29, tmp25^0 -> undef30, tmp36^0 -> undef31, tmp47^0 -> undef32, tmp58^0 -> undef33, tmp69^0 -> undef34, tmp710^0 -> undef35, z115^0 -> undef36, z216^0 -> undef37, z317^0 -> ((0 + undef60) + undef40), z418^0 -> ((0 + undef62) + undef40), z519^0 -> undef40}>
<l4, l5, (8 <= (0 + i20^0))>
<l4, l2, ((1 + i20^0) <= 8) /\ (undef86 = undef86) /\ (undef117 = undef117) /\ (undef91 = undef91) /\ (undef116 = undef116) /\ (undef92 = undef92) /\ (undef115 = undef115) /\ (undef93 = undef93) /\ (undef114 = undef114) /\ (undef103 = 4433) /\ (undef118 = undef118) /\ (undef106 = 6270) /\ (undef107 = ~(15137)) /\ (undef119 = ((0 + undef114) + undef117)) /\ (undef120 = ((0 + undef115) + undef116)) /\ (undef121 = ((0 + undef114) + undef116)) /\ (undef123 = ((0 + undef115) + undef117)) /\ (undef108 = 9633) /\ (undef102 = undef102) /\ (undef109 = 2446) /\ (undef94 = undef94) /\ (undef110 = 16819) /\ (undef95 = undef95) /\ (undef111 = 25172) /\ (undef96 = undef96) /\ (undef112 = 12299) /\ (undef97 = undef97) /\ (undef113 = ~(7373)) /\ (undef98 = undef98) /\ (undef104 = ~(20995)) /\ (undef99 = undef99) /\ (undef105 = ~(16069)) /\ (undef122 = undef122) /\ (undef124 = undef124), par{constant22^0 -> ~(3196), i20^0 -> (1 + i20^0), tmp03^0 -> undef86, tmp1011^0 -> ((0 + undef86) + undef93), tmp1112^0 -> ((0 + undef91) + undef92), tmp1213^0 -> ((0 + undef91) + (~(1) * undef92)), tmp1314^0 -> ((0 + undef86) + (~(1) * undef93)), tmp14^0 -> undef91, tmp25^0 -> undef92, tmp36^0 -> undef93, tmp47^0 -> undef94, tmp58^0 -> undef95, tmp69^0 -> undef96, tmp710^0 -> undef97, z115^0 -> undef98, z216^0 -> undef99, z317^0 -> ((0 + undef122) + undef102), z418^0 -> ((0 + undef124) + undef102), z519^0 -> undef102}>
<l3, l1, true>
<l2, l4, true>
<l6, l3, true, par{i20^0 -> 0, lx2^0 -> 8}>
<l7, l6, true>

Fresh variables:
undef24, undef29, undef30, undef31, undef32, undef33, undef34, undef35, undef36, undef37, undef40, undef41, undef42, undef43, undef44, undef45, undef46, undef47, undef48, undef49, undef50, undef51, undef52, undef53, undef54, undef55, undef56, undef57, undef58, undef59, undef60, undef61, undef62, undef86, undef91, undef92, undef93, undef94, undef95, undef96, undef97, undef98, undef99, undef102, undef103, undef104, undef105, undef106, undef107, undef108, undef109, undef110, undef111, undef112, undef113, undef114, undef115, undef116, undef117, undef118, undef119, undef120, undef121, undef122, undef123, undef124, 

Undef variables:
undef24, undef29, undef30, undef31, undef32, undef33, undef34, undef35, undef36, undef37, undef40, undef41, undef42, undef43, undef44, undef45, undef46, undef47, undef48, undef49, undef50, undef51, undef52, undef53, undef54, undef55, undef56, undef57, undef58, undef59, undef60, undef61, undef62, undef86, undef91, undef92, undef93, undef94, undef95, undef96, undef97, undef98, undef99, undef102, undef103, undef104, undef105, undef106, undef107, undef108, undef109, undef110, undef111, undef112, undef113, undef114, undef115, undef116, undef117, undef118, undef119, undef120, undef121, undef122, undef123, undef124, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l3, (i20^0 = 0)>
<l2, l5, (8 <= (0 + i20^0))>
<l2, l2, ((1 + i20^0) <= 8) /\ (undef86 = undef86) /\ (undef117 = undef117) /\ (undef91 = undef91) /\ (undef116 = undef116) /\ (undef92 = undef92) /\ (undef115 = undef115) /\ (undef93 = undef93) /\ (undef114 = undef114) /\ (undef103 = 4433) /\ (undef118 = undef118) /\ (undef106 = 6270) /\ (undef107 = ~(15137)) /\ (undef119 = ((0 + undef114) + undef117)) /\ (undef120 = ((0 + undef115) + undef116)) /\ (undef121 = ((0 + undef114) + undef116)) /\ (undef123 = ((0 + undef115) + undef117)) /\ (undef108 = 9633) /\ (undef102 = undef102) /\ (undef109 = 2446) /\ (undef94 = undef94) /\ (undef110 = 16819) /\ (undef95 = undef95) /\ (undef111 = 25172) /\ (undef96 = undef96) /\ (undef112 = 12299) /\ (undef97 = undef97) /\ (undef113 = ~(7373)) /\ (undef98 = undef98) /\ (undef104 = ~(20995)) /\ (undef99 = undef99) /\ (undef105 = ~(16069)) /\ (undef122 = undef122) /\ (undef124 = undef124), par{i20^0 -> (1 + i20^0)}>
<l3, l2, (8 <= (0 + i20^0)), par{i20^0 -> 0}>
<l3, l3, ((1 + i20^0) <= 8) /\ (undef24 = undef24) /\ (undef55 = undef55) /\ (undef29 = undef29) /\ (undef54 = undef54) /\ (undef30 = undef30) /\ (undef53 = undef53) /\ (undef31 = undef31) /\ (undef52 = undef52) /\ (undef41 = 4433) /\ (undef56 = undef56) /\ (undef44 = 6270) /\ (undef45 = ~(15137)) /\ (undef57 = ((0 + undef52) + undef55)) /\ (undef58 = ((0 + undef53) + undef54)) /\ (undef59 = ((0 + undef52) + undef54)) /\ (undef61 = ((0 + undef53) + undef55)) /\ (undef46 = 9633) /\ (undef40 = undef40) /\ (undef47 = 2446) /\ (undef32 = undef32) /\ (undef48 = 16819) /\ (undef33 = undef33) /\ (undef49 = 25172) /\ (undef34 = undef34) /\ (undef50 = 12299) /\ (undef35 = undef35) /\ (undef51 = ~(7373)) /\ (undef36 = undef36) /\ (undef42 = ~(20995)) /\ (undef37 = undef37) /\ (undef43 = ~(16069)) /\ (undef60 = undef60) /\ (undef62 = undef62), par{i20^0 -> (1 + i20^0)}>

Fresh variables:
undef24, undef29, undef30, undef31, undef32, undef33, undef34, undef35, undef36, undef37, undef40, undef41, undef42, undef43, undef44, undef45, undef46, undef47, undef48, undef49, undef50, undef51, undef52, undef53, undef54, undef55, undef56, undef57, undef58, undef59, undef60, undef61, undef62, undef86, undef91, undef92, undef93, undef94, undef95, undef96, undef97, undef98, undef99, undef102, undef103, undef104, undef105, undef106, undef107, undef108, undef109, undef110, undef111, undef112, undef113, undef114, undef115, undef116, undef117, undef118, undef119, undef120, undef121, undef122, undef123, undef124, 

Undef variables:
undef24, undef29, undef30, undef31, undef32, undef33, undef34, undef35, undef36, undef37, undef40, undef41, undef42, undef43, undef44, undef45, undef46, undef47, undef48, undef49, undef50, undef51, undef52, undef53, undef54, undef55, undef56, undef57, undef58, undef59, undef60, undef61, undef62, undef86, undef91, undef92, undef93, undef94, undef95, undef96, undef97, undef98, undef99, undef102, undef103, undef104, undef105, undef106, undef107, undef108, undef109, undef110, undef111, undef112, undef113, undef114, undef115, undef116, undef117, undef118, undef119, undef120, undef121, undef122, undef123, undef124, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l3, l3, i20^0 <= 7 /\ undef52 + undef54 = undef59 /\ undef52 + undef55 = undef57 /\ undef53 + undef54 = undef58 /\ undef53 + undef55 = undef61 /\ 15137 + undef45 = 0 /\ 7373 + undef51 = 0 /\ 20995 + undef42 = 0 /\ 16069 + undef43 = 0 /\ undef41 = 4433 /\ undef44 = 6270 /\ undef46 = 9633 /\ undef47 = 2446 /\ undef48 = 16819 /\ undef49 = 25172 /\ undef50 = 12299, {i20^0 -> 1 + i20^0, rest remain the same}>
Variables:
i20^0

Graph 2:
Transitions:
<l2, l2, i20^0 <= 7 /\ undef114 + undef116 = undef121 /\ undef114 + undef117 = undef119 /\ undef115 + undef116 = undef120 /\ undef115 + undef117 = undef123 /\ 15137 + undef107 = 0 /\ 7373 + undef113 = 0 /\ 20995 + undef104 = 0 /\ 16069 + undef105 = 0 /\ undef103 = 4433 /\ undef106 = 6270 /\ undef108 = 9633 /\ undef109 = 2446 /\ undef110 = 16819 /\ undef111 = 25172 /\ undef112 = 12299, {i20^0 -> 1 + i20^0, rest remain the same}>
Variables:
i20^0

Graph 3:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l3, i20^0 = 0, {all remain the same}>

Graph 2
<l3, l2, 8 <= i20^0, {i20^0 -> 0, rest remain the same}>

Graph 3
<l2, l5, 8 <= i20^0, {all remain the same}>

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

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

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

Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001947s
Ranking function: 7 - i20^0
New Graphs: 
Proving termination of subgraph 2
Checking unfeasibility...
Time used: 0.002205

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001952s
Ranking function: 7 - i20^0
New Graphs: 
Proving termination of subgraph 3
Analyzing SCC {l5}...
No cycles found.

Program Terminates