/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, l12, true>
<l1, l2, (undef3 = undef3) /\ (undef4 = undef4), par{oldX0^0 -> (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> undef3, oldX3^0 -> undef4, x0^0 -> (0 + undef3), x1^0 -> (0 + undef4)}>
<l1, l3, (undef8 = (0 + x0^0)) /\ (undef9 = (0 + x1^0)), par{oldX0^0 -> undef8, oldX1^0 -> undef9, x0^0 -> (0 + undef8), x1^0 -> (~(1) + undef9)}>
<l4, l5, (undef15 = (0 + x0^0)) /\ (undef16 = (0 + x1^0)) /\ (undef17 = undef17) /\ (2 <= (0 + undef17)), par{oldX0^0 -> undef15, oldX1^0 -> undef16, oldX2^0 -> undef17, x0^0 -> (0 + undef15), x1^0 -> (0 + undef16)}>
<l4, l5, (undef22 = (0 + x0^0)) /\ (undef23 = (0 + x1^0)) /\ (undef24 = undef24) /\ ((1 + undef24) <= 1), par{oldX0^0 -> undef22, oldX1^0 -> undef23, oldX2^0 -> undef24, x0^0 -> (0 + undef22), x1^0 -> (0 + undef23)}>
<l4, l1, (undef29 = (0 + x0^0)) /\ (undef30 = (0 + x1^0)) /\ (undef31 = undef31) /\ ((0 + undef31) <= 1) /\ (1 <= (0 + undef31)), par{oldX0^0 -> undef29, oldX1^0 -> undef30, oldX2^0 -> undef31, x0^0 -> (0 + undef29), x1^0 -> (0 + undef30)}>
<l6, l2, (undef38 = undef38) /\ (undef39 = undef39), par{oldX0^0 -> (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> undef38, oldX3^0 -> undef39, x0^0 -> (0 + undef38), x1^0 -> (0 + undef39)}>
<l7, l4, (undef43 = (0 + x0^0)) /\ (undef44 = (0 + x1^0)) /\ (3 <= (0 + undef43)), par{oldX0^0 -> undef43, oldX1^0 -> undef44, x0^0 -> (0 + undef43), x1^0 -> (0 + undef44)}>
<l7, l4, (undef50 = (0 + x0^0)) /\ (undef51 = (0 + x1^0)) /\ ((1 + undef50) <= 2), par{oldX0^0 -> undef50, oldX1^0 -> undef51, x0^0 -> (0 + undef50), x1^0 -> (0 + undef51)}>
<l7, l6, (undef57 = (0 + x0^0)) /\ (undef58 = (0 + x1^0)) /\ ((0 + undef57) <= 2) /\ (2 <= (0 + undef57)), par{oldX0^0 -> undef57, oldX1^0 -> undef58, x0^0 -> (0 + undef57), x1^0 -> (0 + undef58)}>
<l8, l7, (undef64 = (0 + x0^0)) /\ (undef65 = (0 + x1^0)) /\ (2 <= (0 + undef65)), par{oldX0^0 -> undef64, oldX1^0 -> undef65, x0^0 -> (0 + undef64), x1^0 -> (0 + undef65)}>
<l8, l7, (undef71 = (0 + x0^0)) /\ (undef72 = (0 + x1^0)) /\ ((1 + undef72) <= 1), par{oldX0^0 -> undef71, oldX1^0 -> undef72, x0^0 -> (0 + undef71), x1^0 -> (0 + undef72)}>
<l8, l9, (undef78 = (0 + x0^0)) /\ (undef79 = (0 + x1^0)) /\ ((0 + undef79) <= 1) /\ (1 <= (0 + undef79)), par{oldX0^0 -> undef78, oldX1^0 -> undef79, x0^0 -> (0 + undef78), x1^0 -> (0 + undef79)}>
<l9, l2, (undef87 = undef87) /\ (undef88 = undef88), par{oldX0^0 -> (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> undef87, oldX3^0 -> undef88, x0^0 -> (0 + undef87), x1^0 -> (0 + undef88)}>
<l10, l8, (undef92 = (0 + x0^0)) /\ (undef93 = (0 + x1^0)) /\ (1 <= (0 + undef93)), par{oldX0^0 -> undef92, oldX1^0 -> undef93, x0^0 -> (0 + undef92), x1^0 -> (0 + undef93)}>
<l10, l9, (undef99 = (0 + x0^0)) /\ (undef100 = (0 + x1^0)) /\ ((0 + undef100) <= 0), par{oldX0^0 -> undef99, oldX1^0 -> undef100, x0^0 -> (0 + undef99), x1^0 -> (0 + undef100)}>
<l5, l2, (undef107 = (0 + x1^0)) /\ (undef108 = undef108) /\ (undef109 = undef109) /\ (undef110 = undef110) /\ (2 <= ((0 + undef107) + (~(2) * undef110))), par{oldX0^0 -> (0 + x0^0), oldX1^0 -> undef107, oldX2^0 -> undef108, oldX3^0 -> undef109, oldX4^0 -> undef110, x0^0 -> (0 + undef108), x1^0 -> (0 + undef109)}>
<l5, l2, (undef114 = (0 + x1^0)) /\ (undef115 = undef115) /\ (undef116 = undef116) /\ (undef117 = undef117) /\ (((1 + undef114) + (~(2) * undef117)) <= 0), par{oldX0^0 -> (0 + x0^0), oldX1^0 -> undef114, oldX2^0 -> undef115, oldX3^0 -> undef116, oldX4^0 -> undef117, x0^0 -> (0 + undef115), x1^0 -> (0 + undef116)}>
<l5, l2, (undef121 = (0 + x1^0)) /\ (undef122 = undef122) /\ (undef123 = undef123) /\ (undef124 = undef124) /\ (0 <= ((0 + undef121) + (~(2) * undef124))) /\ (((1 + undef121) + (~(2) * undef124)) <= 2), par{oldX0^0 -> (0 + x0^0), oldX1^0 -> undef121, oldX2^0 -> undef122, oldX3^0 -> undef123, oldX4^0 -> undef124, x0^0 -> (0 + undef122), x1^0 -> (0 + undef123)}>
<l5, l3, (undef127 = (0 + x0^0)) /\ (undef128 = (0 + x1^0)) /\ (undef129 = undef129) /\ (0 <= ((0 + undef128) + (~(2) * undef129))) /\ (((1 + undef128) + (~(2) * undef129)) <= 2), par{oldX0^0 -> undef127, oldX1^0 -> undef128, oldX2^0 -> undef129, x0^0 -> (0 + undef127), x1^0 -> (0 + undef129)}>
<l3, l10, (undef134 = (0 + x0^0)) /\ (undef135 = (0 + x1^0)), par{oldX0^0 -> undef134, oldX1^0 -> undef135, x0^0 -> (0 + undef134), x1^0 -> (0 + undef135)}>
<l11, l1, true>
<l11, l4, true>
<l11, l6, true>
<l11, l2, true>
<l11, l7, true>
<l11, l8, true>
<l11, l9, true>
<l11, l10, true>
<l11, l5, true>
<l11, l3, true>
<l12, l11, true>

Fresh variables:
undef3, undef4, undef8, undef9, undef15, undef16, undef17, undef22, undef23, undef24, undef29, undef30, undef31, undef38, undef39, undef43, undef44, undef50, undef51, undef57, undef58, undef64, undef65, undef71, undef72, undef78, undef79, undef87, undef88, undef92, undef93, undef99, undef100, undef107, undef108, undef109, undef110, undef114, undef115, undef116, undef117, undef121, undef122, undef123, undef124, undef127, undef128, undef129, undef134, undef135, 

Undef variables:
undef3, undef4, undef8, undef9, undef15, undef16, undef17, undef22, undef23, undef24, undef29, undef30, undef31, undef38, undef39, undef43, undef44, undef50, undef51, undef57, undef58, undef64, undef65, undef71, undef72, undef78, undef79, undef87, undef88, undef92, undef93, undef99, undef100, undef107, undef108, undef109, undef110, undef114, undef115, undef116, undef117, undef121, undef122, undef123, undef124, undef127, undef128, undef129, undef134, undef135, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (undef3 = undef3) /\ (undef4 = undef4), par{x0^0 -> (0 + undef3), x1^0 -> (0 + undef4)}>
<l0, l3, (undef8 = (0 + x0^0)) /\ (undef9 = (0 + x1^0)), par{x0^0 -> (0 + undef8), x1^0 -> (~(1) + undef9)}>
<l0, l4, true>
<l0, l2, (undef38 = undef38) /\ (undef39 = undef39), par{x0^0 -> (0 + undef38), x1^0 -> (0 + undef39)}>
<l0, l2, true>
<l0, l4, (undef43 = (0 + x0^0)) /\ (undef44 = (0 + x1^0)) /\ (3 <= (0 + undef43)), par{x0^0 -> (0 + undef43), x1^0 -> (0 + undef44)}>
<l0, l4, (undef50 = (0 + x0^0)) /\ (undef51 = (0 + x1^0)) /\ ((1 + undef50) <= 2), par{x0^0 -> (0 + undef50), x1^0 -> (0 + undef51)}>
<l0, l2, (undef57 = (0 + x0^0)) /\ (undef58 = (0 + x1^0)) /\ ((0 + undef57) <= 2) /\ (2 <= (0 + undef57)) /\ (undef38 = undef38) /\ (undef39 = undef39), par{x0^0 -> (0 + undef38), x1^0 -> (0 + undef39)}>
<l0, l8, true>
<l0, l2, (undef87 = undef87) /\ (undef88 = undef88), par{x0^0 -> (0 + undef87), x1^0 -> (0 + undef88)}>
<l0, l8, (undef92 = (0 + x0^0)) /\ (undef93 = (0 + x1^0)) /\ (1 <= (0 + undef93)), par{x0^0 -> (0 + undef92), x1^0 -> (0 + undef93)}>
<l0, l2, (undef99 = (0 + x0^0)) /\ (undef100 = (0 + x1^0)) /\ ((0 + undef100) <= 0) /\ (undef87 = undef87) /\ (undef88 = undef88), par{x0^0 -> (0 + undef87), x1^0 -> (0 + undef88)}>
<l0, l2, (undef107 = (0 + x1^0)) /\ (undef108 = undef108) /\ (undef109 = undef109) /\ (undef110 = undef110) /\ (2 <= ((0 + undef107) + (~(2) * undef110))), par{x0^0 -> (0 + undef108), x1^0 -> (0 + undef109)}>
<l0, l2, (undef114 = (0 + x1^0)) /\ (undef115 = undef115) /\ (undef116 = undef116) /\ (undef117 = undef117) /\ (((1 + undef114) + (~(2) * undef117)) <= 0), par{x0^0 -> (0 + undef115), x1^0 -> (0 + undef116)}>
<l0, l2, (undef121 = (0 + x1^0)) /\ (undef122 = undef122) /\ (undef123 = undef123) /\ (undef124 = undef124) /\ (0 <= ((0 + undef121) + (~(2) * undef124))) /\ (((1 + undef121) + (~(2) * undef124)) <= 2), par{x0^0 -> (0 + undef122), x1^0 -> (0 + undef123)}>
<l0, l3, (undef127 = (0 + x0^0)) /\ (undef128 = (0 + x1^0)) /\ (undef129 = undef129) /\ (0 <= ((0 + undef128) + (~(2) * undef129))) /\ (((1 + undef128) + (~(2) * undef129)) <= 2), par{x0^0 -> (0 + undef127), x1^0 -> (0 + undef129)}>
<l0, l3, true>
<l3, l8, (undef134 = (0 + x0^0)) /\ (undef135 = (0 + x1^0)) /\ (undef92 = (0 + (0 + undef134))) /\ (undef93 = (0 + (0 + undef135))) /\ (1 <= (0 + undef93)), par{x0^0 -> (0 + undef92), x1^0 -> (0 + undef93)}>
<l3, l2, (undef134 = (0 + x0^0)) /\ (undef135 = (0 + x1^0)) /\ (undef99 = (0 + (0 + undef134))) /\ (undef100 = (0 + (0 + undef135))) /\ ((0 + undef100) <= 0) /\ (undef87 = undef87) /\ (undef88 = undef88), par{x0^0 -> (0 + undef87), x1^0 -> (0 + undef88)}>
<l4, l2, (undef15 = (0 + x0^0)) /\ (undef16 = (0 + x1^0)) /\ (undef17 = undef17) /\ (2 <= (0 + undef17)) /\ (undef107 = (0 + (0 + undef16))) /\ (undef108 = undef108) /\ (undef109 = undef109) /\ (undef110 = undef110) /\ (2 <= ((0 + undef107) + (~(2) * undef110))), par{x0^0 -> (0 + undef108), x1^0 -> (0 + undef109)}>
<l4, l2, (undef15 = (0 + x0^0)) /\ (undef16 = (0 + x1^0)) /\ (undef17 = undef17) /\ (2 <= (0 + undef17)) /\ (undef114 = (0 + (0 + undef16))) /\ (undef115 = undef115) /\ (undef116 = undef116) /\ (undef117 = undef117) /\ (((1 + undef114) + (~(2) * undef117)) <= 0), par{x0^0 -> (0 + undef115), x1^0 -> (0 + undef116)}>
<l4, l2, (undef15 = (0 + x0^0)) /\ (undef16 = (0 + x1^0)) /\ (undef17 = undef17) /\ (2 <= (0 + undef17)) /\ (undef121 = (0 + (0 + undef16))) /\ (undef122 = undef122) /\ (undef123 = undef123) /\ (undef124 = undef124) /\ (0 <= ((0 + undef121) + (~(2) * undef124))) /\ (((1 + undef121) + (~(2) * undef124)) <= 2), par{x0^0 -> (0 + undef122), x1^0 -> (0 + undef123)}>
<l4, l3, (undef15 = (0 + x0^0)) /\ (undef16 = (0 + x1^0)) /\ (undef17 = undef17) /\ (2 <= (0 + undef17)) /\ (undef127 = (0 + (0 + undef15))) /\ (undef128 = (0 + (0 + undef16))) /\ (undef129 = undef129) /\ (0 <= ((0 + undef128) + (~(2) * undef129))) /\ (((1 + undef128) + (~(2) * undef129)) <= 2), par{x0^0 -> (0 + undef127), x1^0 -> (0 + undef129)}>
<l4, l2, (undef22 = (0 + x0^0)) /\ (undef23 = (0 + x1^0)) /\ (undef24 = undef24) /\ ((1 + undef24) <= 1) /\ (undef107 = (0 + (0 + undef23))) /\ (undef108 = undef108) /\ (undef109 = undef109) /\ (undef110 = undef110) /\ (2 <= ((0 + undef107) + (~(2) * undef110))), par{x0^0 -> (0 + undef108), x1^0 -> (0 + undef109)}>
<l4, l2, (undef22 = (0 + x0^0)) /\ (undef23 = (0 + x1^0)) /\ (undef24 = undef24) /\ ((1 + undef24) <= 1) /\ (undef114 = (0 + (0 + undef23))) /\ (undef115 = undef115) /\ (undef116 = undef116) /\ (undef117 = undef117) /\ (((1 + undef114) + (~(2) * undef117)) <= 0), par{x0^0 -> (0 + undef115), x1^0 -> (0 + undef116)}>
<l4, l2, (undef22 = (0 + x0^0)) /\ (undef23 = (0 + x1^0)) /\ (undef24 = undef24) /\ ((1 + undef24) <= 1) /\ (undef121 = (0 + (0 + undef23))) /\ (undef122 = undef122) /\ (undef123 = undef123) /\ (undef124 = undef124) /\ (0 <= ((0 + undef121) + (~(2) * undef124))) /\ (((1 + undef121) + (~(2) * undef124)) <= 2), par{x0^0 -> (0 + undef122), x1^0 -> (0 + undef123)}>
<l4, l3, (undef22 = (0 + x0^0)) /\ (undef23 = (0 + x1^0)) /\ (undef24 = undef24) /\ ((1 + undef24) <= 1) /\ (undef127 = (0 + (0 + undef22))) /\ (undef128 = (0 + (0 + undef23))) /\ (undef129 = undef129) /\ (0 <= ((0 + undef128) + (~(2) * undef129))) /\ (((1 + undef128) + (~(2) * undef129)) <= 2), par{x0^0 -> (0 + undef127), x1^0 -> (0 + undef129)}>
<l4, l2, (undef29 = (0 + x0^0)) /\ (undef30 = (0 + x1^0)) /\ (undef31 = undef31) /\ ((0 + undef31) <= 1) /\ (1 <= (0 + undef31)) /\ (undef3 = undef3) /\ (undef4 = undef4), par{x0^0 -> (0 + undef3), x1^0 -> (0 + undef4)}>
<l4, l3, (undef29 = (0 + x0^0)) /\ (undef30 = (0 + x1^0)) /\ (undef31 = undef31) /\ ((0 + undef31) <= 1) /\ (1 <= (0 + undef31)) /\ (undef8 = (0 + (0 + undef29))) /\ (undef9 = (0 + (0 + undef30))), par{x0^0 -> (0 + undef8), x1^0 -> (~(1) + undef9)}>
<l8, l4, (undef64 = (0 + x0^0)) /\ (undef65 = (0 + x1^0)) /\ (2 <= (0 + undef65)) /\ (undef43 = (0 + (0 + undef64))) /\ (undef44 = (0 + (0 + undef65))) /\ (3 <= (0 + undef43)), par{x0^0 -> (0 + undef43), x1^0 -> (0 + undef44)}>
<l8, l4, (undef64 = (0 + x0^0)) /\ (undef65 = (0 + x1^0)) /\ (2 <= (0 + undef65)) /\ (undef50 = (0 + (0 + undef64))) /\ (undef51 = (0 + (0 + undef65))) /\ ((1 + undef50) <= 2), par{x0^0 -> (0 + undef50), x1^0 -> (0 + undef51)}>
<l8, l2, (undef64 = (0 + x0^0)) /\ (undef65 = (0 + x1^0)) /\ (2 <= (0 + undef65)) /\ (undef57 = (0 + (0 + undef64))) /\ (undef58 = (0 + (0 + undef65))) /\ ((0 + undef57) <= 2) /\ (2 <= (0 + undef57)) /\ (undef38 = undef38) /\ (undef39 = undef39), par{x0^0 -> (0 + undef38), x1^0 -> (0 + undef39)}>
<l8, l4, (undef71 = (0 + x0^0)) /\ (undef72 = (0 + x1^0)) /\ ((1 + undef72) <= 1) /\ (undef43 = (0 + (0 + undef71))) /\ (undef44 = (0 + (0 + undef72))) /\ (3 <= (0 + undef43)), par{x0^0 -> (0 + undef43), x1^0 -> (0 + undef44)}>
<l8, l4, (undef71 = (0 + x0^0)) /\ (undef72 = (0 + x1^0)) /\ ((1 + undef72) <= 1) /\ (undef50 = (0 + (0 + undef71))) /\ (undef51 = (0 + (0 + undef72))) /\ ((1 + undef50) <= 2), par{x0^0 -> (0 + undef50), x1^0 -> (0 + undef51)}>
<l8, l2, (undef71 = (0 + x0^0)) /\ (undef72 = (0 + x1^0)) /\ ((1 + undef72) <= 1) /\ (undef57 = (0 + (0 + undef71))) /\ (undef58 = (0 + (0 + undef72))) /\ ((0 + undef57) <= 2) /\ (2 <= (0 + undef57)) /\ (undef38 = undef38) /\ (undef39 = undef39), par{x0^0 -> (0 + undef38), x1^0 -> (0 + undef39)}>
<l8, l2, (undef78 = (0 + x0^0)) /\ (undef79 = (0 + x1^0)) /\ ((0 + undef79) <= 1) /\ (1 <= (0 + undef79)) /\ (undef87 = undef87) /\ (undef88 = undef88), par{x0^0 -> (0 + undef87), x1^0 -> (0 + undef88)}>

Fresh variables:
undef3, undef4, undef8, undef9, undef15, undef16, undef17, undef22, undef23, undef24, undef29, undef30, undef31, undef38, undef39, undef43, undef44, undef50, undef51, undef57, undef58, undef64, undef65, undef71, undef72, undef78, undef79, undef87, undef88, undef92, undef93, undef99, undef100, undef107, undef108, undef109, undef110, undef114, undef115, undef116, undef117, undef121, undef122, undef123, undef124, undef127, undef128, undef129, undef134, undef135, 

Undef variables:
undef3, undef4, undef8, undef9, undef15, undef16, undef17, undef22, undef23, undef24, undef29, undef30, undef31, undef38, undef39, undef43, undef44, undef50, undef51, undef57, undef58, undef64, undef65, undef71, undef72, undef78, undef79, undef87, undef88, undef92, undef93, undef99, undef100, undef107, undef108, undef109, undef110, undef114, undef115, undef116, undef117, undef121, undef122, undef123, undef124, undef127, undef128, undef129, undef134, undef135, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l3, l8, 1 <= undef93 /\ x0^0 = undef134 /\ x1^0 = undef135 /\ undef92 = undef134 /\ undef93 = undef135, {x0^0 -> undef92, x1^0 -> undef93, rest remain the same}>
<l4, l3, 2*undef129 <= undef128 /\ undef128 <= 1 + 2*undef129 /\ 2 <= undef17 /\ x0^0 = undef15 /\ x1^0 = undef16 /\ undef15 = undef127 /\ undef16 = undef128, {x0^0 -> undef127, x1^0 -> undef129, rest remain the same}>
<l4, l3, undef24 <= 0 /\ 2*undef129 <= undef128 /\ undef128 <= 1 + 2*undef129 /\ x0^0 = undef22 /\ x1^0 = undef23 /\ undef22 = undef127 /\ undef23 = undef128, {x0^0 -> undef127, x1^0 -> undef129, rest remain the same}>
<l4, l3, x0^0 = undef29 /\ x1^0 = undef30 /\ undef8 = undef29 /\ undef9 = undef30 /\ undef31 = 1, {x0^0 -> undef8, x1^0 -> -1 + undef9, rest remain the same}>
<l8, l4, 2 <= undef65 /\ 3 <= undef43 /\ x0^0 = undef64 /\ x1^0 = undef65 /\ undef43 = undef64 /\ undef44 = undef65, {x0^0 -> undef43, x1^0 -> undef44, rest remain the same}>
<l8, l4, undef50 <= 1 /\ 2 <= undef65 /\ x0^0 = undef64 /\ x1^0 = undef65 /\ undef50 = undef64 /\ undef51 = undef65, {x0^0 -> undef50, x1^0 -> undef51, rest remain the same}>
<l8, l4, undef72 <= 0 /\ 3 <= undef43 /\ x0^0 = undef71 /\ x1^0 = undef72 /\ undef43 = undef71 /\ undef44 = undef72, {x0^0 -> undef43, x1^0 -> undef44, rest remain the same}>
<l8, l4, undef72 <= 0 /\ undef50 <= 1 /\ x0^0 = undef71 /\ x1^0 = undef72 /\ undef50 = undef71 /\ undef51 = undef72, {x0^0 -> undef50, x1^0 -> undef51, rest remain the same}>
Variables:
x0^0, x1^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l3, x0^0 = undef8 /\ x1^0 = undef9, {x0^0 -> undef8, x1^0 -> -1 + undef9, rest remain the same}>
<l0, l4, true, {all remain the same}>
<l0, l4, 3 <= undef43 /\ x0^0 = undef43 /\ x1^0 = undef44, {x0^0 -> undef43, x1^0 -> undef44, rest remain the same}>
<l0, l4, undef50 <= 1 /\ x0^0 = undef50 /\ x1^0 = undef51, {x0^0 -> undef50, x1^0 -> undef51, rest remain the same}>
<l0, l8, true, {all remain the same}>
<l0, l8, 1 <= undef93 /\ x0^0 = undef92 /\ x1^0 = undef93, {x0^0 -> undef92, x1^0 -> undef93, rest remain the same}>
<l0, l3, 2*undef129 <= undef128 /\ undef128 <= 1 + 2*undef129 /\ x0^0 = undef127 /\ x1^0 = undef128, {x0^0 -> undef127, x1^0 -> undef129, rest remain the same}>
<l0, l3, true, {all remain the same}>

Graph 2
<l0, l2, true, {x0^0 -> undef3, x1^0 -> undef4, rest remain the same}>
<l0, l2, true, {x0^0 -> undef38, x1^0 -> undef39, rest remain the same}>
<l0, l2, true, {all remain the same}>
<l0, l2, x0^0 = undef57 /\ x1^0 = undef58 /\ undef57 = 2, {x0^0 -> undef38, x1^0 -> undef39, rest remain the same}>
<l0, l2, true, {x0^0 -> undef87, x1^0 -> undef88, rest remain the same}>
<l0, l2, undef100 <= 0 /\ x0^0 = undef99 /\ x1^0 = undef100, {x0^0 -> undef87, x1^0 -> undef88, rest remain the same}>
<l0, l2, 2 + 2*undef110 <= undef107 /\ x1^0 = undef107, {x0^0 -> undef108, x1^0 -> undef109, rest remain the same}>
<l0, l2, 1 + undef114 <= 2*undef117 /\ x1^0 = undef114, {x0^0 -> undef115, x1^0 -> undef116, rest remain the same}>
<l0, l2, 2*undef124 <= undef121 /\ undef121 <= 1 + 2*undef124 /\ x1^0 = undef121, {x0^0 -> undef122, x1^0 -> undef123, rest remain the same}>
<l3, l2, undef100 <= 0 /\ x0^0 = undef134 /\ x1^0 = undef135 /\ undef99 = undef134 /\ undef100 = undef135, {x0^0 -> undef87, x1^0 -> undef88, rest remain the same}>
<l4, l2, 2 <= undef17 /\ 2 + 2*undef110 <= undef107 /\ x0^0 = undef15 /\ x1^0 = undef16 /\ undef16 = undef107, {x0^0 -> undef108, x1^0 -> undef109, rest remain the same}>
<l4, l2, 1 + undef114 <= 2*undef117 /\ 2 <= undef17 /\ x0^0 = undef15 /\ x1^0 = undef16 /\ undef16 = undef114, {x0^0 -> undef115, x1^0 -> undef116, rest remain the same}>
<l4, l2, 2*undef124 <= undef121 /\ undef121 <= 1 + 2*undef124 /\ 2 <= undef17 /\ x0^0 = undef15 /\ x1^0 = undef16 /\ undef16 = undef121, {x0^0 -> undef122, x1^0 -> undef123, rest remain the same}>
<l4, l2, undef24 <= 0 /\ 2 + 2*undef110 <= undef107 /\ x0^0 = undef22 /\ x1^0 = undef23 /\ undef23 = undef107, {x0^0 -> undef108, x1^0 -> undef109, rest remain the same}>
<l4, l2, undef24 <= 0 /\ 1 + undef114 <= 2*undef117 /\ x0^0 = undef22 /\ x1^0 = undef23 /\ undef23 = undef114, {x0^0 -> undef115, x1^0 -> undef116, rest remain the same}>
<l4, l2, undef24 <= 0 /\ 2*undef124 <= undef121 /\ undef121 <= 1 + 2*undef124 /\ x0^0 = undef22 /\ x1^0 = undef23 /\ undef23 = undef121, {x0^0 -> undef122, x1^0 -> undef123, rest remain the same}>
<l4, l2, x0^0 = undef29 /\ x1^0 = undef30 /\ undef31 = 1, {x0^0 -> undef3, x1^0 -> undef4, rest remain the same}>
<l8, l2, 2 <= undef65 /\ x0^0 = undef64 /\ x1^0 = undef65 /\ undef57 = undef64 /\ undef58 = undef65 /\ undef57 = 2, {x0^0 -> undef38, x1^0 -> undef39, rest remain the same}>
<l8, l2, undef72 <= 0 /\ x0^0 = undef71 /\ x1^0 = undef72 /\ undef57 = undef71 /\ undef58 = undef72 /\ undef57 = 2, {x0^0 -> undef38, x1^0 -> undef39, rest remain the same}>
<l8, l2, x0^0 = undef78 /\ x1^0 = undef79 /\ undef79 = 1, {x0^0 -> undef87, x1^0 -> undef88, rest remain the same}>

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

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

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

Checking conditional termination of SCC {l3, l4, l8}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008682s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.066617s
[4024 : 4081]
[4024 : 4083]
Successful child: 4081
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l8, l4, 1 <= x1^0 /\ 2 <= undef65 /\ 3 <= undef43 /\ x0^0 = undef64 /\ x1^0 = undef65 /\ undef43 = undef64 /\ undef44 = undef65, {x0^0 -> undef43, x1^0 -> undef44, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l8, l4, 1 <= x1^0 /\ undef50 <= 1 /\ 2 <= undef65 /\ x0^0 = undef64 /\ x1^0 = undef65 /\ undef50 = undef64 /\ undef51 = undef65, {x0^0 -> undef50, x1^0 -> undef51, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l8, l4, undef72 <= 0 /\ 3 <= undef43 /\ x0^0 = undef71 /\ x1^0 = undef72 /\ undef43 = undef71 /\ undef44 = undef72, {x0^0 -> undef43, x1^0 -> undef44, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l8, l4, undef72 <= 0 /\ undef50 <= 1 /\ x0^0 = undef71 /\ x1^0 = undef72 /\ undef50 = undef71 /\ undef51 = undef72, {x0^0 -> undef50, x1^0 -> undef51, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l8, l4, 1 <= x1^0 /\ 2 <= undef65 /\ 3 <= undef43 /\ x0^0 = undef64 /\ x1^0 = undef65 /\ undef43 = undef64 /\ undef44 = undef65, {x0^0 -> undef43, x1^0 -> undef44, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l8, l4, 1 <= x1^0 /\ undef50 <= 1 /\ 2 <= undef65 /\ x0^0 = undef64 /\ x1^0 = undef65 /\ undef50 = undef64 /\ undef51 = undef65, {x0^0 -> undef50, x1^0 -> undef51, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l8, l4, undef72 <= 0 /\ 3 <= undef43 /\ x0^0 = undef71 /\ x1^0 = undef72 /\ undef43 = undef71 /\ undef44 = undef72, {x0^0 -> undef43, x1^0 -> undef44, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l8, l4, undef72 <= 0 /\ undef50 <= 1 /\ x0^0 = undef71 /\ x1^0 = undef72 /\ undef50 = undef71 /\ undef51 = undef72, {x0^0 -> undef50, x1^0 -> undef51, rest remain the same}>
New Graphs: 
Transitions:
<l3, l3, 2*undef129 <= undef128 /\ 1 <= undef93 /\ undef128 <= 1 + 2*undef129 /\ 2 <= undef17 /\ 2 <= undef65 /\ 3 <= undef43 /\ x0^0 = undef134 /\ x1^0 = undef135 /\ undef15 = undef43 /\ undef15 = undef127 /\ undef16 = undef44 /\ undef16 = undef128 /\ undef43 = undef64 /\ undef44 = undef65 /\ undef64 = undef92 /\ undef65 = undef93 /\ undef92 = undef134 /\ undef93 = undef135, {x0^0 -> undef127, x1^0 -> undef129, rest remain the same}>
<l3, l3, undef24 <= 0 /\ 2*undef129 <= undef128 /\ 1 <= undef93 /\ undef128 <= 1 + 2*undef129 /\ 2 <= undef65 /\ 3 <= undef43 /\ x0^0 = undef134 /\ x1^0 = undef135 /\ undef22 = undef43 /\ undef22 = undef127 /\ undef23 = undef44 /\ undef23 = undef128 /\ undef43 = undef64 /\ undef44 = undef65 /\ undef64 = undef92 /\ undef65 = undef93 /\ undef92 = undef134 /\ undef93 = undef135, {x0^0 -> undef127, x1^0 -> undef129, rest remain the same}>
<l3, l3, 1 <= undef93 /\ 2 <= undef65 /\ 3 <= undef43 /\ x0^0 = undef134 /\ x1^0 = undef135 /\ undef8 = undef29 /\ undef9 = undef30 /\ undef29 = undef43 /\ undef30 = undef44 /\ undef43 = undef64 /\ undef44 = undef65 /\ undef64 = undef92 /\ undef65 = undef93 /\ undef92 = undef134 /\ undef93 = undef135 /\ undef31 = 1, {x0^0 -> undef8, x1^0 -> -1 + undef9, rest remain the same}>
<l3, l3, 2*undef129 <= undef128 /\ 1 <= undef93 /\ undef50 <= 1 /\ undef128 <= 1 + 2*undef129 /\ 2 <= undef17 /\ 2 <= undef65 /\ x0^0 = undef134 /\ x1^0 = undef135 /\ undef15 = undef50 /\ undef15 = undef127 /\ undef16 = undef51 /\ undef16 = undef128 /\ undef50 = undef64 /\ undef51 = undef65 /\ undef64 = undef92 /\ undef65 = undef93 /\ undef92 = undef134 /\ undef93 = undef135, {x0^0 -> undef127, x1^0 -> undef129, rest remain the same}>
<l3, l3, undef24 <= 0 /\ 2*undef129 <= undef128 /\ 1 <= undef93 /\ undef50 <= 1 /\ undef128 <= 1 + 2*undef129 /\ 2 <= undef65 /\ x0^0 = undef134 /\ x1^0 = undef135 /\ undef22 = undef50 /\ undef22 = undef127 /\ undef23 = undef51 /\ undef23 = undef128 /\ undef50 = undef64 /\ undef51 = undef65 /\ undef64 = undef92 /\ undef65 = undef93 /\ undef92 = undef134 /\ undef93 = undef135, {x0^0 -> undef127, x1^0 -> undef129, rest remain the same}>
<l3, l3, 1 <= undef93 /\ undef50 <= 1 /\ 2 <= undef65 /\ x0^0 = undef134 /\ x1^0 = undef135 /\ undef8 = undef29 /\ undef9 = undef30 /\ undef29 = undef50 /\ undef30 = undef51 /\ undef50 = undef64 /\ undef51 = undef65 /\ undef64 = undef92 /\ undef65 = undef93 /\ undef92 = undef134 /\ undef93 = undef135 /\ undef31 = 1, {x0^0 -> undef8, x1^0 -> -1 + undef9, rest remain the same}>
Variables:
x0^0, x1^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.018272s
Ranking function: -2 + x1^0
New Graphs: 

LOG: CALL check - Post:1 <= x1^0 - Process 1
* Exit transition: <l0, l8, true, {all remain the same}>
* Postcondition  : 1 <= x1^0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.001048s
INVARIANTS: 
8: 
Quasi-INVARIANTS to narrow Graph: 
8: 1 <= x1^0 , 
It's unfeasible. Removing transition: 
<l3, l8, 1 <= undef93 /\ x0^0 = undef134 /\ x1^0 = undef135 /\ undef92 = undef134 /\ undef93 = undef135, {x0^0 -> undef92, x1^0 -> undef93, rest remain the same}>
Narrowing transition: 
<l4, l3, 2*undef129 <= undef128 /\ undef128 <= 1 + 2*undef129 /\ 2 <= undef17 /\ x0^0 = undef15 /\ x1^0 = undef16 /\ undef15 = undef127 /\ undef16 = undef128, {x0^0 -> undef127, x1^0 -> undef129, rest remain the same}>
Narrowing transition: 
<l4, l3, undef24 <= 0 /\ 2*undef129 <= undef128 /\ undef128 <= 1 + 2*undef129 /\ x0^0 = undef22 /\ x1^0 = undef23 /\ undef22 = undef127 /\ undef23 = undef128, {x0^0 -> undef127, x1^0 -> undef129, rest remain the same}>
Narrowing transition: 
<l4, l3, x0^0 = undef29 /\ x1^0 = undef30 /\ undef8 = undef29 /\ undef9 = undef30 /\ undef31 = 1, {x0^0 -> undef8, x1^0 -> -1 + undef9, rest remain the same}>
It's unfeasible. Removing transition: 
<l8, l4, 2 <= undef65 /\ 3 <= undef43 /\ x0^0 = undef64 /\ x1^0 = undef65 /\ undef43 = undef64 /\ undef44 = undef65, {x0^0 -> undef43, x1^0 -> undef44, rest remain the same}>
It's unfeasible. Removing transition: 
<l8, l4, undef50 <= 1 /\ 2 <= undef65 /\ x0^0 = undef64 /\ x1^0 = undef65 /\ undef50 = undef64 /\ undef51 = undef65, {x0^0 -> undef50, x1^0 -> undef51, rest remain the same}>
Narrowing transition: 
<l8, l4, undef72 <= 0 /\ 3 <= undef43 /\ x0^0 = undef71 /\ x1^0 = undef72 /\ undef43 = undef71 /\ undef44 = undef72, {x0^0 -> undef43, x1^0 -> undef44, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l8, l4, undef72 <= 0 /\ undef50 <= 1 /\ x0^0 = undef71 /\ x1^0 = undef72 /\ undef50 = undef71 /\ undef51 = undef72, {x0^0 -> undef50, x1^0 -> undef51, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l8, l4, x1^0 <= 0 /\ undef72 <= 0 /\ 3 <= undef43 /\ x0^0 = undef71 /\ x1^0 = undef72 /\ undef43 = undef71 /\ undef44 = undef72, {x0^0 -> undef43, x1^0 -> undef44, rest remain the same}>
<l8, l4, x1^0 <= 0 /\ undef72 <= 0 /\ undef50 <= 1 /\ x0^0 = undef71 /\ x1^0 = undef72 /\ undef50 = undef71 /\ undef51 = undef72, {x0^0 -> undef50, x1^0 -> undef51, rest remain the same}>
Variables:
x0^0, x1^0
Proving termination of subgraph 2
Analyzing SCC {l2}...
No cycles found.

Program Terminates