/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: ~(1)) /\ (arg1 > 0) /\ (undef1 > 0), par{arg1 -> undef1, arg2 -> 0, arg3 -> undef3, arg4 -> undef4, arg5 -> undef5, arg6 -> undef6}> 0) /\ (undef14 > arg2) /\ (undef14 > ~(1)) /\ (undef7 <= arg1) /\ (arg1 > 0) /\ (undef7 > 0), par{arg1 -> undef7, arg2 -> (arg2 + 1), arg3 -> undef9, arg4 -> undef10, arg5 -> undef11, arg6 -> undef12}> 1) /\ (arg2 < 13) /\ (undef21 > 0) /\ (undef22 > arg2) /\ (undef22 > ~(1)) /\ (arg1 >= undef15) /\ (arg1 > 0) /\ (undef15 > 0), par{arg1 -> undef15, arg2 -> (arg2 + 1), arg3 -> undef17, arg4 -> undef18, arg5 -> undef19, arg6 -> undef20}> 12) /\ (arg1 > 0) /\ (undef23 > 0), par{arg1 -> undef23, arg2 -> 1, arg3 -> undef25, arg4 -> undef26, arg5 -> undef27, arg6 -> undef28}> 0) /\ (undef29 > 0), par{arg1 -> undef29, arg3 -> 0, arg4 -> undef32, arg5 -> undef33, arg6 -> undef34}> 12) /\ (arg1 > 0) /\ (undef36 > 0), par{arg1 -> undef36, arg2 -> (arg2 + 1), arg3 -> undef38, arg4 -> undef39, arg5 -> undef40, arg6 -> undef41}> = undef48) /\ (arg1 > 0) /\ (undef42 > 0), par{arg1 -> undef42, arg2 -> 0, arg3 -> undef44, arg4 -> undef45, arg5 -> undef46, arg6 -> undef47}> ~(1)) /\ ((arg3 - undef55) < 0) /\ (arg2 < undef56) /\ (arg2 > 0) /\ ((arg2 - 1) < undef56) /\ (undef57 > arg3) /\ (undef57 > ~(1)) /\ (undef49 <= arg1) /\ (arg1 > 0) /\ (undef49 > 0) /\ (undef51 > ~(1)), par{arg1 -> undef49, arg3 -> undef51, arg4 -> arg3, arg5 -> undef53, arg6 -> undef54}> ~(1)) /\ ((arg3 - undef64) < 0) /\ (arg2 < undef65) /\ (arg2 > 0) /\ ((arg2 - 1) < undef65) /\ (undef66 > arg3) /\ (undef66 > ~(1)) /\ (undef58 <= arg1) /\ (undef60 <= arg1) /\ (arg1 > 0) /\ (undef58 > 0) /\ (undef60 > 0), par{arg1 -> undef58, arg3 -> undef60, arg4 -> arg3, arg5 -> undef62, arg6 -> undef63}> ~(1)) /\ ((arg3 - undef73) >= 0) /\ (arg2 < undef74) /\ (arg2 > 0) /\ ((arg2 - 1) < undef74) /\ (undef75 > ~(1)) /\ (undef75 > arg3) /\ (arg1 > 0) /\ (undef68 > ~(1)), par{arg1 -> arg2, arg2 -> undef68, arg4 -> undef70, arg5 -> (arg2 - 1), arg6 -> undef72}> ~(1)) /\ ((arg3 - undef82) >= 0) /\ (arg2 < undef83) /\ (arg2 > 0) /\ ((arg2 - 1) < undef83) /\ (undef84 > ~(1)) /\ (undef84 > arg3) /\ (undef77 <= arg1) /\ (arg1 > 0) /\ (undef77 > 0), par{arg1 -> arg2, arg2 -> undef77, arg4 -> undef79, arg5 -> (arg2 - 1), arg6 -> undef81}> 0) /\ (undef85 > 0), par{arg1 -> undef85, arg3 -> 0, arg4 -> undef88, arg5 -> undef89, arg6 -> undef90}> 12) /\ (arg1 > 0) /\ (undef92 > 0), par{arg1 -> undef92, arg2 -> (arg2 + 1), arg3 -> undef94, arg4 -> undef95, arg5 -> undef96, arg6 -> undef97}> 0) /\ (undef98 > 0), par{arg1 -> undef98, arg3 -> (arg3 + 1), arg4 -> undef101, arg5 -> undef102, arg6 -> undef103}> 0) /\ (undef104 > 0) /\ (12 = arg3), par{arg1 -> undef104, arg3 -> 13, arg4 -> undef107, arg5 -> undef108, arg6 -> undef109}> ~(1)) /\ (undef117 > ~(1)) /\ (undef117 > (arg3 - undef118)) /\ ((undef110 - 1) <= arg2) /\ (undef112 <= arg2) /\ (arg2 > ~(1)) /\ (undef110 > 0) /\ (undef112 > ~(1)), par{arg1 -> undef110, arg2 -> arg1, arg3 -> undef112, arg4 -> arg3, arg5 -> arg4, arg6 -> (undef119 + undef120)}> ~(1)) /\ (undef128 > ~(1)) /\ ((arg3 - undef129) < undef128) /\ (undef121 <= arg2) /\ (undef123 <= arg2) /\ (arg2 > 0) /\ (undef121 > 0) /\ (undef123 > 0), par{arg1 -> undef121, arg2 -> arg1, arg3 -> undef123, arg4 -> arg3, arg5 -> arg4, arg6 -> (undef130 + undef131)}> = arg5) /\ ((undef132 - 1) <= arg3) /\ (undef134 <= arg3) /\ (arg1 > 0) /\ (arg3 > ~(1)) /\ (undef132 > 0) /\ (undef134 > ~(1)), par{arg1 -> undef132, arg3 -> undef134, arg5 -> undef136, arg6 -> undef137}> 0) /\ (arg3 > ~(1)) /\ (undef138 > 0) /\ (undef140 > ~(1)), par{arg1 -> undef138, arg3 -> undef140, arg5 -> undef142, arg6 -> undef143}> = undef150) /\ (undef150 > ~(1)) /\ (undef144 <= arg1) /\ (arg1 > 0) /\ (undef144 > 0), par{arg1 -> undef144, arg2 -> 12, arg3 -> (undef150 - 1), arg4 -> undef147, arg5 -> undef148, arg6 -> undef149}> ~(1)) /\ (undef157 > arg4) /\ (undef151 <= arg1) /\ (undef151 <= arg3) /\ (arg1 > 0) /\ (arg3 > 0) /\ (undef151 > 0), par{arg1 -> undef151, arg3 -> (arg4 + 1), arg4 -> undef154, arg5 -> undef155, arg6 -> undef156}> ~(1)) /\ (undef164 > arg4) /\ (undef158 <= arg1) /\ (undef158 <= arg3) /\ (arg1 > 0) /\ (arg3 > 0) /\ (undef158 > 0), par{arg1 -> undef158, arg3 -> (arg4 + 1), arg4 -> undef161, arg5 -> undef162, arg6 -> undef163}> 0) /\ (undef172 > ~(1)) /\ (undef172 > arg2) /\ ((arg3 - 1) < undef171) /\ (undef173 > arg2) /\ (undef173 > ~(1)) /\ (undef165 <= arg1) /\ (arg1 > 0) /\ (undef165 > 0), par{arg1 -> undef165, arg3 -> (arg3 - 1), arg4 -> undef168, arg5 -> undef169, arg6 -> undef170}> 0) /\ (undef181 > ~(1)) /\ (undef181 > arg2) /\ ((arg3 - 1) < undef180) /\ (undef182 > ~(1)) /\ (undef182 > arg2) /\ (undef183 > undef184) /\ (arg3 < 8) /\ (arg2 > ~(1)) /\ (undef174 <= arg1) /\ (arg1 > 0) /\ (undef174 > 0), par{arg1 -> undef174, arg2 -> (arg2 - undef185), arg3 -> (arg3 - 1), arg4 -> undef177, arg5 -> undef178, arg6 -> undef179}> 0) /\ (undef193 > ~(1)) /\ (undef193 > arg2) /\ ((arg3 - 1) < undef192) /\ (undef194 > ~(1)) /\ (undef194 > arg2) /\ (undef195 < undef196) /\ (arg3 < 8) /\ (arg2 > ~(1)) /\ (undef186 <= arg1) /\ (arg1 > 0) /\ (undef186 > 0), par{arg1 -> undef186, arg2 -> (arg2 - undef197), arg3 -> (arg3 - 1), arg4 -> undef189, arg5 -> undef190, arg6 -> undef191}> undef198, arg2 -> undef199, arg3 -> undef200, arg4 -> undef201, arg5 -> undef202, arg6 -> undef203}> Fresh variables: undef1, undef3, undef4, undef5, undef6, undef7, undef9, undef10, undef11, undef12, undef13, undef14, undef15, undef17, undef18, undef19, undef20, undef21, undef22, undef23, undef25, undef26, undef27, undef28, undef29, undef32, undef33, undef34, undef35, undef36, undef38, undef39, undef40, undef41, undef42, undef44, undef45, undef46, undef47, undef48, undef49, undef51, undef53, undef54, undef55, undef56, undef57, undef58, undef60, undef62, undef63, undef64, undef65, undef66, undef68, undef70, undef72, undef73, undef74, undef75, undef77, undef79, undef81, undef82, undef83, undef84, undef85, undef88, undef89, undef90, undef91, undef92, undef94, undef95, undef96, undef97, undef98, undef101, undef102, undef103, undef104, undef107, undef108, undef109, undef110, undef112, undef116, undef117, undef118, undef119, undef120, undef121, undef123, undef127, undef128, undef129, undef130, undef131, undef132, undef134, undef136, undef137, undef138, undef140, undef142, undef143, undef144, undef147, undef148, undef149, undef150, undef151, undef154, undef155, undef156, undef157, undef158, undef161, undef162, undef163, undef164, undef165, undef168, undef169, undef170, undef171, undef172, undef173, undef174, undef177, undef178, undef179, undef180, undef181, undef182, undef183, undef184, undef185, undef186, undef189, undef190, undef191, undef192, undef193, undef194, undef195, undef196, undef197, undef198, undef199, undef200, undef201, undef202, undef203, Undef variables: undef1, undef3, undef4, undef5, undef6, undef7, undef9, undef10, undef11, undef12, undef13, undef14, undef15, undef17, undef18, undef19, undef20, undef21, undef22, undef23, undef25, undef26, undef27, undef28, undef29, undef32, undef33, undef34, undef35, undef36, undef38, undef39, undef40, undef41, undef42, undef44, undef45, undef46, undef47, undef48, undef49, undef51, undef53, undef54, undef55, undef56, undef57, undef58, undef60, undef62, undef63, undef64, undef65, undef66, undef68, undef70, undef72, undef73, undef74, undef75, undef77, undef79, undef81, undef82, undef83, undef84, undef85, undef88, undef89, undef90, undef91, undef92, undef94, undef95, undef96, undef97, undef98, undef101, undef102, undef103, undef104, undef107, undef108, undef109, undef110, undef112, undef116, undef117, undef118, undef119, undef120, undef121, undef123, undef127, undef128, undef129, undef130, undef131, undef132, undef134, undef136, undef137, undef138, undef140, undef142, undef143, undef144, undef147, undef148, undef149, undef150, undef151, undef154, undef155, undef156, undef157, undef158, undef161, undef162, undef163, undef164, undef165, undef168, undef169, undef170, undef171, undef172, undef173, undef174, undef177, undef178, undef179, undef180, undef181, undef182, undef183, undef184, undef185, undef186, undef189, undef190, undef191, undef192, undef193, undef194, undef195, undef196, undef197, undef198, undef199, undef200, undef201, undef202, undef203, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: ~(1)) /\ (undef198 > 0) /\ (undef1 > 0)> 0) /\ (undef14 > arg2) /\ (undef14 > ~(1)) /\ (undef7 <= arg1) /\ (arg1 > 0) /\ (undef7 > 0), par{arg1 -> undef7, arg2 -> (arg2 + 1), arg3 -> undef9}> 1) /\ (arg2 < 13) /\ (undef21 > 0) /\ (undef22 > arg2) /\ (undef22 > ~(1)) /\ (arg1 >= undef15) /\ (arg1 > 0) /\ (undef15 > 0), par{arg1 -> undef15, arg2 -> (arg2 + 1), arg3 -> undef17}> 12) /\ (arg1 > 0) /\ (undef23 > 0) /\ (undef29 <= undef23) /\ (1 < undef35) /\ (undef23 > 0) /\ (undef29 > 0), par{arg1 -> undef29, arg2 -> 1, arg3 -> 0}> 12) /\ (arg1 > 0) /\ (undef23 > 0) /\ (undef42 <= undef23) /\ (1 >= undef48) /\ (undef23 > 0) /\ (undef42 > 0) /\ (undef85 <= undef42) /\ (0 < undef91) /\ (undef42 > 0) /\ (undef85 > 0), par{arg1 -> undef85, arg2 -> 0, arg3 -> 0}> 12) /\ (arg1 > 0) /\ (undef23 > 0) /\ (undef42 <= undef23) /\ (1 >= undef48) /\ (undef23 > 0) /\ (undef42 > 0) /\ (0 >= undef150) /\ (undef150 > ~(1)) /\ (undef144 <= undef42) /\ (undef42 > 0) /\ (undef144 > 0), par{arg1 -> undef144, arg2 -> 12, arg3 -> (undef150 - 1)}> 12) /\ (arg1 > 0) /\ (undef36 > 0) /\ (undef29 <= undef36) /\ ((arg2 + 1) < undef35) /\ (undef36 > 0) /\ (undef29 > 0), par{arg1 -> undef29, arg2 -> (arg2 + 1), arg3 -> 0}> 12) /\ (arg1 > 0) /\ (undef36 > 0) /\ (undef42 <= undef36) /\ ((arg2 + 1) >= undef48) /\ (undef36 > 0) /\ (undef42 > 0) /\ (undef85 <= undef42) /\ (0 < undef91) /\ (undef42 > 0) /\ (undef85 > 0), par{arg1 -> undef85, arg2 -> 0, arg3 -> 0}> 12) /\ (arg1 > 0) /\ (undef36 > 0) /\ (undef42 <= undef36) /\ ((arg2 + 1) >= undef48) /\ (undef36 > 0) /\ (undef42 > 0) /\ (0 >= undef150) /\ (undef150 > ~(1)) /\ (undef144 <= undef42) /\ (undef42 > 0) /\ (undef144 > 0), par{arg1 -> undef144, arg2 -> 12, arg3 -> (undef150 - 1)}> ~(1)) /\ ((arg3 - undef55) < 0) /\ (arg2 < undef56) /\ (arg2 > 0) /\ ((arg2 - 1) < undef56) /\ (undef57 > arg3) /\ (undef57 > ~(1)) /\ (undef49 <= arg1) /\ (arg1 > 0) /\ (undef49 > 0) /\ (undef51 > ~(1)) /\ (undef157 > ~(1)) /\ (undef157 > arg3) /\ (undef151 <= undef49) /\ (undef151 <= undef51) /\ (undef49 > 0) /\ (undef51 > 0) /\ (undef151 > 0), par{arg1 -> undef151, arg3 -> (arg3 + 1)}> ~(1)) /\ ((arg3 - undef64) < 0) /\ (arg2 < undef65) /\ (arg2 > 0) /\ ((arg2 - 1) < undef65) /\ (undef66 > arg3) /\ (undef66 > ~(1)) /\ (undef58 <= arg1) /\ (undef60 <= arg1) /\ (arg1 > 0) /\ (undef58 > 0) /\ (undef60 > 0) /\ (undef157 > ~(1)) /\ (undef157 > arg3) /\ (undef151 <= undef58) /\ (undef151 <= undef60) /\ (undef58 > 0) /\ (undef60 > 0) /\ (undef151 > 0), par{arg1 -> undef151, arg3 -> (arg3 + 1)}> ~(1)) /\ ((arg3 - undef73) >= 0) /\ (arg2 < undef74) /\ (arg2 > 0) /\ ((arg2 - 1) < undef74) /\ (undef75 > ~(1)) /\ (undef75 > arg3) /\ (arg1 > 0) /\ (undef68 > ~(1)) /\ (arg2 < 8) /\ ((arg2 - 1) < undef116) /\ (arg3 > ~(1)) /\ (undef117 > ~(1)) /\ (undef117 > (arg3 - undef118)) /\ ((undef110 - 1) <= undef68) /\ (undef112 <= undef68) /\ (undef68 > ~(1)) /\ (undef110 > 0) /\ (undef112 > ~(1)) /\ (undef132 <= undef110) /\ ((undef119 + undef120) >= undef70) /\ ((undef132 - 1) <= undef112) /\ (undef134 <= undef112) /\ (undef110 > 0) /\ (undef112 > ~(1)) /\ (undef132 > 0) /\ (undef134 > ~(1)) /\ (undef164 > ~(1)) /\ (undef164 > arg3) /\ (undef158 <= undef132) /\ (undef158 <= undef134) /\ (undef132 > 0) /\ (undef134 > 0) /\ (undef158 > 0), par{arg1 -> undef158, arg2 -> arg2, arg3 -> (arg3 + 1)}> ~(1)) /\ ((arg3 - undef73) >= 0) /\ (arg2 < undef74) /\ (arg2 > 0) /\ ((arg2 - 1) < undef74) /\ (undef75 > ~(1)) /\ (undef75 > arg3) /\ (arg1 > 0) /\ (undef68 > ~(1)) /\ (arg2 < 8) /\ ((arg2 - 1) < undef116) /\ (arg3 > ~(1)) /\ (undef117 > ~(1)) /\ (undef117 > (arg3 - undef118)) /\ ((undef110 - 1) <= undef68) /\ (undef112 <= undef68) /\ (undef68 > ~(1)) /\ (undef110 > 0) /\ (undef112 > ~(1)) /\ (undef138 <= undef110) /\ ((undef119 + undef120) < undef70) /\ ((undef138 - 1) <= undef112) /\ (undef140 <= undef112) /\ (undef110 > 0) /\ (undef112 > ~(1)) /\ (undef138 > 0) /\ (undef140 > ~(1)) /\ (undef164 > ~(1)) /\ (undef164 > arg3) /\ (undef158 <= undef138) /\ (undef158 <= undef140) /\ (undef138 > 0) /\ (undef140 > 0) /\ (undef158 > 0), par{arg1 -> undef158, arg2 -> arg2, arg3 -> (arg3 + 1)}> ~(1)) /\ ((arg3 - undef73) >= 0) /\ (arg2 < undef74) /\ (arg2 > 0) /\ ((arg2 - 1) < undef74) /\ (undef75 > ~(1)) /\ (undef75 > arg3) /\ (arg1 > 0) /\ (undef68 > ~(1)) /\ (arg2 < 8) /\ ((arg2 - 1) < undef127) /\ (arg3 > ~(1)) /\ (undef128 > ~(1)) /\ ((arg3 - undef129) < undef128) /\ (undef121 <= undef68) /\ (undef123 <= undef68) /\ (undef68 > 0) /\ (undef121 > 0) /\ (undef123 > 0) /\ (undef132 <= undef121) /\ ((undef130 + undef131) >= undef70) /\ ((undef132 - 1) <= undef123) /\ (undef134 <= undef123) /\ (undef121 > 0) /\ (undef123 > ~(1)) /\ (undef132 > 0) /\ (undef134 > ~(1)) /\ (undef164 > ~(1)) /\ (undef164 > arg3) /\ (undef158 <= undef132) /\ (undef158 <= undef134) /\ (undef132 > 0) /\ (undef134 > 0) /\ (undef158 > 0), par{arg1 -> undef158, arg2 -> arg2, arg3 -> (arg3 + 1)}> ~(1)) /\ ((arg3 - undef73) >= 0) /\ (arg2 < undef74) /\ (arg2 > 0) /\ ((arg2 - 1) < undef74) /\ (undef75 > ~(1)) /\ (undef75 > arg3) /\ (arg1 > 0) /\ (undef68 > ~(1)) /\ (arg2 < 8) /\ ((arg2 - 1) < undef127) /\ (arg3 > ~(1)) /\ (undef128 > ~(1)) /\ ((arg3 - undef129) < undef128) /\ (undef121 <= undef68) /\ (undef123 <= undef68) /\ (undef68 > 0) /\ (undef121 > 0) /\ (undef123 > 0) /\ (undef138 <= undef121) /\ ((undef130 + undef131) < undef70) /\ ((undef138 - 1) <= undef123) /\ (undef140 <= undef123) /\ (undef121 > 0) /\ (undef123 > ~(1)) /\ (undef138 > 0) /\ (undef140 > ~(1)) /\ (undef164 > ~(1)) /\ (undef164 > arg3) /\ (undef158 <= undef138) /\ (undef158 <= undef140) /\ (undef138 > 0) /\ (undef140 > 0) /\ (undef158 > 0), par{arg1 -> undef158, arg2 -> arg2, arg3 -> (arg3 + 1)}> ~(1)) /\ ((arg3 - undef82) >= 0) /\ (arg2 < undef83) /\ (arg2 > 0) /\ ((arg2 - 1) < undef83) /\ (undef84 > ~(1)) /\ (undef84 > arg3) /\ (undef77 <= arg1) /\ (arg1 > 0) /\ (undef77 > 0) /\ (arg2 < 8) /\ ((arg2 - 1) < undef116) /\ (arg3 > ~(1)) /\ (undef117 > ~(1)) /\ (undef117 > (arg3 - undef118)) /\ ((undef110 - 1) <= undef77) /\ (undef112 <= undef77) /\ (undef77 > ~(1)) /\ (undef110 > 0) /\ (undef112 > ~(1)) /\ (undef132 <= undef110) /\ ((undef119 + undef120) >= undef79) /\ ((undef132 - 1) <= undef112) /\ (undef134 <= undef112) /\ (undef110 > 0) /\ (undef112 > ~(1)) /\ (undef132 > 0) /\ (undef134 > ~(1)) /\ (undef164 > ~(1)) /\ (undef164 > arg3) /\ (undef158 <= undef132) /\ (undef158 <= undef134) /\ (undef132 > 0) /\ (undef134 > 0) /\ (undef158 > 0), par{arg1 -> undef158, arg2 -> arg2, arg3 -> (arg3 + 1)}> ~(1)) /\ ((arg3 - undef82) >= 0) /\ (arg2 < undef83) /\ (arg2 > 0) /\ ((arg2 - 1) < undef83) /\ (undef84 > ~(1)) /\ (undef84 > arg3) /\ (undef77 <= arg1) /\ (arg1 > 0) /\ (undef77 > 0) /\ (arg2 < 8) /\ ((arg2 - 1) < undef116) /\ (arg3 > ~(1)) /\ (undef117 > ~(1)) /\ (undef117 > (arg3 - undef118)) /\ ((undef110 - 1) <= undef77) /\ (undef112 <= undef77) /\ (undef77 > ~(1)) /\ (undef110 > 0) /\ (undef112 > ~(1)) /\ (undef138 <= undef110) /\ ((undef119 + undef120) < undef79) /\ ((undef138 - 1) <= undef112) /\ (undef140 <= undef112) /\ (undef110 > 0) /\ (undef112 > ~(1)) /\ (undef138 > 0) /\ (undef140 > ~(1)) /\ (undef164 > ~(1)) /\ (undef164 > arg3) /\ (undef158 <= undef138) /\ (undef158 <= undef140) /\ (undef138 > 0) /\ (undef140 > 0) /\ (undef158 > 0), par{arg1 -> undef158, arg2 -> arg2, arg3 -> (arg3 + 1)}> ~(1)) /\ ((arg3 - undef82) >= 0) /\ (arg2 < undef83) /\ (arg2 > 0) /\ ((arg2 - 1) < undef83) /\ (undef84 > ~(1)) /\ (undef84 > arg3) /\ (undef77 <= arg1) /\ (arg1 > 0) /\ (undef77 > 0) /\ (arg2 < 8) /\ ((arg2 - 1) < undef127) /\ (arg3 > ~(1)) /\ (undef128 > ~(1)) /\ ((arg3 - undef129) < undef128) /\ (undef121 <= undef77) /\ (undef123 <= undef77) /\ (undef77 > 0) /\ (undef121 > 0) /\ (undef123 > 0) /\ (undef132 <= undef121) /\ ((undef130 + undef131) >= undef79) /\ ((undef132 - 1) <= undef123) /\ (undef134 <= undef123) /\ (undef121 > 0) /\ (undef123 > ~(1)) /\ (undef132 > 0) /\ (undef134 > ~(1)) /\ (undef164 > ~(1)) /\ (undef164 > arg3) /\ (undef158 <= undef132) /\ (undef158 <= undef134) /\ (undef132 > 0) /\ (undef134 > 0) /\ (undef158 > 0), par{arg1 -> undef158, arg2 -> arg2, arg3 -> (arg3 + 1)}> ~(1)) /\ ((arg3 - undef82) >= 0) /\ (arg2 < undef83) /\ (arg2 > 0) /\ ((arg2 - 1) < undef83) /\ (undef84 > ~(1)) /\ (undef84 > arg3) /\ (undef77 <= arg1) /\ (arg1 > 0) /\ (undef77 > 0) /\ (arg2 < 8) /\ ((arg2 - 1) < undef127) /\ (arg3 > ~(1)) /\ (undef128 > ~(1)) /\ ((arg3 - undef129) < undef128) /\ (undef121 <= undef77) /\ (undef123 <= undef77) /\ (undef77 > 0) /\ (undef121 > 0) /\ (undef123 > 0) /\ (undef138 <= undef121) /\ ((undef130 + undef131) < undef79) /\ ((undef138 - 1) <= undef123) /\ (undef140 <= undef123) /\ (undef121 > 0) /\ (undef123 > ~(1)) /\ (undef138 > 0) /\ (undef140 > ~(1)) /\ (undef164 > ~(1)) /\ (undef164 > arg3) /\ (undef158 <= undef138) /\ (undef158 <= undef140) /\ (undef138 > 0) /\ (undef140 > 0) /\ (undef158 > 0), par{arg1 -> undef158, arg2 -> arg2, arg3 -> (arg3 + 1)}> 12) /\ (arg1 > 0) /\ (undef92 > 0) /\ (undef85 <= undef92) /\ ((arg2 + 1) < undef91) /\ (undef92 > 0) /\ (undef85 > 0), par{arg1 -> undef85, arg2 -> (arg2 + 1), arg3 -> 0}> 12) /\ (arg1 > 0) /\ (undef92 > 0) /\ ((arg2 + 1) >= undef150) /\ (undef150 > ~(1)) /\ (undef144 <= undef92) /\ (undef92 > 0) /\ (undef144 > 0), par{arg1 -> undef144, arg2 -> 12, arg3 -> (undef150 - 1)}> 0) /\ (undef98 > 0), par{arg1 -> undef98, arg3 -> (arg3 + 1)}> 0) /\ (undef104 > 0) /\ (12 = arg3), par{arg1 -> undef104, arg3 -> 13}> 0) /\ (undef172 > ~(1)) /\ (undef172 > arg2) /\ ((arg3 - 1) < undef171) /\ (undef173 > arg2) /\ (undef173 > ~(1)) /\ (undef165 <= arg1) /\ (arg1 > 0) /\ (undef165 > 0), par{arg1 -> undef165, arg3 -> (arg3 - 1)}> 0) /\ (undef181 > ~(1)) /\ (undef181 > arg2) /\ ((arg3 - 1) < undef180) /\ (undef182 > ~(1)) /\ (undef182 > arg2) /\ (undef183 > undef184) /\ (arg3 < 8) /\ (arg2 > ~(1)) /\ (undef174 <= arg1) /\ (arg1 > 0) /\ (undef174 > 0), par{arg1 -> undef174, arg2 -> (arg2 - undef185), arg3 -> (arg3 - 1)}> 0) /\ (undef193 > ~(1)) /\ (undef193 > arg2) /\ ((arg3 - 1) < undef192) /\ (undef194 > ~(1)) /\ (undef194 > arg2) /\ (undef195 < undef196) /\ (arg3 < 8) /\ (arg2 > ~(1)) /\ (undef186 <= arg1) /\ (arg1 > 0) /\ (undef186 > 0), par{arg1 -> undef186, arg2 -> (arg2 - undef197), arg3 -> (arg3 - 1)}> Fresh variables: undef1, undef3, undef4, undef5, undef6, undef7, undef9, undef10, undef11, undef12, undef13, undef14, undef15, undef17, undef18, undef19, undef20, undef21, undef22, undef23, undef25, undef26, undef27, undef28, undef29, undef32, undef33, undef34, undef35, undef36, undef38, undef39, undef40, undef41, undef42, undef44, undef45, undef46, undef47, undef48, undef49, undef51, undef53, undef54, undef55, undef56, undef57, undef58, undef60, undef62, undef63, undef64, undef65, undef66, undef68, undef70, undef72, undef73, undef74, undef75, undef77, undef79, undef81, undef82, undef83, undef84, undef85, undef88, undef89, undef90, undef91, undef92, undef94, undef95, undef96, undef97, undef98, undef101, undef102, undef103, undef104, undef107, undef108, undef109, undef110, undef112, undef116, undef117, undef118, undef119, undef120, undef121, undef123, undef127, undef128, undef129, undef130, undef131, undef132, undef134, undef136, undef137, undef138, undef140, undef142, undef143, undef144, undef147, undef148, undef149, undef150, undef151, undef154, undef155, undef156, undef157, undef158, undef161, undef162, undef163, undef164, undef165, undef168, undef169, undef170, undef171, undef172, undef173, undef174, undef177, undef178, undef179, undef180, undef181, undef182, undef183, undef184, undef185, undef186, undef189, undef190, undef191, undef192, undef193, undef194, undef195, undef196, undef197, undef198, undef199, undef200, undef201, undef202, undef203, Undef variables: undef1, undef3, undef4, undef5, undef6, undef7, undef9, undef10, undef11, undef12, undef13, undef14, undef15, undef17, undef18, undef19, undef20, undef21, undef22, undef23, undef25, undef26, undef27, undef28, undef29, undef32, undef33, undef34, undef35, undef36, undef38, undef39, undef40, undef41, undef42, undef44, undef45, undef46, undef47, undef48, undef49, undef51, undef53, undef54, undef55, undef56, undef57, undef58, undef60, undef62, undef63, undef64, undef65, undef66, undef68, undef70, undef72, undef73, undef74, undef75, undef77, undef79, undef81, undef82, undef83, undef84, undef85, undef88, undef89, undef90, undef91, undef92, undef94, undef95, undef96, undef97, undef98, undef101, undef102, undef103, undef104, undef107, undef108, undef109, undef110, undef112, undef116, undef117, undef118, undef119, undef120, undef121, undef123, undef127, undef128, undef129, undef130, undef131, undef132, undef134, undef136, undef137, undef138, undef140, undef142, undef143, undef144, undef147, undef148, undef149, undef150, undef151, undef154, undef155, undef156, undef157, undef158, undef161, undef162, undef163, undef164, undef165, undef168, undef169, undef170, undef171, undef172, undef173, undef174, undef177, undef178, undef179, undef180, undef181, undef182, undef183, undef184, undef185, undef186, undef189, undef190, undef191, undef192, undef193, undef194, undef195, undef196, undef197, undef198, undef199, undef200, undef201, undef202, undef203, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: undef7, arg2 -> 1 + arg2, arg3 -> undef9, rest remain the same}> undef15, arg2 -> 1 + arg2, arg3 -> undef17, rest remain the same}> Variables: arg1, arg2, arg3 Graph 2: Transitions: undef29, arg2 -> 1 + arg2, arg3 -> 0, rest remain the same}> undef151, arg3 -> 1 + arg3, rest remain the same}> undef151, arg3 -> 1 + arg3, rest remain the same}> undef158, arg3 -> 1 + arg3, rest remain the same}> undef158, arg3 -> 1 + arg3, rest remain the same}> undef158, arg3 -> 1 + arg3, rest remain the same}> undef158, arg3 -> 1 + arg3, rest remain the same}> undef158, arg3 -> 1 + arg3, rest remain the same}> undef158, arg3 -> 1 + arg3, rest remain the same}> undef158, arg3 -> 1 + arg3, rest remain the same}> undef158, arg3 -> 1 + arg3, rest remain the same}> Variables: arg1, arg2, arg3 Graph 3: Transitions: undef85, arg2 -> 1 + arg2, arg3 -> 0, rest remain the same}> undef98, arg3 -> 1 + arg3, rest remain the same}> undef104, arg3 -> 13, rest remain the same}> Variables: arg1, arg2, arg3 Graph 4: Transitions: undef165, arg3 -> -1 + arg3, rest remain the same}> undef174, arg2 -> arg2 - undef185, arg3 -> -1 + arg3, rest remain the same}> undef186, arg2 -> arg2 - undef197, arg3 -> -1 + arg3, rest remain the same}> Variables: arg1, arg2, arg3 Precedence: Graph 0 Graph 1 Graph 2 undef29, arg2 -> 1, arg3 -> 0, rest remain the same}> Graph 3 undef85, arg2 -> 0, arg3 -> 0, rest remain the same}> undef85, arg2 -> 0, arg3 -> 0, rest remain the same}> Graph 4 undef144, arg2 -> 12, arg3 -> -1 + undef150, rest remain the same}> undef144, arg2 -> 12, arg3 -> -1 + undef150, rest remain the same}> undef144, arg2 -> 12, arg3 -> -1 + undef150, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ( 4 , 2 ) ( 8 , 3 ) ( 11 , 4 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.007216 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002736s Ranking function: 12 - arg2 New Graphs: Proving termination of subgraph 2 Checking unfeasibility... Time used: 0.301672 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.043338s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 1.444360s [4845 : 4846] [4845 : 4847] Successful child: 4847 Ranking function: 103 - 13*arg2 - arg3 Ranking function and negation of Quasi-Invariant applied New Graphs: Transitions: undef29, arg2 -> 1 + arg2, arg3 -> 0, rest remain the same}> Variables: arg1, arg2, arg3 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005154s Ranking function: -1 + (1 / 13)*arg3 New Graphs: Proving termination of subgraph 3 Checking unfeasibility... Time used: 4.10145 Checking conditional termination of SCC {l8}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.018452s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.032345s [4845 : 4851] [4845 : 4852] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.067014s Time used: 0.063948 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001859s Time used: 1.0019 LOG: SAT solveNonLinear - Elapsed time: 1.068873s Cost: 1; Total time: 1.06585 Quasi-ranking function: 50000 - arg2 New Graphs: Transitions: undef85, arg2 -> 1 + arg2, arg3 -> 0, rest remain the same}> undef98, arg3 -> 1 + arg3, rest remain the same}> undef104, arg3 -> 13, rest remain the same}> Variables: arg1, arg2, arg3 Checking conditional termination of SCC {l8}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002775s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.037767s [4845 : 4856] [4845 : 4857] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.068076s Time used: 0.064487 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.089160s Time used: 1.0892 LOG: SAT solveNonLinear - Elapsed time: 1.157236s Cost: 1; Total time: 1.15369 Termination implied by a set of invariant(s): Invariant at l8: 1 <= arg1 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef85, arg2 -> 1 + arg2, arg3 -> 0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef98, arg3 -> 1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef104, arg3 -> 13, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef85, arg2 -> 1 + arg2, arg3 -> 0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef98, arg3 -> 1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef104, arg3 -> 13, rest remain the same}> Quasi-ranking function: 50000 + 50000*arg1 - arg2 New Graphs: Transitions: undef85, arg2 -> 1 + arg2, arg3 -> 0, rest remain the same}> undef98, arg3 -> 1 + arg3, rest remain the same}> undef104, arg3 -> 13, rest remain the same}> Variables: arg1, arg2, arg3 Checking conditional termination of SCC {l8}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002992s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.048674s [4845 : 4861] [4845 : 4862] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.984302s Time used: 0.980497 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.002008s Time used: 1.00205 LOG: SAT solveNonLinear - Elapsed time: 1.986310s Cost: 1; Total time: 1.98255 Termination implied by a set of invariant(s): Invariant at l8: arg3 <= 23 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef85, arg2 -> 1 + arg2, arg3 -> 0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef98, arg3 -> 1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef104, arg3 -> 13, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef85, arg2 -> 1 + arg2, arg3 -> 0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef98, arg3 -> 1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef104, arg3 -> 13, rest remain the same}> Quasi-ranking function: 50000 + 1200000*arg1 - 24*arg2 - arg3 New Graphs: Transitions: undef85, arg2 -> 1 + arg2, arg3 -> 0, rest remain the same}> undef98, arg3 -> 1 + arg3, rest remain the same}> undef104, arg3 -> 13, rest remain the same}> Variables: arg1, arg2, arg3 Checking conditional termination of SCC {l8}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003764s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.462631s [4845 : 4866] [4845 : 4867] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.128912s Time used: 0.124422 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001777s Time used: 1.0018 LOG: SAT solveNonLinear - Elapsed time: 1.130689s Cost: 1; Total time: 1.12623 Termination implied by a set of invariant(s): Invariant at l8: 0 <= arg2 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef85, arg2 -> 1 + arg2, arg3 -> 0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef98, arg3 -> 1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef104, arg3 -> 13, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef85, arg2 -> 1 + arg2, arg3 -> 0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef98, arg3 -> 1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef104, arg3 -> 13, rest remain the same}> Quasi-ranking function: 50000 - 23*arg2 - arg3 New Graphs: Transitions: undef85, arg2 -> 1 + arg2, arg3 -> 0, rest remain the same}> undef98, arg3 -> 1 + arg3, rest remain the same}> undef104, arg3 -> 13, rest remain the same}> Variables: arg1, arg2, arg3 Checking conditional termination of SCC {l8}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004366s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 1.242737s [4845 : 4871] [4845 : 4872] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.106524s Time used: 4.10248 Termination failed. Trying to show unreachability... Proving unreachability of entry: undef85, arg2 -> 0, arg3 -> 0, rest remain the same}> LOG: CALL check - Post:1 <= 0 - Process 1 * Exit transition: undef85, arg2 -> 0, arg3 -> 0, rest 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: * Postcondition : 1 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003425s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.003615s LOG: NarrowEntry size 1 Narrowing transition: undef7, arg2 -> 1 + arg2, arg3 -> undef9, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef15, arg2 -> 1 + arg2, arg3 -> undef17, rest remain the same}> LOG: Narrow transition size 1 ENTRIES: END ENTRIES: GRAPH: undef7, arg2 -> 1 + arg2, arg3 -> undef9, rest remain the same}> undef15, arg2 -> 1 + arg2, arg3 -> undef17, rest remain the same}> END GRAPH: EXIT: undef85, arg2 -> 0, arg3 -> 0, rest remain the same}> POST: 1 <= 0 LOG: Try proving POST [4845 : 4992] [4845 : 4993] [4845 : 4994] LOG: Postcondition is not implied - no solution > Postcondition is not implied! LOG: RETURN check - Elapsed time: 4.193750s Cannot prove unreachability [4845 : 4995] [4845 : 4999] Successful child: 4995 Program does NOT terminate