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


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


YES

Solver Timeout: 4
Global Timeout: 300
Maximum number of concurrent processes: 900
No parsing errors!
Init Location: 0
Transitions:
<l0, l35, true>
<l1, l2, ((1 + jrev21^0) <= 0) /\ (undef31 = undef31), par{tmp223^0 -> undef31}>
<l1, l2, (0 <= (0 + jrev21^0)), par{tmp223^0 -> (0 + cword25^0)}>
<l3, l4, (undef72 = undef72), par{cword25^0 -> undef72, j24^0 -> (1 + j24^0)}>
<l5, l3, (0 <= (0 + jrev21^0)) /\ (undef125 = undef125), par{tmp122^0 -> undef125}>
<l5, l3, ((1 + jrev21^0) <= 0) /\ (undef157 = undef157), par{tmp122^0 -> undef157}>
<l6, l1, ((1 + len19^0) <= (0 + j24^0))>
<l6, l5, ((0 + j24^0) <= (0 + len19^0))>
<l7, l8, (0 <= (0 + jrev21^0))>
<l7, l8, ((1 + jrev21^0) <= 0) /\ (undef264 = undef264), par{cword25^0 -> undef264}>
<l8, l4, true, par{j24^0 -> 1}>
<l9, l7, ((1 + jinit20^0) <= 0)>
<l9, l8, (0 <= (0 + jinit20^0)) /\ (undef360 = undef360), par{cword25^0 -> undef360}>
<l10, l11, true, par{i1128^0 -> (1 + i1128^0)}>
<l12, l10, (undef418 = undef418), par{ans1229^0 -> undef418}>
<l12, l10, (undef481 = undef481) /\ (undef450 = undef450), par{ans1229^0 -> undef450}>
<l13, l14, (8 <= (0 + i1128^0)), par{j24^0 -> (1 + j24^0), ret_icrc11330^0 -> (0 + ans1229^0)}>
<l13, l12, ((1 + i1128^0) <= 8)>
<l15, l16, true>
<l17, l9, (256 <= (0 + j24^0))>
<l17, l11, ((0 + j24^0) <= 255) /\ (undef615 = undef615) /\ (undef611 = undef611), par{ans1229^0 -> undef611, crc926^0 -> undef615, i1128^0 -> 0, onech1027^0 -> 0}>
<l18, l9, (1 <= (0 + init^0))>
<l18, l9, ((1 + init^0) <= 0)>
<l18, l14, ((0 + init^0) <= 0) /\ (0 <= (0 + init^0)), par{init^0 -> 1, j24^0 -> 0}>
<l19, l20, true>
<l21, l18, (undef796 = (0 + tmp29^0)) /\ (undef780 = (0 + undef796)) /\ (undef772 = (0 + undef780)), par{crc18^0 -> undef772, cword25^0 -> (0 + undef772), i1^0 -> undef780, jinit20^0 -> 0, jrev21^0 -> 1, len19^0 -> (2 + n^0), ret_icrc17^0 -> undef796}>
<l22, l23, true>
<l24, l21, ((1 + jrev7^0) <= 0) /\ (undef865 = undef865), par{tmp29^0 -> undef865}>
<l24, l21, (0 <= (0 + jrev7^0)), par{tmp29^0 -> (0 + cword11^0)}>
<l25, l22, (undef904 = undef904), par{cword11^0 -> undef904, j10^0 -> (1 + j10^0)}>
<l26, l25, (0 <= (0 + jrev7^0)) /\ (undef959 = undef959), par{tmp18^0 -> undef959}>
<l26, l25, ((1 + jrev7^0) <= 0) /\ (undef991 = undef991), par{tmp18^0 -> undef991}>
<l23, l24, ((1 + len5^0) <= (0 + j10^0))>
<l23, l26, ((0 + j10^0) <= (0 + len5^0))>
<l27, l28, (0 <= (0 + jrev7^0))>
<l27, l28, ((1 + jrev7^0) <= 0) /\ (undef1096 = undef1096), par{cword11^0 -> undef1096}>
<l14, l17, true>
<l28, l22, true, par{j10^0 -> 1}>
<l29, l27, ((1 + jinit6^0) <= 0)>
<l29, l28, (0 <= (0 + jinit6^0)) /\ (undef1224 = undef1224), par{cword11^0 -> undef1224}>
<l11, l13, true>
<l30, l19, true, par{i1114^0 -> (1 + i1114^0)}>
<l31, l30, (undef1314 = undef1314), par{ans1215^0 -> undef1314}>
<l31, l30, (undef1378 = undef1378) /\ (undef1346 = undef1346), par{ans1215^0 -> undef1346}>
<l20, l15, (8 <= (0 + i1114^0)), par{j10^0 -> (1 + j10^0), ret_icrc11316^0 -> (0 + ans1215^0)}>
<l20, l31, ((1 + i1114^0) <= 8)>
<l4, l6, true>
<l16, l29, (256 <= (0 + j10^0))>
<l16, l19, ((0 + j10^0) <= 255) /\ (undef1511 = undef1511) /\ (undef1507 = undef1507), par{ans1215^0 -> undef1507, crc912^0 -> undef1511, i1114^0 -> 0, onech1013^0 -> 0}>
<l32, l29, (1 <= (0 + init^0))>
<l32, l29, ((1 + init^0) <= 0)>
<l32, l15, ((0 + init^0) <= 0) /\ (0 <= (0 + init^0)), par{init^0 -> 1, j10^0 -> 0}>
<l2, l33, (undef1662 = (0 + tmp223^0)), par{i2^0 -> (0 + undef1662), ret_icrc31^0 -> undef1662}>
<l34, l32, (undef1688 = 40) /\ (undef1670 = 0), par{crc4^0 -> undef1670, cword11^0 -> (0 + undef1670), jinit6^0 -> 0, jrev7^0 -> 1, len5^0 -> (0 + undef1688), n^0 -> undef1688}>
<l35, l34, true>

Fresh variables:
undef31, undef72, undef125, undef157, undef264, undef360, undef418, undef450, undef481, undef611, undef615, undef772, undef780, undef796, undef865, undef904, undef959, undef991, undef1096, undef1224, undef1314, undef1346, undef1378, undef1507, undef1511, undef1662, undef1670, undef1688, 

Undef variables:
undef31, undef72, undef125, undef157, undef264, undef360, undef418, undef450, undef481, undef611, undef615, undef772, undef780, undef796, undef865, undef904, undef959, undef991, undef1096, undef1224, undef1314, undef1346, undef1378, undef1507, undef1511, undef1662, undef1670, undef1688, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l22, (0 = 0) /\ (1 = 1) /\ (len5^0 = (0 + undef1688)) /\ (n^0 = undef1688) /\ (undef1688 = 40) /\ (undef1670 = 0) /\ (1 <= (0 + init^0)) /\ (0 <= (0 + 0)) /\ (undef1224 = undef1224), par{cword11^0 -> undef1224, j10^0 -> 1}>
<l0, l22, (0 = 0) /\ (1 = 1) /\ (len5^0 = (0 + undef1688)) /\ (n^0 = undef1688) /\ (undef1688 = 40) /\ (undef1670 = 0) /\ ((1 + init^0) <= 0) /\ (0 <= (0 + 0)) /\ (undef1224 = undef1224), par{cword11^0 -> undef1224, j10^0 -> 1}>
<l0, l19, (0 = 0) /\ (1 = 1) /\ (len5^0 = (0 + undef1688)) /\ (n^0 = undef1688) /\ (undef1688 = 40) /\ (undef1670 = 0) /\ ((0 + init^0) <= 0) /\ (0 <= (0 + init^0)) /\ ((0 + 0) <= 255) /\ (undef1511 = undef1511) /\ (undef1507 = undef1507), par{ans1215^0 -> undef1507, cword11^0 -> (0 + undef1670), i1114^0 -> 0, init^0 -> 1, j10^0 -> 0}>
<l4, l33, ((1 + len19^0) <= (0 + j24^0)) /\ ((1 + jrev21^0) <= 0) /\ (undef31 = undef31) /\ (undef1662 = (0 + undef31))>
<l4, l33, ((1 + len19^0) <= (0 + j24^0)) /\ (0 <= (0 + jrev21^0)) /\ (undef1662 = (0 + (0 + cword25^0)))>
<l4, l4, ((0 + j24^0) <= (0 + len19^0)) /\ (0 <= (0 + jrev21^0)) /\ (undef125 = undef125) /\ (undef72 = undef72), par{cword25^0 -> undef72, j24^0 -> (1 + j24^0)}>
<l4, l4, ((0 + j24^0) <= (0 + len19^0)) /\ ((1 + jrev21^0) <= 0) /\ (undef157 = undef157) /\ (undef72 = undef72), par{cword25^0 -> undef72, j24^0 -> (1 + j24^0)}>
<l11, l4, (8 <= (0 + i1128^0)) /\ (256 <= (0 + (1 + j24^0))) /\ ((1 + jinit20^0) <= 0) /\ (0 <= (0 + jrev21^0)), par{j24^0 -> 1}>
<l11, l4, (8 <= (0 + i1128^0)) /\ (256 <= (0 + (1 + j24^0))) /\ ((1 + jinit20^0) <= 0) /\ ((1 + jrev21^0) <= 0) /\ (undef264 = undef264), par{cword25^0 -> undef264, j24^0 -> 1}>
<l11, l4, (8 <= (0 + i1128^0)) /\ (256 <= (0 + (1 + j24^0))) /\ (0 <= (0 + jinit20^0)) /\ (undef360 = undef360), par{cword25^0 -> undef360, j24^0 -> 1}>
<l11, l11, (8 <= (0 + i1128^0)) /\ ((0 + (1 + j24^0)) <= 255) /\ (undef615 = undef615) /\ (undef611 = undef611), par{ans1229^0 -> undef611, i1128^0 -> 0, j24^0 -> (1 + j24^0)}>
<l11, l11, ((1 + i1128^0) <= 8) /\ (undef418 = undef418), par{ans1229^0 -> undef418, i1128^0 -> (1 + i1128^0)}>
<l11, l11, ((1 + i1128^0) <= 8) /\ (undef481 = undef481) /\ (undef450 = undef450), par{ans1229^0 -> undef450, i1128^0 -> (1 + i1128^0)}>
<l19, l22, (8 <= (0 + i1114^0)) /\ (256 <= (0 + (1 + j10^0))) /\ (0 <= (0 + 0)) /\ (undef1224 = undef1224), par{cword11^0 -> undef1224, j10^0 -> 1}>
<l19, l19, (8 <= (0 + i1114^0)) /\ ((0 + (1 + j10^0)) <= 255) /\ (undef1511 = undef1511) /\ (undef1507 = undef1507), par{ans1215^0 -> undef1507, i1114^0 -> 0, j10^0 -> (1 + j10^0)}>
<l19, l19, ((1 + i1114^0) <= 8) /\ (undef1314 = undef1314), par{ans1215^0 -> undef1314, i1114^0 -> (1 + i1114^0)}>
<l19, l19, ((1 + i1114^0) <= 8) /\ (undef1378 = undef1378) /\ (undef1346 = undef1346), par{ans1215^0 -> undef1346, i1114^0 -> (1 + i1114^0)}>
<l22, l4, ((1 + len5^0) <= (0 + j10^0)) /\ (0 <= (0 + 1)) /\ (undef796 = (0 + (0 + cword11^0))) /\ (undef780 = (0 + undef796)) /\ (undef772 = (0 + undef780)) /\ (1 <= (0 + init^0)) /\ (0 <= (0 + 0)) /\ (undef360 = undef360), par{cword25^0 -> undef360, j24^0 -> 1, jinit20^0 -> 0, jrev21^0 -> 1, len19^0 -> (2 + n^0)}>
<l22, l4, ((1 + len5^0) <= (0 + j10^0)) /\ (0 <= (0 + 1)) /\ (undef796 = (0 + (0 + cword11^0))) /\ (undef780 = (0 + undef796)) /\ (undef772 = (0 + undef780)) /\ ((1 + init^0) <= 0) /\ (0 <= (0 + 0)) /\ (undef360 = undef360), par{cword25^0 -> undef360, j24^0 -> 1, jinit20^0 -> 0, jrev21^0 -> 1, len19^0 -> (2 + n^0)}>
<l22, l11, ((1 + len5^0) <= (0 + j10^0)) /\ (0 <= (0 + 1)) /\ (undef796 = (0 + (0 + cword11^0))) /\ (undef780 = (0 + undef796)) /\ (undef772 = (0 + undef780)) /\ ((0 + init^0) <= 0) /\ (0 <= (0 + init^0)) /\ ((0 + 0) <= 255) /\ (undef615 = undef615) /\ (undef611 = undef611), par{ans1229^0 -> undef611, cword25^0 -> (0 + undef772), i1128^0 -> 0, init^0 -> 1, j24^0 -> 0, jinit20^0 -> 0, jrev21^0 -> 1, len19^0 -> (2 + n^0)}>
<l22, l22, ((0 + j10^0) <= (0 + len5^0)) /\ (0 <= (0 + 1)) /\ (undef959 = undef959) /\ (undef904 = undef904), par{cword11^0 -> undef904, j10^0 -> (1 + j10^0)}>

Fresh variables:
undef31, undef72, undef125, undef157, undef264, undef360, undef418, undef450, undef481, undef611, undef615, undef772, undef780, undef796, undef865, undef904, undef959, undef991, undef1096, undef1224, undef1314, undef1346, undef1378, undef1507, undef1511, undef1662, undef1670, undef1688, 

Undef variables:
undef31, undef72, undef125, undef157, undef264, undef360, undef418, undef450, undef481, undef611, undef615, undef772, undef780, undef796, undef865, undef904, undef959, undef991, undef1096, undef1224, undef1314, undef1346, undef1378, undef1507, undef1511, undef1662, undef1670, undef1688, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l19, l19, 8 <= i1114^0 /\ j10^0 <= 254, {ans1215^0 -> undef1507, i1114^0 -> 0, j10^0 -> 1 + j10^0, rest remain the same}>
<l19, l19, i1114^0 <= 7, {ans1215^0 -> undef1314, i1114^0 -> 1 + i1114^0, rest remain the same}>
<l19, l19, i1114^0 <= 7, {ans1215^0 -> undef1346, i1114^0 -> 1 + i1114^0, rest remain the same}>
Variables:
ans1215^0, i1114^0, j10^0

Graph 2:
Transitions:
<l22, l22, j10^0 <= len5^0, {cword11^0 -> undef904, j10^0 -> 1 + j10^0, rest remain the same}>
Variables:
cword11^0, j10^0, len5^0

Graph 3:
Transitions:
<l11, l11, 8 <= i1128^0 /\ j24^0 <= 254, {ans1229^0 -> undef611, i1128^0 -> 0, j24^0 -> 1 + j24^0, rest remain the same}>
<l11, l11, i1128^0 <= 7, {ans1229^0 -> undef418, i1128^0 -> 1 + i1128^0, rest remain the same}>
<l11, l11, i1128^0 <= 7, {ans1229^0 -> undef450, i1128^0 -> 1 + i1128^0, rest remain the same}>
Variables:
ans1229^0, i1128^0, j24^0

Graph 4:
Transitions:
<l4, l4, j24^0 <= len19^0 /\ 0 <= jrev21^0, {cword25^0 -> undef72, j24^0 -> 1 + j24^0, rest remain the same}>
<l4, l4, 1 + jrev21^0 <= 0 /\ j24^0 <= len19^0, {cword25^0 -> undef72, j24^0 -> 1 + j24^0, rest remain the same}>
Variables:
cword25^0, j24^0, jrev21^0, len19^0

Graph 5:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l19, init^0 = 0 /\ len5^0 = undef1688 /\ n^0 = undef1688 /\ undef1670 = 0 /\ undef1688 = 40, {ans1215^0 -> undef1507, cword11^0 -> undef1670, i1114^0 -> 0, init^0 -> 1, j10^0 -> 0, rest remain the same}>

Graph 2
<l0, l22, 1 <= init^0 /\ len5^0 = undef1688 /\ n^0 = undef1688 /\ undef1670 = 0 /\ undef1688 = 40, {cword11^0 -> undef1224, j10^0 -> 1, rest remain the same}>
<l0, l22, 1 + init^0 <= 0 /\ len5^0 = undef1688 /\ n^0 = undef1688 /\ undef1670 = 0 /\ undef1688 = 40, {cword11^0 -> undef1224, j10^0 -> 1, rest remain the same}>
<l19, l22, 8 <= i1114^0 /\ 255 <= j10^0, {cword11^0 -> undef1224, j10^0 -> 1, rest remain the same}>

Graph 3
<l22, l11, 1 + len5^0 <= j10^0 /\ cword11^0 = undef796 /\ init^0 = 0 /\ undef772 = undef780 /\ undef780 = undef796, {ans1229^0 -> undef611, cword25^0 -> undef772, i1128^0 -> 0, init^0 -> 1, j24^0 -> 0, jinit20^0 -> 0, jrev21^0 -> 1, len19^0 -> 2 + n^0, rest remain the same}>

Graph 4
<l11, l4, 1 + jinit20^0 <= 0 /\ 0 <= jrev21^0 /\ 8 <= i1128^0 /\ 255 <= j24^0, {j24^0 -> 1, rest remain the same}>
<l11, l4, 1 + jinit20^0 <= 0 /\ 1 + jrev21^0 <= 0 /\ 8 <= i1128^0 /\ 255 <= j24^0, {cword25^0 -> undef264, j24^0 -> 1, rest remain the same}>
<l11, l4, 0 <= jinit20^0 /\ 8 <= i1128^0 /\ 255 <= j24^0, {cword25^0 -> undef360, j24^0 -> 1, rest remain the same}>
<l22, l4, 1 <= init^0 /\ 1 + len5^0 <= j10^0 /\ cword11^0 = undef796 /\ undef772 = undef780 /\ undef780 = undef796, {cword25^0 -> undef360, j24^0 -> 1, jinit20^0 -> 0, jrev21^0 -> 1, len19^0 -> 2 + n^0, rest remain the same}>
<l22, l4, 1 + init^0 <= 0 /\ 1 + len5^0 <= j10^0 /\ cword11^0 = undef796 /\ undef772 = undef780 /\ undef780 = undef796, {cword25^0 -> undef360, j24^0 -> 1, jinit20^0 -> 0, jrev21^0 -> 1, len19^0 -> 2 + n^0, rest remain the same}>

Graph 5
<l4, l33, 1 + len19^0 <= j24^0 /\ 1 + jrev21^0 <= 0 /\ undef31 = undef1662, {all remain the same}>
<l4, l33, 1 + len19^0 <= j24^0 /\ 0 <= jrev21^0 /\ cword25^0 = undef1662, {all remain the same}>

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

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

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

Checking conditional termination of SCC {l19}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002796s
Ranking function: 254 - j10^0
New Graphs: 
Transitions:
<l19, l19, i1114^0 <= 7, {ans1215^0 -> undef1314, i1114^0 -> 1 + i1114^0, rest remain the same}>
<l19, l19, i1114^0 <= 7, {ans1215^0 -> undef1346, i1114^0 -> 1 + i1114^0, rest remain the same}>
Variables:
ans1215^0, i1114^0
Checking conditional termination of SCC {l19}...

LOG: CALL solveLinear

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

Checking conditional termination of SCC {l22}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001931s
Ranking function: -j10^0 + len5^0
New Graphs: 
Proving termination of subgraph 3
Checking unfeasibility...
Time used: 0.018296

Checking conditional termination of SCC {l11}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002739s
Ranking function: 254 - j24^0
New Graphs: 
Transitions:
<l11, l11, i1128^0 <= 7, {ans1229^0 -> undef418, i1128^0 -> 1 + i1128^0, rest remain the same}>
<l11, l11, i1128^0 <= 7, {ans1229^0 -> undef450, i1128^0 -> 1 + i1128^0, rest remain the same}>
Variables:
ans1229^0, i1128^0
Checking conditional termination of SCC {l11}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001554s
Ranking function: 7 - i1128^0
New Graphs: 
Proving termination of subgraph 4
Checking unfeasibility...
Time used: 0.006518

Checking conditional termination of SCC {l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003219s
Ranking function: -2 - j24^0 - 2*jrev21^0 + len19^0
New Graphs: 
Transitions:
<l4, l4, j24^0 <= len19^0 /\ 0 <= jrev21^0, {cword25^0 -> undef72, j24^0 -> 1 + j24^0, rest remain the same}>
Variables:
cword25^0, j24^0, jrev21^0, len19^0
Checking conditional termination of SCC {l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001805s
Ranking function: -j24^0 + len19^0
New Graphs: 
Proving termination of subgraph 5
Analyzing SCC {l33}...
No cycles found.

Program Terminates