/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: 1, is_aborted^0 -> (0 + undef3), is_aborted_next^0 -> undef3, pc_Drive^0 -> (0 + undef7), pc_Drive_next^0 -> undef7, pc_Loop^0 -> 1, pc_Plan^0 -> undef9, pc_Plan_next^0 -> undef10, x^0 -> (0 + undef12), x_next^0 -> undef12, y^0 -> (0 + undef14), y_next^0 -> undef14}> (0 + undef17), is_aborted_next^0 -> undef17, pc_Drive^0 -> (0 + undef21), pc_Drive_next^0 -> undef21, pc_Loop^0 -> 1, pc_Plan^0 -> undef23, pc_Plan_next^0 -> undef24, x^0 -> (0 + undef26), x_next^0 -> undef26, y^0 -> (0 + undef28), y_next^0 -> undef28}> (0 + undef31), is_aborted_next^0 -> undef31, pc_Drive^0 -> (0 + undef35), pc_Drive_next^0 -> undef35, pc_Loop^0 -> 1, pc_Plan^0 -> undef37, pc_Plan_next^0 -> undef38, x^0 -> (0 + undef40), x_next^0 -> undef40, y^0 -> (0 + undef42), y_next^0 -> undef42}> 1, is_aborted^0 -> (0 + undef45), is_aborted_next^0 -> undef45, pc_Drive^0 -> (0 + undef49), pc_Drive_next^0 -> undef49, pc_Loop^0 -> 1, pc_Plan^0 -> undef51, pc_Plan_next^0 -> undef52, x^0 -> (0 + undef54), x_next^0 -> undef54, y^0 -> (0 + undef56), y_next^0 -> undef56}> (0 + undef59), is_aborted_next^0 -> undef59, pc_Drive^0 -> (0 + undef63), pc_Drive_next^0 -> undef63, pc_Loop^0 -> 1, pc_Plan^0 -> undef65, pc_Plan_next^0 -> undef66, x^0 -> (0 + undef68), x_next^0 -> undef68, y^0 -> (0 + undef70), y_next^0 -> undef70}> (0 + undef73), is_aborted_next^0 -> undef73, pc_Drive^0 -> (0 + undef77), pc_Drive_next^0 -> undef77, pc_Loop^0 -> 1, pc_Plan^0 -> undef79, pc_Plan_next^0 -> undef80, x^0 -> (0 + undef82), x_next^0 -> undef82, y^0 -> (0 + undef84), y_next^0 -> undef84}> undef85, is_aborted^0 -> (0 + undef87), is_aborted_next^0 -> undef87, pc_Drive^0 -> undef90, pc_Drive_next^0 -> undef91, pc_Loop^0 -> 4, pc_Plan^0 -> (0 + undef94), pc_Plan_next^0 -> undef94, x^0 -> (0 + undef96), x_next^0 -> undef96, y^0 -> (0 + undef98), y_next^0 -> undef98}> (0 + undef101), is_aborted_next^0 -> undef101, pc_Drive^0 -> undef104, pc_Drive_next^0 -> undef105, pc_Loop^0 -> 4, pc_Plan^0 -> (0 + undef108), pc_Plan_next^0 -> undef108, x^0 -> (0 + undef110), x_next^0 -> undef110, y^0 -> (0 + undef112), y_next^0 -> undef112}> (0 + undef115), is_aborted_next^0 -> undef115, pc_Drive^0 -> undef118, pc_Drive_next^0 -> undef119, pc_Loop^0 -> 4, pc_Plan^0 -> (0 + undef122), pc_Plan_next^0 -> undef122, x^0 -> (0 + undef124), x_next^0 -> undef124, y^0 -> (0 + undef126), y_next^0 -> undef126}> 1, is_aborted^0 -> (0 + undef129), is_aborted_next^0 -> undef129, pc_Drive^0 -> undef132, pc_Drive_next^0 -> undef133, pc_Loop^0 -> 4, pc_Plan^0 -> (0 + undef136), pc_Plan_next^0 -> undef136, x^0 -> (0 + undef138), x_next^0 -> undef138, y^0 -> (0 + undef140), y_next^0 -> undef140}> 0, is_aborted^0 -> (0 + undef143), is_aborted_next^0 -> undef143, pc_Drive^0 -> undef146, pc_Drive_next^0 -> undef147, pc_Loop^0 -> 4, pc_Plan^0 -> (0 + undef150), pc_Plan_next^0 -> undef150, x^0 -> (0 + undef152), x_next^0 -> undef152, y^0 -> (0 + undef154), y_next^0 -> undef154}> 0, is_aborted^0 -> (0 + undef157), is_aborted_next^0 -> undef157, pc_Drive^0 -> undef160, pc_Drive_next^0 -> undef161, pc_Loop^0 -> 4, pc_Plan^0 -> (0 + undef164), pc_Plan_next^0 -> undef164, x^0 -> (0 + undef166), x_next^0 -> undef166, y^0 -> (0 + undef168), y_next^0 -> undef168}> 1, is_aborted^0 -> undef170, is_aborted_next^0 -> undef171, pc_Drive^0 -> (0 + undef175), pc_Drive_next^0 -> undef175, pc_Loop^0 -> 7, pc_Plan^0 -> (0 + undef178), pc_Plan_next^0 -> undef178, x^0 -> (0 + undef180), x_next^0 -> undef180, y^0 -> (0 + undef182), y_next^0 -> undef182}> undef184, is_aborted_next^0 -> undef185, pc_Drive^0 -> (0 + undef189), pc_Drive_next^0 -> undef189, pc_Loop^0 -> 7, pc_Plan^0 -> (0 + undef192), pc_Plan_next^0 -> undef192, x^0 -> (0 + undef194), x_next^0 -> undef194, y^0 -> (0 + undef196), y_next^0 -> undef196}> undef198, is_aborted_next^0 -> undef199, pc_Drive^0 -> (0 + undef203), pc_Drive_next^0 -> undef203, pc_Loop^0 -> 7, pc_Plan^0 -> (0 + undef206), pc_Plan_next^0 -> undef206, x^0 -> (0 + undef208), x_next^0 -> undef208, y^0 -> (0 + undef210), y_next^0 -> undef210}> 1, is_aborted^0 -> undef212, is_aborted_next^0 -> undef213, pc_Drive^0 -> (0 + undef217), pc_Drive_next^0 -> undef217, pc_Loop^0 -> 7, pc_Plan^0 -> (0 + undef220), pc_Plan_next^0 -> undef220, x^0 -> undef221, x_next^0 -> undef222, y^0 -> undef223, y_next^0 -> undef224}> undef226, is_aborted_next^0 -> undef227, pc_Drive^0 -> (0 + undef231), pc_Drive_next^0 -> undef231, pc_Loop^0 -> 7, pc_Plan^0 -> (0 + undef234), pc_Plan_next^0 -> undef234, x^0 -> undef235, x_next^0 -> undef236, y^0 -> undef237, y_next^0 -> undef238}> undef240, is_aborted_next^0 -> undef241, pc_Drive^0 -> (0 + undef245), pc_Drive_next^0 -> undef245, pc_Loop^0 -> 7, pc_Plan^0 -> (0 + undef248), pc_Plan_next^0 -> undef248, x^0 -> undef249, x_next^0 -> undef250, y^0 -> undef251, y_next^0 -> undef252}> undef253, is_aborted^0 -> undef254, is_aborted_next^0 -> undef255, pc_Drive^0 -> (0 + undef259), pc_Drive_next^0 -> undef259, pc_Loop^0 -> 2, pc_Plan^0 -> (0 + undef262), pc_Plan_next^0 -> undef262, x^0 -> undef263, x_next^0 -> undef264, y^0 -> undef265, y_next^0 -> undef266}> undef268, is_aborted_next^0 -> undef269, pc_Drive^0 -> (0 + undef273), pc_Drive_next^0 -> undef273, pc_Loop^0 -> 2, pc_Plan^0 -> (0 + undef276), pc_Plan_next^0 -> undef276, x^0 -> undef277, x_next^0 -> undef278, y^0 -> undef279, y_next^0 -> undef280}> undef282, is_aborted_next^0 -> undef283, pc_Drive^0 -> (0 + undef287), pc_Drive_next^0 -> undef287, pc_Loop^0 -> 2, pc_Plan^0 -> (0 + undef290), pc_Plan_next^0 -> undef290, x^0 -> undef291, x_next^0 -> undef292, y^0 -> undef293, y_next^0 -> undef294}> 1, is_aborted^0 -> undef296, is_aborted_next^0 -> undef297, pc_Drive^0 -> (0 + undef301), pc_Drive_next^0 -> undef301, pc_Loop^0 -> 6, pc_Plan^0 -> (0 + undef304), pc_Plan_next^0 -> undef304, x^0 -> (0 + undef306), x_next^0 -> undef306, y^0 -> (0 + undef308), y_next^0 -> undef308}> undef310, is_aborted_next^0 -> undef311, pc_Drive^0 -> (0 + undef315), pc_Drive_next^0 -> undef315, pc_Loop^0 -> 6, pc_Plan^0 -> (0 + undef318), pc_Plan_next^0 -> undef318, x^0 -> (0 + undef320), x_next^0 -> undef320, y^0 -> (0 + undef322), y_next^0 -> undef322}> undef324, is_aborted_next^0 -> undef325, pc_Drive^0 -> (0 + undef329), pc_Drive_next^0 -> undef329, pc_Loop^0 -> 6, pc_Plan^0 -> (0 + undef332), pc_Plan_next^0 -> undef332, x^0 -> (0 + undef334), x_next^0 -> undef334, y^0 -> (0 + undef336), y_next^0 -> undef336}> 1, is_aborted^0 -> undef338, is_aborted_next^0 -> undef339, pc_Drive^0 -> (0 + undef343), pc_Drive_next^0 -> undef343, pc_Loop^0 -> 3, pc_Plan^0 -> (0 + undef346), pc_Plan_next^0 -> undef346, x^0 -> (0 + undef348), x_next^0 -> undef348, y^0 -> (0 + undef350), y_next^0 -> undef350}> undef352, is_aborted_next^0 -> undef353, pc_Drive^0 -> (0 + undef357), pc_Drive_next^0 -> undef357, pc_Loop^0 -> 3, pc_Plan^0 -> (0 + undef360), pc_Plan_next^0 -> undef360, x^0 -> (0 + undef362), x_next^0 -> undef362, y^0 -> (0 + undef364), y_next^0 -> undef364}> undef366, is_aborted_next^0 -> undef367, pc_Drive^0 -> (0 + undef371), pc_Drive_next^0 -> undef371, pc_Loop^0 -> 3, pc_Plan^0 -> (0 + undef374), pc_Plan_next^0 -> undef374, x^0 -> (0 + undef376), x_next^0 -> undef376, y^0 -> (0 + undef378), y_next^0 -> undef378}> 1, is_aborted^0 -> undef380, is_aborted_next^0 -> undef381, pc_Drive^0 -> (0 + undef385), pc_Drive_next^0 -> undef385, pc_Loop^0 -> 7, pc_Plan^0 -> (0 + undef388), pc_Plan_next^0 -> undef388, x^0 -> (0 + undef390), x_next^0 -> undef390, y^0 -> (0 + undef392), y_next^0 -> undef392}> undef394, is_aborted_next^0 -> undef395, pc_Drive^0 -> (0 + undef399), pc_Drive_next^0 -> undef399, pc_Loop^0 -> 7, pc_Plan^0 -> (0 + undef402), pc_Plan_next^0 -> undef402, x^0 -> (0 + undef404), x_next^0 -> undef404, y^0 -> (0 + undef406), y_next^0 -> undef406}> undef408, is_aborted_next^0 -> undef409, pc_Drive^0 -> (0 + undef413), pc_Drive_next^0 -> undef413, pc_Loop^0 -> 7, pc_Plan^0 -> (0 + undef416), pc_Plan_next^0 -> undef416, x^0 -> (0 + undef418), x_next^0 -> undef418, y^0 -> (0 + undef420), y_next^0 -> undef420}> 1, is_aborted^0 -> undef422, is_aborted_next^0 -> undef423, pc_Drive^0 -> (0 + undef427), pc_Drive_next^0 -> undef427, pc_Loop^0 -> 2, pc_Plan^0 -> undef429, pc_Plan_next^0 -> undef430, x^0 -> (0 + undef432), x_next^0 -> undef432, y^0 -> (0 + undef434), y_next^0 -> undef434}> 0, is_aborted^0 -> undef436, is_aborted_next^0 -> undef437, pc_Drive^0 -> (0 + undef441), pc_Drive_next^0 -> undef441, pc_Loop^0 -> 2, pc_Plan^0 -> undef443, pc_Plan_next^0 -> undef444, x^0 -> (0 + undef446), x_next^0 -> undef446, y^0 -> (0 + undef448), y_next^0 -> undef448}> 0, is_aborted^0 -> undef450, is_aborted_next^0 -> undef451, pc_Drive^0 -> (0 + undef455), pc_Drive_next^0 -> undef455, pc_Loop^0 -> 2, pc_Plan^0 -> undef457, pc_Plan_next^0 -> undef458, x^0 -> (0 + undef460), x_next^0 -> undef460, y^0 -> (0 + undef462), y_next^0 -> undef462}> 1, is_aborted^0 -> undef464, is_aborted_next^0 -> undef465, pc_Drive^0 -> (0 + undef469), pc_Drive_next^0 -> undef469, pc_Loop^0 -> 7, pc_Plan^0 -> (0 + undef472), pc_Plan_next^0 -> undef472, x^0 -> (0 + undef474), x_next^0 -> undef474, y^0 -> (0 + undef476), y_next^0 -> undef476}> 0, is_aborted^0 -> undef478, is_aborted_next^0 -> undef479, pc_Drive^0 -> (0 + undef483), pc_Drive_next^0 -> undef483, pc_Loop^0 -> 7, pc_Plan^0 -> (0 + undef486), pc_Plan_next^0 -> undef486, x^0 -> (0 + undef488), x_next^0 -> undef488, y^0 -> (0 + undef490), y_next^0 -> undef490}> 0, is_aborted^0 -> undef492, is_aborted_next^0 -> undef493, pc_Drive^0 -> (0 + undef497), pc_Drive_next^0 -> undef497, pc_Loop^0 -> 7, pc_Plan^0 -> (0 + undef500), pc_Plan_next^0 -> undef500, x^0 -> (0 + undef502), x_next^0 -> undef502, y^0 -> (0 + undef504), y_next^0 -> undef504}> Fresh variables: undef3, undef7, undef9, undef10, undef12, undef14, undef17, undef21, undef23, undef24, undef26, undef28, undef31, undef35, undef37, undef38, undef40, undef42, undef45, undef49, undef51, undef52, undef54, undef56, undef59, undef63, undef65, undef66, undef68, undef70, undef73, undef77, undef79, undef80, undef82, undef84, undef85, undef87, undef90, undef91, undef94, undef96, undef98, undef101, undef104, undef105, undef108, undef110, undef112, undef115, undef118, undef119, undef122, undef124, undef126, undef129, undef132, undef133, undef136, undef138, undef140, undef143, undef146, undef147, undef150, undef152, undef154, undef157, undef160, undef161, undef164, undef166, undef168, undef170, undef171, undef175, undef178, undef180, undef182, undef184, undef185, undef189, undef192, undef194, undef196, undef198, undef199, undef203, undef206, undef208, undef210, undef212, undef213, undef217, undef220, undef221, undef222, undef223, undef224, undef226, undef227, undef231, undef234, undef235, undef236, undef237, undef238, undef240, undef241, undef245, undef248, undef249, undef250, undef251, undef252, undef253, undef254, undef255, undef259, undef262, undef263, undef264, undef265, undef266, undef268, undef269, undef273, undef276, undef277, undef278, undef279, undef280, undef282, undef283, undef287, undef290, undef291, undef292, undef293, undef294, undef296, undef297, undef301, undef304, undef306, undef308, undef310, undef311, undef315, undef318, undef320, undef322, undef324, undef325, undef329, undef332, undef334, undef336, undef338, undef339, undef343, undef346, undef348, undef350, undef352, undef353, undef357, undef360, undef362, undef364, undef366, undef367, undef371, undef374, undef376, undef378, undef380, undef381, undef385, undef388, undef390, undef392, undef394, undef395, undef399, undef402, undef404, undef406, undef408, undef409, undef413, undef416, undef418, undef420, undef422, undef423, undef427, undef429, undef430, undef432, undef434, undef436, undef437, undef441, undef443, undef444, undef446, undef448, undef450, undef451, undef455, undef457, undef458, undef460, undef462, undef464, undef465, undef469, undef472, undef474, undef476, undef478, undef479, undef483, undef486, undef488, undef490, undef492, undef493, undef497, undef500, undef502, undef504, Undef variables: undef3, undef7, undef9, undef10, undef12, undef14, undef17, undef21, undef23, undef24, undef26, undef28, undef31, undef35, undef37, undef38, undef40, undef42, undef45, undef49, undef51, undef52, undef54, undef56, undef59, undef63, undef65, undef66, undef68, undef70, undef73, undef77, undef79, undef80, undef82, undef84, undef85, undef87, undef90, undef91, undef94, undef96, undef98, undef101, undef104, undef105, undef108, undef110, undef112, undef115, undef118, undef119, undef122, undef124, undef126, undef129, undef132, undef133, undef136, undef138, undef140, undef143, undef146, undef147, undef150, undef152, undef154, undef157, undef160, undef161, undef164, undef166, undef168, undef170, undef171, undef175, undef178, undef180, undef182, undef184, undef185, undef189, undef192, undef194, undef196, undef198, undef199, undef203, undef206, undef208, undef210, undef212, undef213, undef217, undef220, undef221, undef222, undef223, undef224, undef226, undef227, undef231, undef234, undef235, undef236, undef237, undef238, undef240, undef241, undef245, undef248, undef249, undef250, undef251, undef252, undef253, undef254, undef255, undef259, undef262, undef263, undef264, undef265, undef266, undef268, undef269, undef273, undef276, undef277, undef278, undef279, undef280, undef282, undef283, undef287, undef290, undef291, undef292, undef293, undef294, undef296, undef297, undef301, undef304, undef306, undef308, undef310, undef311, undef315, undef318, undef320, undef322, undef324, undef325, undef329, undef332, undef334, undef336, undef338, undef339, undef343, undef346, undef348, undef350, undef352, undef353, undef357, undef360, undef362, undef364, undef366, undef367, undef371, undef374, undef376, undef378, undef380, undef381, undef385, undef388, undef390, undef392, undef394, undef395, undef399, undef402, undef404, undef406, undef408, undef409, undef413, undef416, undef418, undef420, undef422, undef423, undef427, undef429, undef430, undef432, undef434, undef436, undef437, undef441, undef443, undef444, undef446, undef448, undef450, undef451, undef455, undef457, undef458, undef460, undef462, undef464, undef465, undef469, undef472, undef474, undef476, undef478, undef479, undef483, undef486, undef488, undef490, undef492, undef493, undef497, undef500, undef502, undef504, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: 1, x^0 -> (0 + undef432), y^0 -> (0 + undef434)}> 0, x^0 -> (0 + undef446), y^0 -> (0 + undef448)}> 0, x^0 -> (0 + undef460), y^0 -> (0 + undef462)}> 1, x^0 -> (0 + undef474), y^0 -> (0 + undef476)}> 0, x^0 -> (0 + undef488), y^0 -> (0 + undef490)}> 0, x^0 -> (0 + undef502), y^0 -> (0 + undef504)}> 1, x^0 -> (0 + undef180), y^0 -> (0 + undef182)}> (0 + undef194), y^0 -> (0 + undef196)}> (0 + undef208), y^0 -> (0 + undef210)}> 1, x^0 -> undef221, y^0 -> undef223}> undef235, y^0 -> undef237}> undef249, y^0 -> undef251}> undef253, x^0 -> undef263, y^0 -> undef265}> undef277, y^0 -> undef279}> undef291, y^0 -> undef293}> 1, x^0 -> (0 + undef110), y^0 -> (0 + undef112)}> 0, x^0 -> (0 + undef166), y^0 -> (0 + undef168)}> 1, x^0 -> (0 + undef110), y^0 -> (0 + undef112)}> 0, x^0 -> (0 + undef166), y^0 -> (0 + undef168)}> 1, x^0 -> (0 + undef110), y^0 -> (0 + undef112)}> 0, x^0 -> (0 + undef166), y^0 -> (0 + undef168)}> 1, x^0 -> (0 + undef110), y^0 -> (0 + undef112)}> 0, x^0 -> (0 + undef166), y^0 -> (0 + undef168)}> (0 + undef110), y^0 -> (0 + undef112)}> 0, x^0 -> (0 + undef166), y^0 -> (0 + undef168)}> (0 + undef110), y^0 -> (0 + undef112)}> 0, x^0 -> (0 + undef166), y^0 -> (0 + undef168)}> 1, x^0 -> (0 + undef110), y^0 -> (0 + undef112)}> 0, x^0 -> (0 + undef166), y^0 -> (0 + undef168)}> (0 + undef110), y^0 -> (0 + undef112)}> 0, x^0 -> (0 + undef166), y^0 -> (0 + undef168)}> (0 + undef110), y^0 -> (0 + undef112)}> 0, x^0 -> (0 + undef166), y^0 -> (0 + undef168)}> 1, x^0 -> (0 + undef390), y^0 -> (0 + undef392)}> (0 + undef404), y^0 -> (0 + undef406)}> (0 + undef418), y^0 -> (0 + undef420)}> Fresh variables: undef3, undef7, undef9, undef10, undef12, undef14, undef17, undef21, undef23, undef24, undef26, undef28, undef31, undef35, undef37, undef38, undef40, undef42, undef45, undef49, undef51, undef52, undef54, undef56, undef59, undef63, undef65, undef66, undef68, undef70, undef73, undef77, undef79, undef80, undef82, undef84, undef85, undef87, undef90, undef91, undef94, undef96, undef98, undef101, undef104, undef105, undef108, undef110, undef112, undef115, undef118, undef119, undef122, undef124, undef126, undef129, undef132, undef133, undef136, undef138, undef140, undef143, undef146, undef147, undef150, undef152, undef154, undef157, undef160, undef161, undef164, undef166, undef168, undef170, undef171, undef175, undef178, undef180, undef182, undef184, undef185, undef189, undef192, undef194, undef196, undef198, undef199, undef203, undef206, undef208, undef210, undef212, undef213, undef217, undef220, undef221, undef222, undef223, undef224, undef226, undef227, undef231, undef234, undef235, undef236, undef237, undef238, undef240, undef241, undef245, undef248, undef249, undef250, undef251, undef252, undef253, undef254, undef255, undef259, undef262, undef263, undef264, undef265, undef266, undef268, undef269, undef273, undef276, undef277, undef278, undef279, undef280, undef282, undef283, undef287, undef290, undef291, undef292, undef293, undef294, undef296, undef297, undef301, undef304, undef306, undef308, undef310, undef311, undef315, undef318, undef320, undef322, undef324, undef325, undef329, undef332, undef334, undef336, undef338, undef339, undef343, undef346, undef348, undef350, undef352, undef353, undef357, undef360, undef362, undef364, undef366, undef367, undef371, undef374, undef376, undef378, undef380, undef381, undef385, undef388, undef390, undef392, undef394, undef395, undef399, undef402, undef404, undef406, undef408, undef409, undef413, undef416, undef418, undef420, undef422, undef423, undef427, undef429, undef430, undef432, undef434, undef436, undef437, undef441, undef443, undef444, undef446, undef448, undef450, undef451, undef455, undef457, undef458, undef460, undef462, undef464, undef465, undef469, undef472, undef474, undef476, undef478, undef479, undef483, undef486, undef488, undef490, undef492, undef493, undef497, undef500, undef502, undef504, Undef variables: undef3, undef7, undef9, undef10, undef12, undef14, undef17, undef21, undef23, undef24, undef26, undef28, undef31, undef35, undef37, undef38, undef40, undef42, undef45, undef49, undef51, undef52, undef54, undef56, undef59, undef63, undef65, undef66, undef68, undef70, undef73, undef77, undef79, undef80, undef82, undef84, undef85, undef87, undef90, undef91, undef94, undef96, undef98, undef101, undef104, undef105, undef108, undef110, undef112, undef115, undef118, undef119, undef122, undef124, undef126, undef129, undef132, undef133, undef136, undef138, undef140, undef143, undef146, undef147, undef150, undef152, undef154, undef157, undef160, undef161, undef164, undef166, undef168, undef170, undef171, undef175, undef178, undef180, undef182, undef184, undef185, undef189, undef192, undef194, undef196, undef198, undef199, undef203, undef206, undef208, undef210, undef212, undef213, undef217, undef220, undef221, undef222, undef223, undef224, undef226, undef227, undef231, undef234, undef235, undef236, undef237, undef238, undef240, undef241, undef245, undef248, undef249, undef250, undef251, undef252, undef253, undef254, undef255, undef259, undef262, undef263, undef264, undef265, undef266, undef268, undef269, undef273, undef276, undef277, undef278, undef279, undef280, undef282, undef283, undef287, undef290, undef291, undef292, undef293, undef294, undef296, undef297, undef301, undef304, undef306, undef308, undef310, undef311, undef315, undef318, undef320, undef322, undef324, undef325, undef329, undef332, undef334, undef336, undef338, undef339, undef343, undef346, undef348, undef350, undef352, undef353, undef357, undef360, undef362, undef364, undef366, undef367, undef371, undef374, undef376, undef378, undef380, undef381, undef385, undef388, undef390, undef392, undef394, undef395, undef399, undef402, undef404, undef406, undef408, undef409, undef413, undef416, undef418, undef420, undef422, undef423, undef427, undef429, undef430, undef432, undef434, undef436, undef437, undef441, undef443, undef444, undef446, undef448, undef450, undef451, undef455, undef457, undef458, undef460, undef462, undef464, undef465, undef469, undef472, undef474, undef476, undef478, undef479, undef483, undef486, undef488, undef490, undef492, undef493, undef497, undef500, undef502, undef504, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: undef253, x^0 -> undef263, y^0 -> undef265, rest remain the same}> undef277, y^0 -> undef279, rest remain the same}> undef291, y^0 -> undef293, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> Variables: executed_Drive^0, n0^0, n1^0, x^0, y^0 Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 1, x^0 -> undef432, y^0 -> undef434, rest remain the same}> 0, x^0 -> undef446, y^0 -> undef448, rest remain the same}> 0, x^0 -> undef460, y^0 -> undef462, rest remain the same}> Graph 2 1, x^0 -> undef474, y^0 -> undef476, rest remain the same}> 0, x^0 -> undef488, y^0 -> undef490, rest remain the same}> 0, x^0 -> undef502, y^0 -> undef504, rest remain the same}> 1, x^0 -> undef180, y^0 -> undef182, rest remain the same}> undef194, y^0 -> undef196, rest remain the same}> undef208, y^0 -> undef210, rest remain the same}> 1, x^0 -> undef221, y^0 -> undef223, rest remain the same}> undef235, y^0 -> undef237, rest remain the same}> undef249, y^0 -> undef251, rest remain the same}> 1, x^0 -> undef390, y^0 -> undef392, rest remain the same}> undef404, y^0 -> undef406, rest remain the same}> undef418, y^0 -> undef420, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 1 , 2 ) ( 4 , 1 ) ( 5 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.172335 Checking conditional termination of SCC {l4, l5}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.084626s Ranking function: -81 + 39*n0^0 + 19*n1^0 - 39*x^0 - 19*y^0 New Graphs: Transitions: 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> Variables: executed_Drive^0, n0^0, n1^0, x^0, y^0 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.415680s Ranking function: -10 + 5*n0^0 + 5*n1^0 - 5*x^0 - 5*y^0 New Graphs: Transitions: undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> Variables: executed_Drive^0, n0^0, n1^0, x^0, y^0 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.123594s Ranking function: -11 + executed_Drive^0 + 5*n0^0 + 5*n1^0 - 5*x^0 - 5*y^0 New Graphs: Transitions: undef110, y^0 -> undef112, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> Variables: executed_Drive^0, n0^0, n1^0, x^0, y^0 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.080077s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.262898s [41813 : 41814] [41813 : 41815] Successful child: 41814 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef253, x^0 -> undef263, y^0 -> undef265, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef277, y^0 -> undef279, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef291, y^0 -> undef293, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef110, y^0 -> undef112, rest remain the same}> New Graphs: [41813 : 41819] [41813 : 41820] [41813 : 41821] INVARIANTS: 4: 5: Quasi-INVARIANTS to narrow Graph: 4: 1 + n0^0 <= 0 , 5: 1 + n0^0 <= 0 , Narrowing transition: undef253, x^0 -> undef263, y^0 -> undef265, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef277, y^0 -> undef279, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef291, y^0 -> undef293, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef253, x^0 -> undef263, y^0 -> undef265, rest remain the same}> undef277, y^0 -> undef279, rest remain the same}> undef291, y^0 -> undef293, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> Variables: executed_Drive^0, n0^0, n1^0, x^0, y^0 Checking conditional termination of SCC {l4, l5}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.093739s Ranking function: -82 + 4*n0^0 + 51*n1^0 - 4*x^0 - 51*y^0 New Graphs: Transitions: 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> Variables: executed_Drive^0, n0^0, n1^0, x^0, y^0 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.418907s Ranking function: -10 + 5*n0^0 + 5*n1^0 - 5*x^0 - 5*y^0 New Graphs: Transitions: undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> Variables: executed_Drive^0, n0^0, n1^0, x^0, y^0 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.121183s Ranking function: -11 + executed_Drive^0 + 5*n0^0 + 5*n1^0 - 5*x^0 - 5*y^0 New Graphs: Transitions: undef110, y^0 -> undef112, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> Variables: executed_Drive^0, n0^0, n1^0, x^0, y^0 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.079795s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.265616s [41813 : 41822] [41813 : 41823] Successful child: 41822 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef253, x^0 -> undef263, y^0 -> undef265, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef277, y^0 -> undef279, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef291, y^0 -> undef293, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef110, y^0 -> undef112, rest remain the same}> New Graphs: [41813 : 41827] [41813 : 41828] [41813 : 41829] INVARIANTS: 4: 5: Quasi-INVARIANTS to narrow Graph: 4: n0^0 + n1^0 <= 1 + x^0 , 5: n0^0 + n1^0 <= 1 + x^0 , Narrowing transition: undef253, x^0 -> undef263, y^0 -> undef265, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef277, y^0 -> undef279, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef291, y^0 -> undef293, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef253, x^0 -> undef263, y^0 -> undef265, rest remain the same}> undef277, y^0 -> undef279, rest remain the same}> undef291, y^0 -> undef293, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> Variables: executed_Drive^0, n0^0, n1^0, x^0, y^0 Checking conditional termination of SCC {l4, l5}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.182566s Ranking function: -97 + 67*n0^0 + 7*n1^0 - 16*x^0 - 7*y^0 New Graphs: Transitions: 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> Variables: executed_Drive^0, n0^0, n1^0, x^0, y^0 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.491107s Ranking function: -8 + 3*n0^0 + 5*n1^0 - 3*x^0 - 5*y^0 New Graphs: Transitions: undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> Variables: executed_Drive^0, n0^0, n1^0, x^0, y^0 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.131235s Ranking function: -9 + executed_Drive^0 + 3*n0^0 + 5*n1^0 - 3*x^0 - 5*y^0 New Graphs: Transitions: undef110, y^0 -> undef112, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> Variables: executed_Drive^0, n0^0, n1^0, x^0, y^0 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.082486s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.291507s [41813 : 41830] [41813 : 41831] Successful child: 41830 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef253, x^0 -> undef263, y^0 -> undef265, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef277, y^0 -> undef279, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef291, y^0 -> undef293, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef110, y^0 -> undef112, rest remain the same}> New Graphs: [41813 : 41835] [41813 : 41836] [41813 : 41837] INVARIANTS: 4: 5: Quasi-INVARIANTS to narrow Graph: 4: n0^0 <= 0 , 5: n0^0 <= 0 , Narrowing transition: undef253, x^0 -> undef263, y^0 -> undef265, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef277, y^0 -> undef279, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef291, y^0 -> undef293, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef253, x^0 -> undef263, y^0 -> undef265, rest remain the same}> undef277, y^0 -> undef279, rest remain the same}> undef291, y^0 -> undef293, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> Variables: executed_Drive^0, n0^0, n1^0, x^0, y^0 Checking conditional termination of SCC {l4, l5}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.159105s Ranking function: -166 + 46*n0^0 + 37*n1^0 - 46*x^0 - 37*y^0 New Graphs: Transitions: 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> Variables: executed_Drive^0, n0^0, n1^0, x^0, y^0 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.495767s Ranking function: -8 + 3*n0^0 + 5*n1^0 - 3*x^0 - 5*y^0 New Graphs: Transitions: undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> Variables: executed_Drive^0, n0^0, n1^0, x^0, y^0 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.134230s Ranking function: -9 + executed_Drive^0 + 3*n0^0 + 5*n1^0 - 3*x^0 - 5*y^0 New Graphs: Transitions: undef110, y^0 -> undef112, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> Variables: executed_Drive^0, n0^0, n1^0, x^0, y^0 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.084850s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.295581s [41813 : 41838] [41813 : 41839] Successful child: 41838 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef253, x^0 -> undef263, y^0 -> undef265, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef277, y^0 -> undef279, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef291, y^0 -> undef293, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef110, y^0 -> undef112, rest remain the same}> New Graphs: [41813 : 41951] [41813 : 41952] [41813 : 41953] INVARIANTS: 4: 5: Quasi-INVARIANTS to narrow Graph: 4: n0^0 + n1^0 <= 1 , 5: n0^0 + n1^0 <= 1 , Narrowing transition: undef253, x^0 -> undef263, y^0 -> undef265, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef277, y^0 -> undef279, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef291, y^0 -> undef293, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef253, x^0 -> undef263, y^0 -> undef265, rest remain the same}> undef277, y^0 -> undef279, rest remain the same}> undef291, y^0 -> undef293, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> Variables: executed_Drive^0, n0^0, n1^0, x^0, y^0 Checking conditional termination of SCC {l4, l5}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.208229s Ranking function: -258 + 64*n0^0 + 65*n1^0 - 64*x^0 - 65*y^0 New Graphs: Transitions: 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> Variables: executed_Drive^0, n0^0, n1^0, x^0, y^0 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.489113s Ranking function: -8 + 3*n0^0 + 5*n1^0 - 3*x^0 - 5*y^0 New Graphs: Transitions: undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> Variables: executed_Drive^0, n0^0, n1^0, x^0, y^0 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.132284s Ranking function: -12 + executed_Drive^0 + 3*n0^0 + 8*n1^0 - 3*x^0 - 5*y^0 New Graphs: Transitions: undef110, y^0 -> undef112, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> Variables: executed_Drive^0, n0^0, n1^0, x^0, y^0 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.087185s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.302703s [41813 : 41954] [41813 : 41955] Successful child: 41954 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef253, x^0 -> undef263, y^0 -> undef265, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef277, y^0 -> undef279, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef291, y^0 -> undef293, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef110, y^0 -> undef112, rest remain the same}> New Graphs: [41813 : 41959] [41813 : 41960] [41813 : 41961] INVARIANTS: 4: 5: Quasi-INVARIANTS to narrow Graph: 4: n0^0 + n1^0 <= 1 + y^0 , 5: n0^0 + n1^0 <= 1 + y^0 , Narrowing transition: undef253, x^0 -> undef263, y^0 -> undef265, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef277, y^0 -> undef279, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef291, y^0 -> undef293, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef253, x^0 -> undef263, y^0 -> undef265, rest remain the same}> undef277, y^0 -> undef279, rest remain the same}> undef291, y^0 -> undef293, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> Variables: executed_Drive^0, n0^0, n1^0, x^0, y^0 Checking conditional termination of SCC {l4, l5}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.231946s Ranking function: -244 + 80*n0^0 + 81*n1^0 - 80*x^0 - 3*y^0 New Graphs: Transitions: 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> Variables: executed_Drive^0, n0^0, n1^0, x^0, y^0 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.537018s Ranking function: -6 + 3*n0^0 + 3*n1^0 - 3*x^0 - 3*y^0 New Graphs: Transitions: undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> Variables: executed_Drive^0, n0^0, n1^0, x^0, y^0 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.148740s Ranking function: -7 + executed_Drive^0 + 3*n0^0 + 3*n1^0 - 3*x^0 - 3*y^0 New Graphs: Transitions: undef110, y^0 -> undef112, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> Variables: executed_Drive^0, n0^0, n1^0, x^0, y^0 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.089549s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.316606s [41813 : 41962] [41813 : 41963] Successful child: 41962 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef253, x^0 -> undef263, y^0 -> undef265, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef277, y^0 -> undef279, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef291, y^0 -> undef293, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef110, y^0 -> undef112, rest remain the same}> New Graphs: [41813 : 41967] [41813 : 41968] [41813 : 41969] INVARIANTS: 4: 5: Quasi-INVARIANTS to narrow Graph: 4: n0^0 + n1^0 <= 1 + x^0 + y^0 , 5: n0^0 + n1^0 <= 1 + x^0 + y^0 , Narrowing transition: undef253, x^0 -> undef263, y^0 -> undef265, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef277, y^0 -> undef279, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef291, y^0 -> undef293, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef253, x^0 -> undef263, y^0 -> undef265, rest remain the same}> undef277, y^0 -> undef279, rest remain the same}> undef291, y^0 -> undef293, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> Variables: executed_Drive^0, n0^0, n1^0, x^0, y^0 Checking conditional termination of SCC {l4, l5}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.232328s Ranking function: -166 + 41*n0^0 + 42*n1^0 - 41*x^0 - 42*y^0 New Graphs: Transitions: 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> Variables: executed_Drive^0, n0^0, n1^0, x^0, y^0 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.682769s Ranking function: -2 + n0^0 + n1^0 - x^0 - y^0 New Graphs: Transitions: undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> Variables: executed_Drive^0, n0^0, n1^0, x^0, y^0 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.155784s Ranking function: -3 + executed_Drive^0 + n0^0 + n1^0 - x^0 - y^0 New Graphs: Transitions: undef110, y^0 -> undef112, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> Variables: executed_Drive^0, n0^0, n1^0, x^0, y^0 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.094406s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.340560s [41813 : 41970] [41813 : 41971] Successful child: 41970 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef253, x^0 -> undef263, y^0 -> undef265, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef277, y^0 -> undef279, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef291, y^0 -> undef293, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef110, y^0 -> undef112, rest remain the same}> New Graphs: [41813 : 41975] [41813 : 41976] [41813 : 41977] INVARIANTS: 4: 5: Quasi-INVARIANTS to narrow Graph: 4: 1 + n1^0 <= 0 , 5: 1 + n1^0 <= 0 , Narrowing transition: undef253, x^0 -> undef263, y^0 -> undef265, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef277, y^0 -> undef279, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef291, y^0 -> undef293, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef253, x^0 -> undef263, y^0 -> undef265, rest remain the same}> undef277, y^0 -> undef279, rest remain the same}> undef291, y^0 -> undef293, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> Variables: executed_Drive^0, n0^0, n1^0, x^0, y^0 Checking conditional termination of SCC {l4, l5}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.407887s Ranking function: -79 + 2*n0^0 + (77 / 2)*n1^0 - 2*x^0 + (~(73) / 2)*y^0 New Graphs: Transitions: 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> Variables: executed_Drive^0, n0^0, n1^0, x^0, y^0 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.691429s Ranking function: -2 + n0^0 + n1^0 - x^0 - y^0 New Graphs: Transitions: undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> Variables: executed_Drive^0, n0^0, n1^0, x^0, y^0 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.159316s Ranking function: -3 + executed_Drive^0 + n0^0 + n1^0 - x^0 - y^0 New Graphs: Transitions: undef110, y^0 -> undef112, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> Variables: executed_Drive^0, n0^0, n1^0, x^0, y^0 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.093587s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.344582s [41813 : 41978] [41813 : 41979] Successful child: 41978 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef253, x^0 -> undef263, y^0 -> undef265, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef277, y^0 -> undef279, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef291, y^0 -> undef293, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef110, y^0 -> undef112, rest remain the same}> New Graphs: [41813 : 41983] [41813 : 41984] [41813 : 41985] INVARIANTS: 4: 5: Quasi-INVARIANTS to narrow Graph: 4: n0^0 <= x^0 , 5: n0^0 <= x^0 , Narrowing transition: undef253, x^0 -> undef263, y^0 -> undef265, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef277, y^0 -> undef279, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef291, y^0 -> undef293, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef253, x^0 -> undef263, y^0 -> undef265, rest remain the same}> undef277, y^0 -> undef279, rest remain the same}> undef291, y^0 -> undef293, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> Variables: executed_Drive^0, n0^0, n1^0, x^0, y^0 Checking conditional termination of SCC {l4, l5}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.496043s Ranking function: -152 + 74*n0^0 + 51*n1^0 - 25*x^0 - 2*y^0 New Graphs: Transitions: 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> Variables: executed_Drive^0, n0^0, n1^0, x^0, y^0 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.733006s Ranking function: -2 + n0^0 + n1^0 - y^0 New Graphs: Transitions: undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> Variables: executed_Drive^0, n0^0, n1^0, x^0, y^0 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.161024s Ranking function: -2 + executed_Drive^0 + n1^0 - y^0 New Graphs: Transitions: undef110, y^0 -> undef112, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> Variables: executed_Drive^0, n0^0, n1^0, x^0, y^0 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.095114s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.331771s [41813 : 41986] [41813 : 41987] Successful child: 41986 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef253, x^0 -> undef263, y^0 -> undef265, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef277, y^0 -> undef279, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef291, y^0 -> undef293, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef110, y^0 -> undef112, rest remain the same}> New Graphs: [41813 : 41991] [41813 : 41992] [41813 : 41993] INVARIANTS: 4: 5: Quasi-INVARIANTS to narrow Graph: 4: n1^0 <= 0 , 5: n1^0 <= 0 , Narrowing transition: undef253, x^0 -> undef263, y^0 -> undef265, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef277, y^0 -> undef279, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef291, y^0 -> undef293, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef253, x^0 -> undef263, y^0 -> undef265, rest remain the same}> undef277, y^0 -> undef279, rest remain the same}> undef291, y^0 -> undef293, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> Variables: executed_Drive^0, n0^0, n1^0, x^0, y^0 Checking conditional termination of SCC {l4, l5}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.232007s Ranking function: -166 + 83*n1^0 - 83*y^0 New Graphs: Transitions: 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> Variables: executed_Drive^0, n0^0, n1^0, x^0, y^0 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.741517s Ranking function: -2 + n0^0 + n1^0 - y^0 New Graphs: Transitions: undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> Variables: executed_Drive^0, n0^0, n1^0, x^0, y^0 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.163661s Ranking function: -2 + executed_Drive^0 + n1^0 - y^0 New Graphs: Transitions: undef110, y^0 -> undef112, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> Variables: executed_Drive^0, n0^0, n1^0, x^0, y^0 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.096540s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.339303s [41813 : 41994] [41813 : 41995] Successful child: 41994 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef253, x^0 -> undef263, y^0 -> undef265, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef277, y^0 -> undef279, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef291, y^0 -> undef293, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef110, y^0 -> undef112, rest remain the same}> New Graphs: [41813 : 41999] [41813 : 42000] [41813 : 42001] INVARIANTS: 4: 5: Quasi-INVARIANTS to narrow Graph: 4: n1^0 <= y^0 , 5: n1^0 <= y^0 , Narrowing transition: undef253, x^0 -> undef263, y^0 -> undef265, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef277, y^0 -> undef279, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef291, y^0 -> undef293, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef110, y^0 -> undef112, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef253, x^0 -> undef263, y^0 -> undef265, rest remain the same}> undef277, y^0 -> undef279, rest remain the same}> undef291, y^0 -> undef293, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> Variables: executed_Drive^0, n0^0, n1^0, x^0, y^0 Checking conditional termination of SCC {l4, l5}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.190896s Ranking function: -166 + n0^0 + 82*n1^0 - x^0 - 82*y^0 New Graphs: Transitions: 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> 1, x^0 -> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> Variables: executed_Drive^0, n0^0, n1^0, x^0, y^0 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.773487s Ranking function: (~(1) / 2) + (1 / 2)*n0^0 + (~(1) / 2)*x^0 New Graphs: Transitions: undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> 0, x^0 -> undef166, y^0 -> undef168, rest remain the same}> Variables: executed_Drive^0, n0^0, n1^0, x^0, y^0 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.161293s Ranking function: -1 + executed_Drive^0 New Graphs: Transitions: undef110, y^0 -> undef112, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> undef110, y^0 -> undef112, rest remain the same}> Variables: executed_Drive^0, n0^0, n1^0, x^0, y^0 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.097707s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.355003s [41813 : 42002] [41813 : 42003] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.603735s Time used: 0.592921 [41813 : 42047] [41813 : 42048] Successful child: 42048 Program does NOT terminate