./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label24_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_fc0f74cf-fc18-4d9b-95da-2b694b7c3ce8/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_fc0f74cf-fc18-4d9b-95da-2b694b7c3ce8/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_fc0f74cf-fc18-4d9b-95da-2b694b7c3ce8/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_fc0f74cf-fc18-4d9b-95da-2b694b7c3ce8/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label24_true-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_fc0f74cf-fc18-4d9b-95da-2b694b7c3ce8/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_fc0f74cf-fc18-4d9b-95da-2b694b7c3ce8/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ae8b9d15518dcb8efb3092579c510710d5de6c08 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 06:06:02,926 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:06:02,927 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:06:02,937 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:06:02,937 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:06:02,938 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:06:02,939 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:06:02,940 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:06:02,941 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:06:02,942 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:06:02,943 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:06:02,943 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:06:02,944 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:06:02,945 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:06:02,945 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:06:02,947 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:06:02,947 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:06:02,948 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:06:02,950 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:06:02,951 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:06:02,952 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:06:02,953 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:06:02,955 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:06:02,955 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:06:02,956 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:06:02,956 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:06:02,957 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:06:02,958 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:06:02,959 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:06:02,960 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:06:02,960 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:06:02,961 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:06:02,961 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:06:02,961 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:06:02,963 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:06:02,963 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:06:02,964 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_fc0f74cf-fc18-4d9b-95da-2b694b7c3ce8/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-10-27 06:06:02,975 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:06:02,975 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:06:02,976 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:06:02,976 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:06:02,977 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:06:02,977 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:06:02,977 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:06:02,977 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:06:02,977 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:06:02,977 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:06:02,978 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:06:02,978 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:06:02,979 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-27 06:06:02,979 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:06:02,979 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:06:02,979 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-27 06:06:02,979 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:06:02,979 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:06:02,979 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:06:02,979 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:06:02,979 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-27 06:06:02,980 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:06:02,980 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:06:02,980 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:06:02,980 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:06:02,980 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:06:02,980 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:06:02,980 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:06:02,981 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:06:02,981 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:06:02,984 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:06:02,984 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_fc0f74cf-fc18-4d9b-95da-2b694b7c3ce8/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ae8b9d15518dcb8efb3092579c510710d5de6c08 [2018-10-27 06:06:03,009 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:06:03,019 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:06:03,022 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:06:03,024 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:06:03,024 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:06:03,025 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_fc0f74cf-fc18-4d9b-95da-2b694b7c3ce8/bin-2019/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem02_label24_true-unreach-call_false-termination.c [2018-10-27 06:06:03,071 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fc0f74cf-fc18-4d9b-95da-2b694b7c3ce8/bin-2019/uautomizer/data/f90da94b4/2e8cb3ffb1f345dcba92f5e38a37f885/FLAG91017bfaa [2018-10-27 06:06:03,508 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:06:03,508 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_fc0f74cf-fc18-4d9b-95da-2b694b7c3ce8/sv-benchmarks/c/eca-rers2012/Problem02_label24_true-unreach-call_false-termination.c [2018-10-27 06:06:03,517 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fc0f74cf-fc18-4d9b-95da-2b694b7c3ce8/bin-2019/uautomizer/data/f90da94b4/2e8cb3ffb1f345dcba92f5e38a37f885/FLAG91017bfaa [2018-10-27 06:06:03,531 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_fc0f74cf-fc18-4d9b-95da-2b694b7c3ce8/bin-2019/uautomizer/data/f90da94b4/2e8cb3ffb1f345dcba92f5e38a37f885 [2018-10-27 06:06:03,534 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:06:03,535 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:06:03,536 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:06:03,536 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:06:03,539 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:06:03,540 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:06:03" (1/1) ... [2018-10-27 06:06:03,542 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@257de187 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:03, skipping insertion in model container [2018-10-27 06:06:03,542 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:06:03" (1/1) ... [2018-10-27 06:06:03,550 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:06:03,587 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:06:03,911 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:06:03,915 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:06:04,005 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:06:04,019 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:06:04,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:04 WrapperNode [2018-10-27 06:06:04,019 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:06:04,020 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:06:04,020 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:06:04,020 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:06:04,028 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:04" (1/1) ... [2018-10-27 06:06:04,058 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:04" (1/1) ... [2018-10-27 06:06:04,233 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:06:04,233 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:06:04,234 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:06:04,234 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:06:04,243 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:04" (1/1) ... [2018-10-27 06:06:04,243 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:04" (1/1) ... [2018-10-27 06:06:04,257 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:04" (1/1) ... [2018-10-27 06:06:04,257 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:04" (1/1) ... [2018-10-27 06:06:04,276 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:04" (1/1) ... [2018-10-27 06:06:04,283 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:04" (1/1) ... [2018-10-27 06:06:04,299 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:04" (1/1) ... [2018-10-27 06:06:04,303 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:06:04,304 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:06:04,304 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:06:04,304 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:06:04,305 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fc0f74cf-fc18-4d9b-95da-2b694b7c3ce8/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:04,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:06:04,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:06:07,101 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:06:07,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:06:07 BoogieIcfgContainer [2018-10-27 06:06:07,101 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:06:07,102 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:06:07,102 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:06:07,104 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:06:07,105 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:06:07,105 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:06:03" (1/3) ... [2018-10-27 06:06:07,106 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1d8cdad4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:06:07, skipping insertion in model container [2018-10-27 06:06:07,106 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:06:07,107 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:04" (2/3) ... [2018-10-27 06:06:07,107 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1d8cdad4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:06:07, skipping insertion in model container [2018-10-27 06:06:07,107 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:06:07,107 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:06:07" (3/3) ... [2018-10-27 06:06:07,109 INFO L375 chiAutomizerObserver]: Analyzing ICFG Problem02_label24_true-unreach-call_false-termination.c [2018-10-27 06:06:07,169 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:06:07,171 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:06:07,171 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:06:07,171 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:06:07,171 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:06:07,172 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:06:07,172 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:06:07,172 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:06:07,172 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:06:07,202 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 227 states. [2018-10-27 06:06:07,239 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 222 [2018-10-27 06:06:07,241 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:07,241 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:07,250 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:06:07,250 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:06:07,250 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:06:07,250 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 227 states. [2018-10-27 06:06:07,257 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 222 [2018-10-27 06:06:07,261 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:07,262 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:07,263 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:06:07,264 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:06:07,272 INFO L793 eck$LassoCheckResult]: Stem: 78#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 167#L606-3true [2018-10-27 06:06:07,272 INFO L795 eck$LassoCheckResult]: Loop: 167#L606-3true assume true; 163#L606-1true assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 65#L611true assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 192#L30true assume ((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 207#L597true main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 167#L606-3true [2018-10-27 06:06:07,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:07,280 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-10-27 06:06:07,281 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:07,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:07,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:07,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:07,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:07,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:07,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:07,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:07,372 INFO L82 PathProgramCache]: Analyzing trace with hash 34545679, now seen corresponding path program 1 times [2018-10-27 06:06:07,373 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:07,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:07,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:07,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:07,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:07,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:07,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:07,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:07,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1805985165, now seen corresponding path program 1 times [2018-10-27 06:06:07,397 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:07,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:07,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:07,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:07,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:07,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:07,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:06:07,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:06:07,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 06:06:07,966 WARN L179 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2018-10-27 06:06:08,074 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-10-27 06:06:08,083 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:06:08,084 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:06:08,084 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:06:08,084 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:06:08,085 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-10-27 06:06:08,085 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:08,085 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:06:08,085 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:06:08,085 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label24_true-unreach-call_false-termination.c_Iteration1_Loop [2018-10-27 06:06:08,085 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:06:08,086 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:06:08,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:08,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:08,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:08,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:08,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:08,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:08,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:08,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:08,533 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-10-27 06:06:08,702 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:06:08,703 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fc0f74cf-fc18-4d9b-95da-2b694b7c3ce8/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:08,707 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:06:08,707 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:06:08,726 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:06:08,726 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a17~0=8} Honda state: {~a17~0=8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fc0f74cf-fc18-4d9b-95da-2b694b7c3ce8/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:08,730 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:06:08,730 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:06:08,739 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:06:08,739 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a25~0=1, ~a28~0=9} Honda state: {~a25~0=1, ~a28~0=9} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fc0f74cf-fc18-4d9b-95da-2b694b7c3ce8/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:08,757 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:06:08,758 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:06:08,792 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:06:08,792 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a19~0=1} Honda state: {~a19~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fc0f74cf-fc18-4d9b-95da-2b694b7c3ce8/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:08,878 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:06:08,878 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:06:08,884 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:06:08,884 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#res=-1, ULTIMATE.start_main_~output~0=-1} Honda state: {ULTIMATE.start_calculate_output_#res=-1, ULTIMATE.start_main_~output~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fc0f74cf-fc18-4d9b-95da-2b694b7c3ce8/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:08,909 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:06:08,909 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:06:08,926 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:06:08,926 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a21~0=1} Honda state: {~a21~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fc0f74cf-fc18-4d9b-95da-2b694b7c3ce8/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:08,934 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:06:08,934 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:06:08,942 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:06:08,942 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret3=0} Honda state: {ULTIMATE.start_main_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fc0f74cf-fc18-4d9b-95da-2b694b7c3ce8/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:08,960 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:06:08,960 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:06:08,966 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:06:08,966 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~input~0=4, ULTIMATE.start_main_#t~nondet2=4, ULTIMATE.start_calculate_output_~input=4, ULTIMATE.start_calculate_output_#in~input=4} Honda state: {ULTIMATE.start_main_~input~0=4, ULTIMATE.start_main_#t~nondet2=4, ULTIMATE.start_calculate_output_~input=4, ULTIMATE.start_calculate_output_#in~input=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fc0f74cf-fc18-4d9b-95da-2b694b7c3ce8/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:08,983 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:06:08,983 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fc0f74cf-fc18-4d9b-95da-2b694b7c3ce8/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:09,003 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-10-27 06:06:09,004 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:06:09,038 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-10-27 06:06:09,039 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:06:09,039 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:06:09,039 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:06:09,039 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:06:09,040 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:06:09,040 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:09,040 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:06:09,040 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:06:09,040 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label24_true-unreach-call_false-termination.c_Iteration1_Loop [2018-10-27 06:06:09,040 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:06:09,040 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:06:09,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:09,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:09,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:09,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:09,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:09,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:09,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:09,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:09,556 WARN L179 SmtUtils]: Spent 296.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-10-27 06:06:10,003 WARN L179 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-27 06:06:10,004 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:06:10,008 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:06:10,009 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:10,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:10,011 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:10,011 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:10,011 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:10,011 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:10,013 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:10,013 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:10,025 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:10,025 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:10,027 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:10,027 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:10,027 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:10,027 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:10,027 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:10,028 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:10,028 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:10,033 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:10,034 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:10,034 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:10,035 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:10,035 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:10,035 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-10-27 06:06:10,035 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:10,037 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:10,037 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:10,066 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:10,068 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:10,069 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:10,070 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:10,070 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:10,070 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:10,070 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:10,071 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:10,071 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:10,076 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:10,077 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:10,077 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:10,077 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:10,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:10,078 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:10,078 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:10,079 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:10,079 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:10,081 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:10,081 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:10,086 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:10,086 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:10,086 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:10,086 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:10,086 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:10,087 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:10,087 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:10,088 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:10,089 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:10,089 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:10,089 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:10,089 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:10,093 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:10,094 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:10,094 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:10,094 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:10,095 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:10,096 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:10,096 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:10,096 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:10,096 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:10,097 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:06:10,097 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:10,102 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:06:10,102 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:10,112 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:10,118 INFO L496 LassoAnalysis]: Using template '2-nested'. [2018-10-27 06:06:10,118 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:10,119 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:10,119 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:10,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:10,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:10,120 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:06:10,121 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:06:10,121 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:10,130 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:10,130 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:10,131 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:10,131 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:10,131 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:10,131 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:10,131 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:06:10,132 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:06:10,132 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:10,137 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:10,137 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:10,138 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:10,138 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:10,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:10,138 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-10-27 06:06:10,138 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:06:10,140 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-10-27 06:06:10,140 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:10,158 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:10,158 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:10,159 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:10,159 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:10,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:10,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:10,160 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:06:10,160 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:06:10,160 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:10,167 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:10,167 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:10,167 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:10,168 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:10,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:10,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:10,168 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:06:10,169 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:06:10,169 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:10,173 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:10,173 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:10,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:10,174 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:10,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:10,174 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:10,174 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:06:10,175 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:06:10,175 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:10,177 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:10,180 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:10,180 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:10,180 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:10,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:10,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:10,181 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:06:10,181 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:06:10,181 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:10,182 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:10,183 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:10,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:10,183 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:10,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:10,184 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:06:10,184 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:06:10,184 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:10,185 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:10,194 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:10,194 INFO L496 LassoAnalysis]: Using template '3-nested'. [2018-10-27 06:06:10,194 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:10,195 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:10,195 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:10,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:10,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:10,196 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:06:10,197 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:06:10,197 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:10,215 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:10,215 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:10,216 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:10,216 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:10,216 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:10,216 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:10,216 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:06:10,217 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:06:10,217 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:10,223 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:10,223 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:10,224 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:10,224 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:10,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:10,224 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-10-27 06:06:10,225 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:06:10,228 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-10-27 06:06:10,229 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:10,245 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:10,246 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:10,246 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:10,246 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:10,247 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:10,247 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:10,247 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:06:10,248 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:06:10,248 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:10,258 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:10,259 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:10,261 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:10,261 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:10,261 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:10,261 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:10,262 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:06:10,262 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:06:10,262 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:10,264 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:10,265 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:10,265 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:10,265 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:10,269 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:10,270 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:10,270 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:06:10,270 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:06:10,270 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:10,274 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:10,275 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:10,278 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:10,278 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:10,278 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:10,278 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:10,278 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:06:10,279 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:06:10,279 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:10,280 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:10,280 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:10,280 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:10,280 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:10,281 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:10,281 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:06:10,281 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:06:10,285 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:06:10,285 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:10,297 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:10,297 INFO L496 LassoAnalysis]: Using template '4-nested'. [2018-10-27 06:06:10,298 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:10,298 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:10,298 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:10,299 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:10,299 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:10,299 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:06:10,300 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:06:10,300 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:10,330 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:10,332 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:10,336 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:10,336 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:10,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:10,337 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:10,337 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:06:10,337 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:06:10,341 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:10,344 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:10,344 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:10,345 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:10,345 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:10,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:10,345 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-10-27 06:06:10,345 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:06:10,349 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-10-27 06:06:10,349 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:10,364 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:10,365 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:10,367 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:10,367 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:10,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:10,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:10,367 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:06:10,368 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:06:10,368 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:10,372 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:10,372 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:10,373 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:10,373 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:10,373 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:10,373 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:10,376 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:06:10,377 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:06:10,377 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:10,380 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:10,380 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:10,380 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:10,380 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:10,381 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:10,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:10,383 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:06:10,383 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:06:10,383 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:10,385 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:10,387 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:10,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:10,387 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:10,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:10,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:10,388 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:06:10,388 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:06:10,388 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:10,389 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:10,389 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:10,393 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:10,393 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:10,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:10,394 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:06:10,394 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:06:10,394 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-10-27 06:06:10,395 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:10,400 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:10,401 INFO L496 LassoAnalysis]: Using template '2-phase'. [2018-10-27 06:06:10,401 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:10,401 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:06:10,402 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:06:10,402 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:10,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:10,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:10,402 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:06:10,403 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:06:10,403 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:10,419 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:10,419 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:10,420 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:06:10,420 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:06:10,420 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:10,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:10,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:10,420 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:06:10,421 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:06:10,421 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:10,427 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:10,427 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:10,427 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:06:10,428 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:06:10,428 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:10,428 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:10,428 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-10-27 06:06:10,428 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:06:10,433 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-10-27 06:06:10,433 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:10,464 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:10,465 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:10,467 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:06:10,467 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:06:10,467 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:10,467 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:10,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:10,467 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:06:10,468 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:06:10,468 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:10,472 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:10,472 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:10,473 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:06:10,473 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:06:10,473 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:10,473 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:10,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:10,477 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:06:10,477 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:06:10,477 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:10,480 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:10,480 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:10,481 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:06:10,481 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:06:10,481 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:10,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:10,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:10,481 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:06:10,485 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:06:10,485 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:10,487 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:10,487 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:10,488 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:06:10,488 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:06:10,488 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:10,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:10,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:10,488 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:06:10,489 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:06:10,489 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:10,493 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:10,493 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:10,493 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:06:10,494 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:06:10,494 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:10,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:10,494 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:06:10,494 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:06:10,495 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:10,495 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:10,503 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:10,503 INFO L496 LassoAnalysis]: Using template '3-phase'. [2018-10-27 06:06:10,503 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:10,504 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:06:10,504 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-10-27 06:06:10,504 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:10,504 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:10,504 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:10,504 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:06:10,508 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:06:10,509 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:10,525 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:10,525 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:10,527 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:06:10,527 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-10-27 06:06:10,527 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:10,527 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:10,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:10,527 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:06:10,528 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:06:10,528 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:10,531 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:10,531 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:10,532 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:06:10,533 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-10-27 06:06:10,534 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:10,534 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:10,534 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-10-27 06:06:10,534 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:06:10,538 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-10-27 06:06:10,538 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:10,568 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:10,568 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:10,568 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:06:10,569 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-10-27 06:06:10,569 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:10,569 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:10,569 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:10,569 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:06:10,573 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:06:10,573 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:10,578 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:10,579 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:10,579 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:06:10,579 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-10-27 06:06:10,579 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:10,579 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:10,579 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:10,580 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:06:10,580 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:06:10,580 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:10,586 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:10,587 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:10,587 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:06:10,587 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-10-27 06:06:10,587 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:10,587 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:10,587 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:10,588 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:06:10,588 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:06:10,588 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:10,591 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:10,591 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:10,592 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:06:10,592 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-10-27 06:06:10,592 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:10,592 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:10,592 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:10,592 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:06:10,593 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:06:10,593 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:10,600 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:10,600 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:10,600 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:06:10,600 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-10-27 06:06:10,600 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:10,601 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:10,601 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:06:10,601 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:06:10,602 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:06:10,602 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:10,612 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:10,612 INFO L496 LassoAnalysis]: Using template '4-phase'. [2018-10-27 06:06:10,613 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:10,613 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:06:10,613 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:06:10,613 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:10,616 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:10,616 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:10,616 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:06:10,618 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:06:10,618 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:10,631 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:10,632 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:10,633 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:06:10,634 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:06:10,634 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:10,634 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:10,634 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:10,634 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:06:10,635 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:06:10,635 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:10,641 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:10,642 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:10,642 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:06:10,643 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:06:10,643 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:10,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:10,643 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-10-27 06:06:10,643 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:06:10,650 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-10-27 06:06:10,650 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:10,690 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:10,691 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:10,691 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:06:10,691 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:06:10,691 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:10,692 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:10,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:10,692 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:06:10,696 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:06:10,697 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:10,704 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:10,704 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:10,705 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:06:10,705 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:06:10,705 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:10,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:10,705 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:10,705 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:06:10,709 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:06:10,709 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:10,713 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:10,714 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:10,715 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:06:10,715 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:06:10,715 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:10,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:10,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:10,715 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:06:10,716 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:06:10,716 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:10,724 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:10,724 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:10,725 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:06:10,725 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:06:10,725 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:10,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:10,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:10,728 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:06:10,729 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:06:10,729 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:10,730 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:10,730 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:10,730 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:06:10,730 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:06:10,730 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:10,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:10,731 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:06:10,731 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:06:10,736 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-10-27 06:06:10,736 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:10,747 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:10,747 INFO L496 LassoAnalysis]: Using template '2-lex'. [2018-10-27 06:06:10,748 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:10,748 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:06:10,748 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:06:10,748 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:10,748 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:10,748 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:10,749 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:06:10,752 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:06:10,753 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:10,763 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:10,763 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:10,764 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:06:10,764 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:06:10,764 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:10,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:10,764 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:10,764 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:06:10,764 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:06:10,764 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:10,770 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:10,770 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:10,770 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:06:10,770 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:06:10,771 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:10,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:10,771 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-10-27 06:06:10,771 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:06:10,772 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-10-27 06:06:10,773 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:10,795 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:10,795 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:10,795 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:06:10,796 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:06:10,796 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:10,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:10,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:10,796 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:06:10,797 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:06:10,797 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:10,804 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:10,804 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:10,805 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:06:10,805 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:06:10,805 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:10,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:10,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:10,805 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:06:10,809 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:06:10,809 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:10,811 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:10,811 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:10,811 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:06:10,812 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:06:10,812 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:10,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:10,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:10,812 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:06:10,812 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:06:10,812 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:10,818 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:10,818 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:10,819 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:06:10,819 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:06:10,819 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:10,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:10,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:10,819 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:06:10,820 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:06:10,820 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:10,821 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:10,821 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:10,826 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:06:10,826 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:06:10,826 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:10,826 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:10,826 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:06:10,826 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:06:10,827 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:06:10,827 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:10,837 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:10,837 INFO L496 LassoAnalysis]: Using template '3-lex'. [2018-10-27 06:06:10,837 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:10,840 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:06:10,840 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:06:10,840 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:10,840 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:10,840 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:10,840 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-10-27 06:06:10,842 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:10,842 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:10,876 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:10,876 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:10,877 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:06:10,877 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:06:10,877 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:10,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:10,877 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:10,877 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-10-27 06:06:10,878 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:10,878 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:10,881 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:10,881 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:10,887 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:06:10,887 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:06:10,887 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:10,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:10,887 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-10-27 06:06:10,887 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-10-27 06:06:10,890 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-10-27 06:06:10,890 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:10,982 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:10,983 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:10,983 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:06:10,983 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:06:10,983 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:10,983 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:10,983 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:10,984 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-10-27 06:06:10,984 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:10,984 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:10,996 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:11,002 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:11,003 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:06:11,003 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:06:11,003 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:11,003 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:11,003 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:11,003 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-10-27 06:06:11,004 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:11,004 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:11,010 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:11,010 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:11,010 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:06:11,010 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:06:11,010 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:11,011 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:11,011 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:11,011 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-10-27 06:06:11,011 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:11,011 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:11,017 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:11,018 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:11,018 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:06:11,018 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:06:11,018 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:11,021 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:11,021 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:11,021 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-10-27 06:06:11,022 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:11,022 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:11,024 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:11,024 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:11,025 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:06:11,025 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:06:11,025 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:11,025 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:11,025 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:06:11,030 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-10-27 06:06:11,031 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-10-27 06:06:11,032 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:11,042 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:11,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:06:11,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:06:11,060 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 3 states. [2018-10-27 06:06:12,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:06:12,297 INFO L93 Difference]: Finished difference Result 381 states and 548 transitions. [2018-10-27 06:06:12,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:06:12,299 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 381 states and 548 transitions. [2018-10-27 06:06:12,309 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 372 [2018-10-27 06:06:12,318 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 381 states to 374 states and 541 transitions. [2018-10-27 06:06:12,319 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 374 [2018-10-27 06:06:12,321 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 374 [2018-10-27 06:06:12,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 374 states and 541 transitions. [2018-10-27 06:06:12,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:06:12,328 INFO L705 BuchiCegarLoop]: Abstraction has 374 states and 541 transitions. [2018-10-27 06:06:12,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states and 541 transitions. [2018-10-27 06:06:12,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 373. [2018-10-27 06:06:12,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-10-27 06:06:12,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 539 transitions. [2018-10-27 06:06:12,377 INFO L728 BuchiCegarLoop]: Abstraction has 373 states and 539 transitions. [2018-10-27 06:06:12,378 INFO L608 BuchiCegarLoop]: Abstraction has 373 states and 539 transitions. [2018-10-27 06:06:12,378 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:06:12,379 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 373 states and 539 transitions. [2018-10-27 06:06:12,381 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 371 [2018-10-27 06:06:12,381 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:12,381 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:12,383 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:06:12,383 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:12,383 INFO L793 eck$LassoCheckResult]: Stem: 750#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 631#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 632#L606-3 [2018-10-27 06:06:12,383 INFO L795 eck$LassoCheckResult]: Loop: 632#L606-3 assume true; 853#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 731#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 732#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 879#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 759#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 694#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 695#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 848#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 633#L54 assume (((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1);~a28~0 := 7;~a11~0 := 1;~a25~0 := 0;calculate_output_#res := -1; 634#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 632#L606-3 [2018-10-27 06:06:12,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:12,384 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-10-27 06:06:12,384 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:12,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:12,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:12,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:12,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:12,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:12,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:12,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:12,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1956321088, now seen corresponding path program 1 times [2018-10-27 06:06:12,390 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:12,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:12,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:12,390 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:06:12,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:12,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:12,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:12,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:12,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1962170302, now seen corresponding path program 1 times [2018-10-27 06:06:12,407 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:12,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:12,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:12,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:12,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:12,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:12,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:06:12,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:06:12,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 06:06:12,781 WARN L179 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 41 [2018-10-27 06:06:12,808 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:06:12,808 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:06:12,809 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:06:12,809 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:06:12,809 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-10-27 06:06:12,809 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:12,809 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:06:12,809 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:06:12,809 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label24_true-unreach-call_false-termination.c_Iteration2_Loop [2018-10-27 06:06:12,809 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:06:12,809 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:06:12,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:12,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:12,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:12,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:12,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:12,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:12,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:12,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:12,953 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:06:12,953 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fc0f74cf-fc18-4d9b-95da-2b694b7c3ce8/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:12,956 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:06:12,956 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:06:12,973 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:06:12,973 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a17~0=8} Honda state: {~a17~0=8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fc0f74cf-fc18-4d9b-95da-2b694b7c3ce8/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:12,978 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:06:12,978 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:06:12,982 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:06:12,982 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#res=-1, ULTIMATE.start_main_~output~0=-1} Honda state: {ULTIMATE.start_calculate_output_#res=-1, ULTIMATE.start_main_~output~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fc0f74cf-fc18-4d9b-95da-2b694b7c3ce8/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:12,999 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:06:12,999 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:06:13,002 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:06:13,002 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a19~0=-2} Honda state: {~a19~0=-2} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fc0f74cf-fc18-4d9b-95da-2b694b7c3ce8/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:13,020 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:06:13,020 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:06:13,022 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:06:13,022 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret3=0} Honda state: {ULTIMATE.start_main_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fc0f74cf-fc18-4d9b-95da-2b694b7c3ce8/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:13,048 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:06:13,048 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:06:13,064 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:06:13,065 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a21~0=1} Honda state: {~a21~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fc0f74cf-fc18-4d9b-95da-2b694b7c3ce8/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:13,070 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:06:13,070 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fc0f74cf-fc18-4d9b-95da-2b694b7c3ce8/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:13,090 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-10-27 06:06:13,090 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:06:13,120 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-10-27 06:06:13,121 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:06:13,121 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:06:13,122 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:06:13,122 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:06:13,122 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:06:13,122 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:13,122 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:06:13,122 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:06:13,122 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label24_true-unreach-call_false-termination.c_Iteration2_Loop [2018-10-27 06:06:13,122 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:06:13,122 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:06:13,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:13,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:13,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:13,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:13,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:13,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:13,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:13,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:13,317 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:06:13,318 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:06:13,318 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:13,319 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:13,319 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:13,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:13,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:13,319 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:13,319 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:13,320 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:13,321 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:13,321 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:13,321 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:13,321 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:13,322 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:13,322 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:13,322 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:13,322 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:13,322 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:13,323 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:13,323 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:13,324 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:13,324 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:13,324 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:13,324 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:06:13,324 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:13,324 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:06:13,325 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:13,325 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:13,325 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:13,326 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:13,326 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:13,326 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:13,326 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:13,326 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:13,326 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:13,326 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:13,327 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:13,327 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:13,327 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:13,327 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:13,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:13,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:13,328 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:13,328 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:13,328 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:13,329 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:13,329 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:13,330 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:13,330 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:13,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:13,330 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:06:13,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:13,331 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:06:13,331 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:13,343 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:13,343 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:13,343 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:13,343 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:13,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:13,344 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:06:13,344 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:13,344 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:06:13,344 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:13,347 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:13,347 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:13,348 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:13,348 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:13,348 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:13,348 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:13,348 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:13,348 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:13,349 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:13,350 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:13,350 INFO L496 LassoAnalysis]: Using template '2-nested'. [2018-10-27 06:06:13,350 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:13,351 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:13,351 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:13,351 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:13,351 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:13,351 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:06:13,351 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:06:13,352 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:13,352 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:13,353 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:13,353 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:13,353 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:13,363 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:13,363 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:13,363 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:06:13,363 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:06:13,363 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:13,365 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:13,365 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:13,365 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:13,366 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:13,366 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:13,366 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:06:13,366 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:06:13,366 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:13,366 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:13,367 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:13,367 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:13,367 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:13,367 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:13,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:13,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:13,367 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:06:13,368 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:06:13,368 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:13,368 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:13,368 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:13,369 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:13,369 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:13,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:13,369 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:13,369 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:06:13,369 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:06:13,369 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:13,370 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:13,370 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:13,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:13,371 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:13,371 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:13,371 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:06:13,371 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:06:13,371 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:13,372 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:13,373 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:13,390 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:13,390 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:13,390 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:13,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:13,390 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:06:13,391 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:06:13,391 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:13,391 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:13,402 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:13,403 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:13,403 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:13,403 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:13,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:13,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:13,403 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:06:13,404 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:06:13,404 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:13,406 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:13,406 INFO L496 LassoAnalysis]: Using template '3-nested'. [2018-10-27 06:06:13,406 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:13,407 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:13,407 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:13,407 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:13,407 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:13,407 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:06:13,407 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:06:13,407 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:13,408 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:13,409 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:13,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:13,409 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:13,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:13,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:13,417 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:06:13,418 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:06:13,418 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:13,420 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:13,420 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:13,420 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:13,420 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:13,421 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:13,421 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:06:13,421 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:06:13,421 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:06:13,421 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:13,422 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:13,422 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:13,422 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:13,422 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:13,422 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:13,422 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:13,422 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:06:13,423 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:06:13,423 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:13,423 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:13,423 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:13,424 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:13,424 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:13,424 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:13,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:13,424 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:06:13,424 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:06:13,424 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:13,434 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:13,434 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:13,434 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:13,434 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:13,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:13,435 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:06:13,435 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:06:13,435 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:06:13,435 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:13,437 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:13,437 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:13,438 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:13,438 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:13,438 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:13,438 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:06:13,438 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:06:13,439 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:06:13,439 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:13,451 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:13,451 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:13,451 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:13,451 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:13,452 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:13,452 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:13,452 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:06:13,452 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:06:13,453 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:13,455 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:13,455 INFO L496 LassoAnalysis]: Using template '4-nested'. [2018-10-27 06:06:13,455 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:13,456 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:13,456 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:13,456 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:13,456 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:13,456 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:06:13,456 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:06:13,457 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:13,464 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:13,464 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:13,465 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:13,465 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:13,465 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:13,465 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:13,465 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:06:13,466 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:06:13,466 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:13,468 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:13,468 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:13,468 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:13,468 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:13,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:13,468 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:06:13,468 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:06:13,469 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-10-27 06:06:13,469 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:13,469 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:13,469 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:13,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:13,470 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:13,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:13,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:13,470 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:06:13,470 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:06:13,470 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:13,471 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:13,471 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:13,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:13,471 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:13,472 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:13,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:13,472 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:06:13,472 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:06:13,472 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:13,473 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:13,485 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:13,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:13,486 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:13,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:13,486 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:06:13,486 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:06:13,487 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-10-27 06:06:13,487 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:13,490 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:13,490 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:13,490 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:13,490 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:13,490 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:13,491 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:06:13,491 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:06:13,491 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-10-27 06:06:13,491 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:13,496 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:13,496 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:13,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:13,497 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:13,497 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:13,497 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:13,497 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:06:13,510 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:06:13,510 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:13,513 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:13,513 INFO L496 LassoAnalysis]: Using template '2-phase'. [2018-10-27 06:06:13,513 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:13,514 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:06:13,514 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:06:13,514 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:13,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:13,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:13,514 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:06:13,514 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:06:13,515 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:13,516 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:13,517 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:13,517 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:06:13,517 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:06:13,517 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:13,517 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:13,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:13,517 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:06:13,518 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:06:13,518 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:13,520 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:13,521 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:13,521 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:06:13,521 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:06:13,521 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:13,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:13,521 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:06:13,521 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:06:13,522 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:13,522 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:13,522 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:13,523 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:13,523 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:06:13,523 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:06:13,523 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:13,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:13,523 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:13,524 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:06:13,524 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:06:13,524 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:13,524 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:13,525 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:13,525 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:06:13,525 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:06:13,525 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:13,525 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:13,525 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:13,525 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:06:13,526 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:06:13,526 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:13,527 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:13,528 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:13,528 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:06:13,528 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:06:13,528 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:13,528 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:13,528 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:06:13,528 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:06:13,529 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:13,529 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:13,532 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:13,533 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:13,533 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:06:13,533 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:06:13,533 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:13,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:13,534 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:06:13,534 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:06:13,534 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:13,535 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:13,540 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:13,541 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:13,541 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:06:13,541 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:06:13,541 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:13,542 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:13,542 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:13,542 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:06:13,543 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:06:13,543 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:13,546 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:13,546 INFO L496 LassoAnalysis]: Using template '3-phase'. [2018-10-27 06:06:13,546 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:13,547 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:06:13,547 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-10-27 06:06:13,547 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:13,547 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:13,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:13,547 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:06:13,548 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:06:13,548 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:13,550 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:13,550 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:13,551 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:06:13,551 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-10-27 06:06:13,551 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:13,551 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:13,551 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:13,551 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:06:13,552 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:06:13,552 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:13,556 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:13,556 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:13,556 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:06:13,556 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-10-27 06:06:13,556 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:13,557 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:13,557 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:06:13,557 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:06:13,558 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:06:13,558 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:13,558 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:13,559 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:13,559 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:06:13,559 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-10-27 06:06:13,559 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:13,559 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:13,559 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:13,560 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:06:13,560 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:06:13,560 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:13,561 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:13,561 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:13,561 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:06:13,562 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-10-27 06:06:13,562 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:13,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:13,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:13,562 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:06:13,562 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:06:13,563 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:13,565 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:13,565 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:13,566 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:06:13,566 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-10-27 06:06:13,566 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:13,566 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:13,566 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:06:13,566 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:06:13,567 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:06:13,567 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:13,573 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:13,573 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:13,573 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:06:13,573 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-10-27 06:06:13,574 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:13,574 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:13,574 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:06:13,574 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:06:13,575 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:06:13,575 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:13,586 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:13,586 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:13,587 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:06:13,587 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-10-27 06:06:13,587 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:13,587 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:13,587 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:13,587 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:06:13,588 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:06:13,588 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:13,602 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:13,602 INFO L496 LassoAnalysis]: Using template '4-phase'. [2018-10-27 06:06:13,602 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:13,603 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:06:13,603 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:06:13,603 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:13,603 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:13,603 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:13,603 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:06:13,604 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:06:13,604 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:13,608 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:13,609 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:13,609 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:06:13,609 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:06:13,609 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:13,609 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:13,609 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:13,609 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:06:13,610 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:06:13,611 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:13,622 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:13,623 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:13,623 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:06:13,623 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:06:13,623 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:13,623 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:13,623 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:06:13,624 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:06:13,625 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-10-27 06:06:13,625 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:13,637 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:13,638 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:13,638 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:06:13,638 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:06:13,638 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:13,639 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:13,639 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:13,639 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:06:13,639 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:06:13,639 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:13,640 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:13,640 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:13,641 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:06:13,641 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:06:13,641 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:13,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:13,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:13,641 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:06:13,642 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:06:13,642 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:13,645 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:13,645 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:13,646 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:06:13,646 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:06:13,646 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:13,646 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:13,646 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:06:13,646 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:06:13,648 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-10-27 06:06:13,648 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:13,668 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:13,668 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:13,669 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:06:13,669 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:06:13,669 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:13,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:13,669 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:06:13,669 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:06:13,679 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-10-27 06:06:13,680 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:13,707 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:13,708 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:13,708 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:06:13,708 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:06:13,708 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:13,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:13,709 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:13,709 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:06:13,710 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:06:13,711 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:13,719 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:13,719 INFO L496 LassoAnalysis]: Using template '2-lex'. [2018-10-27 06:06:13,719 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:13,720 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:06:13,720 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:06:13,720 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:13,720 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:13,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:13,720 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:06:13,720 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:06:13,721 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:13,722 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:13,722 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:13,723 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:06:13,723 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:06:13,723 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:13,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:13,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:13,723 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:06:13,723 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:06:13,723 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:13,726 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:13,727 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:13,727 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:06:13,727 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:06:13,727 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:13,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:13,727 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:06:13,727 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:06:13,728 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:06:13,728 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:13,729 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:13,730 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:13,730 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:06:13,730 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:06:13,730 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:13,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:13,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:13,730 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:06:13,731 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:06:13,731 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:13,732 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:13,732 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:13,732 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:06:13,732 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:06:13,732 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:13,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:13,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:13,733 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:06:13,733 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:06:13,733 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:13,734 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:13,735 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:13,735 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:06:13,735 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:06:13,735 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:13,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:13,735 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:06:13,735 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:06:13,736 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:06:13,736 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:13,740 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:13,740 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:13,741 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:06:13,741 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:06:13,741 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:13,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:13,741 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:06:13,741 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:06:13,742 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:06:13,742 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:13,748 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:13,748 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:13,749 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:06:13,749 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:06:13,749 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:13,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:13,749 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:13,749 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:06:13,750 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:06:13,750 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:13,755 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:13,755 INFO L496 LassoAnalysis]: Using template '3-lex'. [2018-10-27 06:06:13,755 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:13,756 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:06:13,756 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:06:13,756 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:13,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:13,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:13,756 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-10-27 06:06:13,756 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:13,757 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:13,759 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:13,759 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:13,759 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:06:13,759 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:06:13,759 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:13,760 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:13,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:13,760 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-10-27 06:06:13,760 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:13,760 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:13,766 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:13,767 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:13,767 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:06:13,767 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:06:13,767 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:13,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:13,767 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:06:13,768 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-10-27 06:06:13,768 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-10-27 06:06:13,768 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:13,770 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:13,770 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:13,770 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:06:13,770 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:06:13,771 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:13,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:13,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:13,771 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-10-27 06:06:13,771 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:13,771 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:13,773 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:13,774 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:13,774 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:06:13,774 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:06:13,774 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:13,774 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:13,774 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:13,774 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-10-27 06:06:13,775 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:13,775 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:13,777 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:13,778 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:13,778 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:06:13,778 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:06:13,778 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:13,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:13,778 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:06:13,778 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-10-27 06:06:13,779 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-10-27 06:06:13,779 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:13,794 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:13,795 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:13,795 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:06:13,795 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:06:13,795 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:13,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:13,796 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:06:13,796 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-10-27 06:06:13,797 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-10-27 06:06:13,797 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:13,831 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:13,831 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:06:13,832 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:06:13,832 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:06:13,832 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:13,832 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:13,832 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:13,832 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-10-27 06:06:13,833 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:13,833 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:13,877 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:13,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:06:13,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:06:13,886 INFO L87 Difference]: Start difference. First operand 373 states and 539 transitions. cyclomatic complexity: 167 Second operand 3 states. [2018-10-27 06:06:15,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:06:15,365 INFO L93 Difference]: Finished difference Result 660 states and 918 transitions. [2018-10-27 06:06:15,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:06:15,366 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 660 states and 918 transitions. [2018-10-27 06:06:15,370 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 658 [2018-10-27 06:06:15,374 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 660 states to 660 states and 918 transitions. [2018-10-27 06:06:15,374 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 660 [2018-10-27 06:06:15,376 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 660 [2018-10-27 06:06:15,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 660 states and 918 transitions. [2018-10-27 06:06:15,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:06:15,378 INFO L705 BuchiCegarLoop]: Abstraction has 660 states and 918 transitions. [2018-10-27 06:06:15,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states and 918 transitions. [2018-10-27 06:06:15,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2018-10-27 06:06:15,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2018-10-27 06:06:15,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 918 transitions. [2018-10-27 06:06:15,400 INFO L728 BuchiCegarLoop]: Abstraction has 660 states and 918 transitions. [2018-10-27 06:06:15,400 INFO L608 BuchiCegarLoop]: Abstraction has 660 states and 918 transitions. [2018-10-27 06:06:15,400 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-10-27 06:06:15,400 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 660 states and 918 transitions. [2018-10-27 06:06:15,403 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 658 [2018-10-27 06:06:15,403 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:15,403 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:15,404 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:06:15,404 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:15,405 INFO L793 eck$LassoCheckResult]: Stem: 1796#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 1672#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 1673#L606-3 [2018-10-27 06:06:15,405 INFO L795 eck$LassoCheckResult]: Loop: 1673#L606-3 assume true; 1910#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 1774#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 1775#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 1935#L35 assume ~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1);~a28~0 := 10;calculate_output_#res := 22; 1684#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 2198#L606-3 assume true; 2195#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 2192#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 2190#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 2188#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 2186#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 2184#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 2182#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 2180#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 2178#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 2176#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 2174#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 2171#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 2167#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 2162#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 2158#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 2152#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 2150#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 2148#L106 assume !((~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1); 2147#L113 assume !(~a17~0 == 8 && ~a21~0 == 1 && !(~a11~0 == 1) && !(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3); 2145#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 2143#L123 assume !(!(~a11~0 == 1) && !(~a19~0 == 1) && (~a17~0 == 8 && calculate_output_~input == 6 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a28~0 == 8 && ~a25~0 == 1))) && ~a21~0 == 1); 2141#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 2139#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 2137#L139 assume !((~a11~0 == 1 && (~a19~0 == 1 && ~a21~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 4) && ~a17~0 == 9) && ~a28~0 == 9); 2135#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 2133#L148 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && (((~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7)) || (~a28~0 == 8 && ~a25~0 == 1)) && calculate_output_~input == 3) && !(~a19~0 == 1)) && ~a21~0 == 1); 2131#L154 assume !(~a21~0 == 1 && !(~a19~0 == 1) && ((calculate_output_~input == 5 && ((~a28~0 == 8 && ~a25~0 == 1) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7))) && !(~a11~0 == 1)) && ~a17~0 == 8); 2129#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 2127#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 2126#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 2125#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 2124#L179 assume !((~a21~0 == 1 && (~a19~0 == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8)) && calculate_output_~input == 4) && ~a11~0 == 1) && ~a17~0 == 9); 2123#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 2121#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 2120#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 2119#L191 assume !((((((calculate_output_~input == 4 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8) && ~a28~0 == 10) && ~a19~0 == 1); 2118#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 2117#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 2115#L202 assume !((((~a21~0 == 1 && calculate_output_~input == 1 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a19~0 == 1); 2116#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 2212#L215 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && ~a28~0 == 10 && (((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1); 2213#L218 assume !((((~a17~0 == 9 && ((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 6) && ~a11~0 == 1) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 9); 1936#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 1838#L225 assume !((!(~a19~0 == 1) && ~a17~0 == 8 && !(~a11~0 == 1) && calculate_output_~input == 1 && (((~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a21~0 == 1); 1839#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 1890#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 1761#L237 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && (((!(~a25~0 == 1) && ~a28~0 == 11) || (!(~a25~0 == 1) && ~a28~0 == 10) || (~a28~0 == 11 && ~a25~0 == 1)) && calculate_output_~input == 3) && ~a21~0 == 1) && !(~a19~0 == 1)); 1762#L248 assume !((((!(~a11~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a19~0 == 1)) && ~a17~0 == 8); 1763#L253 assume (~a17~0 == 9 && (((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a19~0 == 1) && ~a28~0 == 9;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 1782#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 1673#L606-3 [2018-10-27 06:06:15,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:15,417 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-10-27 06:06:15,417 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:15,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:15,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:15,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:15,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:15,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:15,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:15,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:15,422 INFO L82 PathProgramCache]: Analyzing trace with hash 692590236, now seen corresponding path program 1 times [2018-10-27 06:06:15,422 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:15,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:15,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:15,423 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:06:15,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:15,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:15,580 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:06:15,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:06:15,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 06:06:15,580 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:06:15,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 06:06:15,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-27 06:06:15,581 INFO L87 Difference]: Start difference. First operand 660 states and 918 transitions. cyclomatic complexity: 259 Second operand 4 states. [2018-10-27 06:06:16,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:06:16,502 INFO L93 Difference]: Finished difference Result 1228 states and 1701 transitions. [2018-10-27 06:06:16,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 06:06:16,503 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1228 states and 1701 transitions. [2018-10-27 06:06:16,511 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1224 [2018-10-27 06:06:16,517 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1228 states to 1228 states and 1701 transitions. [2018-10-27 06:06:16,517 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1228 [2018-10-27 06:06:16,518 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1228 [2018-10-27 06:06:16,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1228 states and 1701 transitions. [2018-10-27 06:06:16,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:06:16,521 INFO L705 BuchiCegarLoop]: Abstraction has 1228 states and 1701 transitions. [2018-10-27 06:06:16,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states and 1701 transitions. [2018-10-27 06:06:16,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1225. [2018-10-27 06:06:16,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1225 states. [2018-10-27 06:06:16,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1695 transitions. [2018-10-27 06:06:16,609 INFO L728 BuchiCegarLoop]: Abstraction has 1225 states and 1695 transitions. [2018-10-27 06:06:16,609 INFO L608 BuchiCegarLoop]: Abstraction has 1225 states and 1695 transitions. [2018-10-27 06:06:16,609 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-10-27 06:06:16,609 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1225 states and 1695 transitions. [2018-10-27 06:06:16,614 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1221 [2018-10-27 06:06:16,615 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:16,615 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:16,616 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:06:16,616 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:16,616 INFO L793 eck$LassoCheckResult]: Stem: 3694#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 3567#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 3568#L606-3 [2018-10-27 06:06:16,616 INFO L795 eck$LassoCheckResult]: Loop: 3568#L606-3 assume true; 3815#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 3674#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 3675#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 3849#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 3703#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 3632#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 3633#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 3826#L50 assume ~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7;~a28~0 := 11;~a25~0 := 1;calculate_output_#res := 26; 3580#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 4483#L606-3 assume true; 4482#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4481#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 4480#L30 assume ((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 3673#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 4609#L606-3 assume true; 4608#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4607#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 4605#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 4604#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 4603#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 4601#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 4209#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 4210#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 4597#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 4596#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 4220#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 3829#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 3830#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 3712#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 3713#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 4593#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 4592#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 4591#L106 assume !((~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1); 4590#L113 assume !(~a17~0 == 8 && ~a21~0 == 1 && !(~a11~0 == 1) && !(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3); 4588#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 4586#L123 assume !(!(~a11~0 == 1) && !(~a19~0 == 1) && (~a17~0 == 8 && calculate_output_~input == 6 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a28~0 == 8 && ~a25~0 == 1))) && ~a21~0 == 1); 4584#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 4581#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 4582#L139 assume !((~a11~0 == 1 && (~a19~0 == 1 && ~a21~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 4) && ~a17~0 == 9) && ~a28~0 == 9); 4612#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 4629#L148 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && (((~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7)) || (~a28~0 == 8 && ~a25~0 == 1)) && calculate_output_~input == 3) && !(~a19~0 == 1)) && ~a21~0 == 1); 4627#L154 assume !(~a21~0 == 1 && !(~a19~0 == 1) && ((calculate_output_~input == 5 && ((~a28~0 == 8 && ~a25~0 == 1) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7))) && !(~a11~0 == 1)) && ~a17~0 == 8); 4625#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 4623#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 4621#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 4619#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 4618#L179 assume !((~a21~0 == 1 && (~a19~0 == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8)) && calculate_output_~input == 4) && ~a11~0 == 1) && ~a17~0 == 9); 4617#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 4615#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 4610#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 4208#L191 assume !((((((calculate_output_~input == 4 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8) && ~a28~0 == 10) && ~a19~0 == 1); 3780#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 3677#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 3603#L202 assume !((((~a21~0 == 1 && calculate_output_~input == 1 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a19~0 == 1); 3605#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 4205#L215 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && ~a28~0 == 10 && (((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1); 3624#L218 assume !((((~a17~0 == 9 && ((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 6) && ~a11~0 == 1) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 9); 3625#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 3850#L225 assume !((!(~a19~0 == 1) && ~a17~0 == 8 && !(~a11~0 == 1) && calculate_output_~input == 1 && (((~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a21~0 == 1); 4646#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 3851#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 3852#L237 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && (((!(~a25~0 == 1) && ~a28~0 == 11) || (!(~a25~0 == 1) && ~a28~0 == 10) || (~a28~0 == 11 && ~a25~0 == 1)) && calculate_output_~input == 3) && ~a21~0 == 1) && !(~a19~0 == 1)); 4255#L248 assume !((((!(~a11~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a19~0 == 1)) && ~a17~0 == 8); 4253#L253 assume (~a17~0 == 9 && (((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a19~0 == 1) && ~a28~0 == 9;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 3718#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3568#L606-3 [2018-10-27 06:06:16,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:16,617 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-10-27 06:06:16,617 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:16,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:16,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:16,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:16,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:16,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:16,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:16,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:16,623 INFO L82 PathProgramCache]: Analyzing trace with hash 676565178, now seen corresponding path program 1 times [2018-10-27 06:06:16,623 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:16,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:16,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:16,623 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:06:16,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:16,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:16,736 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-27 06:06:16,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:06:16,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:06:16,737 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:06:16,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:06:16,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:06:16,737 INFO L87 Difference]: Start difference. First operand 1225 states and 1695 transitions. cyclomatic complexity: 472 Second operand 3 states. [2018-10-27 06:06:18,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:06:18,132 INFO L93 Difference]: Finished difference Result 1509 states and 2004 transitions. [2018-10-27 06:06:18,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:06:18,133 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1509 states and 2004 transitions. [2018-10-27 06:06:18,141 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1505 [2018-10-27 06:06:18,148 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1509 states to 1509 states and 2004 transitions. [2018-10-27 06:06:18,149 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1509 [2018-10-27 06:06:18,151 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1509 [2018-10-27 06:06:18,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1509 states and 2004 transitions. [2018-10-27 06:06:18,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:06:18,154 INFO L705 BuchiCegarLoop]: Abstraction has 1509 states and 2004 transitions. [2018-10-27 06:06:18,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1509 states and 2004 transitions. [2018-10-27 06:06:18,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1509 to 1508. [2018-10-27 06:06:18,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1508 states. [2018-10-27 06:06:18,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 2002 transitions. [2018-10-27 06:06:18,179 INFO L728 BuchiCegarLoop]: Abstraction has 1508 states and 2002 transitions. [2018-10-27 06:06:18,179 INFO L608 BuchiCegarLoop]: Abstraction has 1508 states and 2002 transitions. [2018-10-27 06:06:18,179 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-10-27 06:06:18,179 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1508 states and 2002 transitions. [2018-10-27 06:06:18,187 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-10-27 06:06:18,188 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:18,188 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:18,189 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:06:18,189 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:18,192 INFO L793 eck$LassoCheckResult]: Stem: 6433#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 6307#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 6308#L606-3 [2018-10-27 06:06:18,192 INFO L795 eck$LassoCheckResult]: Loop: 6308#L606-3 assume true; 7603#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 7602#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 7601#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 7600#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 7598#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 7596#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 7562#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 7464#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 7465#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 7461#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 7462#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 7570#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 7568#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 7566#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 6572#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 6573#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 6434#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 6435#L106 assume (~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1;~a17~0 := 8;~a25~0 := 0;~a19~0 := 0;~a28~0 := 11;~a11~0 := 0;calculate_output_#res := 23; 6544#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 7314#L606-3 assume true; 7311#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 7307#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 7304#L30 assume ((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 6394#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 7696#L606-3 assume true; 7694#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 7692#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 7679#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 7675#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 7671#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 7672#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 7706#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 7447#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 7444#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 7445#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 7700#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 7698#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 7697#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 7695#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 7693#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 7691#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 7690#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 7689#L106 assume !((~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1); 7687#L113 assume !(~a17~0 == 8 && ~a21~0 == 1 && !(~a11~0 == 1) && !(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3); 7685#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 7683#L123 assume !(!(~a11~0 == 1) && !(~a19~0 == 1) && (~a17~0 == 8 && calculate_output_~input == 6 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a28~0 == 8 && ~a25~0 == 1))) && ~a21~0 == 1); 7681#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 7677#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 7669#L139 assume !((~a11~0 == 1 && (~a19~0 == 1 && ~a21~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 4) && ~a17~0 == 9) && ~a28~0 == 9); 6408#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 6409#L148 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && (((~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7)) || (~a28~0 == 8 && ~a25~0 == 1)) && calculate_output_~input == 3) && !(~a19~0 == 1)) && ~a21~0 == 1); 6410#L154 assume !(~a21~0 == 1 && !(~a19~0 == 1) && ((calculate_output_~input == 5 && ((~a28~0 == 8 && ~a25~0 == 1) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7))) && !(~a11~0 == 1)) && ~a17~0 == 8); 6411#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 6916#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 7667#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 7036#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 7037#L179 assume !((~a21~0 == 1 && (~a19~0 == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8)) && calculate_output_~input == 4) && ~a11~0 == 1) && ~a17~0 == 9); 7673#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 7674#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 7668#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 7125#L191 assume !((((((calculate_output_~input == 4 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8) && ~a28~0 == 10) && ~a19~0 == 1); 7126#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 7491#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 6693#L202 assume !((((~a21~0 == 1 && calculate_output_~input == 1 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a19~0 == 1); 6694#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 7124#L215 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && ~a28~0 == 10 && (((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1); 6362#L218 assume !((((~a17~0 == 9 && ((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 6) && ~a11~0 == 1) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 9); 6363#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 6477#L225 assume !((!(~a19~0 == 1) && ~a17~0 == 8 && !(~a11~0 == 1) && calculate_output_~input == 1 && (((~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a21~0 == 1); 6478#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 6534#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 6401#L237 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && (((!(~a25~0 == 1) && ~a28~0 == 11) || (!(~a25~0 == 1) && ~a28~0 == 10) || (~a28~0 == 11 && ~a25~0 == 1)) && calculate_output_~input == 3) && ~a21~0 == 1) && !(~a19~0 == 1)); 6402#L248 assume !((((!(~a11~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a19~0 == 1)) && ~a17~0 == 8); 6403#L253 assume (~a17~0 == 9 && (((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a19~0 == 1) && ~a28~0 == 9;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 6422#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6308#L606-3 [2018-10-27 06:06:18,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:18,193 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2018-10-27 06:06:18,193 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:18,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:18,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:18,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:18,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:18,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:18,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:18,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:18,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1219893882, now seen corresponding path program 1 times [2018-10-27 06:06:18,197 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:18,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:18,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:18,213 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:06:18,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:18,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:18,301 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-27 06:06:18,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:06:18,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:06:18,302 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:06:18,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:06:18,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:06:18,303 INFO L87 Difference]: Start difference. First operand 1508 states and 2002 transitions. cyclomatic complexity: 496 Second operand 3 states. [2018-10-27 06:06:19,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:06:19,004 INFO L93 Difference]: Finished difference Result 1507 states and 1823 transitions. [2018-10-27 06:06:19,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:06:19,006 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1507 states and 1823 transitions. [2018-10-27 06:06:19,011 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-10-27 06:06:19,016 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1507 states to 1507 states and 1823 transitions. [2018-10-27 06:06:19,017 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1507 [2018-10-27 06:06:19,018 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1507 [2018-10-27 06:06:19,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1507 states and 1823 transitions. [2018-10-27 06:06:19,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:06:19,020 INFO L705 BuchiCegarLoop]: Abstraction has 1507 states and 1823 transitions. [2018-10-27 06:06:19,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states and 1823 transitions. [2018-10-27 06:06:19,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1507. [2018-10-27 06:06:19,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1507 states. [2018-10-27 06:06:19,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 1823 transitions. [2018-10-27 06:06:19,038 INFO L728 BuchiCegarLoop]: Abstraction has 1507 states and 1823 transitions. [2018-10-27 06:06:19,038 INFO L608 BuchiCegarLoop]: Abstraction has 1507 states and 1823 transitions. [2018-10-27 06:06:19,039 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-10-27 06:06:19,039 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1507 states and 1823 transitions. [2018-10-27 06:06:19,043 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-10-27 06:06:19,044 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:19,044 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:19,045 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:06:19,045 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:19,045 INFO L793 eck$LassoCheckResult]: Stem: 9455#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 9328#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 9329#L606-3 [2018-10-27 06:06:19,045 INFO L795 eck$LassoCheckResult]: Loop: 9329#L606-3 assume true; 9568#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 9434#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 9435#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 9600#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 10193#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 10367#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 10366#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 10364#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 10362#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 10360#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 10358#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 10356#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 10354#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 10352#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 10350#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 10348#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 10346#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 10334#L106 assume !((~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1); 10335#L113 assume !(~a17~0 == 8 && ~a21~0 == 1 && !(~a11~0 == 1) && !(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3); 9399#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 9400#L123 assume !(!(~a11~0 == 1) && !(~a19~0 == 1) && (~a17~0 == 8 && calculate_output_~input == 6 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a28~0 == 8 && ~a25~0 == 1))) && ~a21~0 == 1); 9623#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 10619#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 10613#L139 assume !((~a11~0 == 1 && (~a19~0 == 1 && ~a21~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 4) && ~a17~0 == 9) && ~a28~0 == 9); 10607#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 10601#L148 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && (((~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7)) || (~a28~0 == 8 && ~a25~0 == 1)) && calculate_output_~input == 3) && !(~a19~0 == 1)) && ~a21~0 == 1); 10596#L154 assume !(~a21~0 == 1 && !(~a19~0 == 1) && ((calculate_output_~input == 5 && ((~a28~0 == 8 && ~a25~0 == 1) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7))) && !(~a11~0 == 1)) && ~a17~0 == 8); 10588#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 9784#L165 assume (~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1);~a25~0 := 1;~a28~0 := 9;calculate_output_#res := 26; 9676#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 9778#L606-3 assume true; 9776#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 9774#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 9772#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 9770#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 9768#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 9766#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 9764#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 9762#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 9760#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 9758#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 9756#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 9754#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 9752#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 9750#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 9748#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 9746#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 9744#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 9742#L106 assume !((~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1); 9740#L113 assume !(~a17~0 == 8 && ~a21~0 == 1 && !(~a11~0 == 1) && !(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3); 9738#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 9736#L123 assume !(!(~a11~0 == 1) && !(~a19~0 == 1) && (~a17~0 == 8 && calculate_output_~input == 6 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a28~0 == 8 && ~a25~0 == 1))) && ~a21~0 == 1); 9734#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 9732#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 9730#L139 assume !((~a11~0 == 1 && (~a19~0 == 1 && ~a21~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 4) && ~a17~0 == 9) && ~a28~0 == 9); 9728#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 9726#L148 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && (((~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7)) || (~a28~0 == 8 && ~a25~0 == 1)) && calculate_output_~input == 3) && !(~a19~0 == 1)) && ~a21~0 == 1); 9724#L154 assume !(~a21~0 == 1 && !(~a19~0 == 1) && ((calculate_output_~input == 5 && ((~a28~0 == 8 && ~a25~0 == 1) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7))) && !(~a11~0 == 1)) && ~a17~0 == 8); 9721#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 9719#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 9717#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 9715#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 9713#L179 assume !((~a21~0 == 1 && (~a19~0 == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8)) && calculate_output_~input == 4) && ~a11~0 == 1) && ~a17~0 == 9); 9711#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 9709#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 9707#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 9705#L191 assume !((((((calculate_output_~input == 4 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8) && ~a28~0 == 10) && ~a19~0 == 1); 9703#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 9701#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 9699#L202 assume !((((~a21~0 == 1 && calculate_output_~input == 1 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a19~0 == 1); 9697#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 9695#L215 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && ~a28~0 == 10 && (((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1); 9693#L218 assume !((((~a17~0 == 9 && ((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 6) && ~a11~0 == 1) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 9); 9691#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 9689#L225 assume !((!(~a19~0 == 1) && ~a17~0 == 8 && !(~a11~0 == 1) && calculate_output_~input == 1 && (((~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a21~0 == 1); 9687#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 9685#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 9683#L237 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && (((!(~a25~0 == 1) && ~a28~0 == 11) || (!(~a25~0 == 1) && ~a28~0 == 10) || (~a28~0 == 11 && ~a25~0 == 1)) && calculate_output_~input == 3) && ~a21~0 == 1) && !(~a19~0 == 1)); 9681#L248 assume !((((!(~a11~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a19~0 == 1)) && ~a17~0 == 8); 9679#L253 assume (~a17~0 == 9 && (((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a19~0 == 1) && ~a28~0 == 9;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 9479#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 9329#L606-3 [2018-10-27 06:06:19,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:19,046 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2018-10-27 06:06:19,046 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:19,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:19,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:19,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:19,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:19,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:19,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:19,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:19,050 INFO L82 PathProgramCache]: Analyzing trace with hash -606648447, now seen corresponding path program 1 times [2018-10-27 06:06:19,050 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:19,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:19,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:19,050 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:06:19,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:19,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:19,230 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-10-27 06:06:19,280 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:06:19,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:06:19,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:06:19,282 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:06:19,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:06:19,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:06:19,283 INFO L87 Difference]: Start difference. First operand 1507 states and 1823 transitions. cyclomatic complexity: 318 Second operand 3 states. [2018-10-27 06:06:20,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:06:20,056 INFO L93 Difference]: Finished difference Result 1496 states and 1779 transitions. [2018-10-27 06:06:20,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:06:20,057 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1496 states and 1779 transitions. [2018-10-27 06:06:20,062 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1493 [2018-10-27 06:06:20,068 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1496 states to 1496 states and 1779 transitions. [2018-10-27 06:06:20,069 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1496 [2018-10-27 06:06:20,071 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1496 [2018-10-27 06:06:20,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1496 states and 1779 transitions. [2018-10-27 06:06:20,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:06:20,073 INFO L705 BuchiCegarLoop]: Abstraction has 1496 states and 1779 transitions. [2018-10-27 06:06:20,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states and 1779 transitions. [2018-10-27 06:06:20,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 1496. [2018-10-27 06:06:20,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1496 states. [2018-10-27 06:06:20,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 1779 transitions. [2018-10-27 06:06:20,093 INFO L728 BuchiCegarLoop]: Abstraction has 1496 states and 1779 transitions. [2018-10-27 06:06:20,093 INFO L608 BuchiCegarLoop]: Abstraction has 1496 states and 1779 transitions. [2018-10-27 06:06:20,093 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-10-27 06:06:20,093 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1496 states and 1779 transitions. [2018-10-27 06:06:20,101 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1493 [2018-10-27 06:06:20,101 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:20,102 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:20,102 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:06:20,102 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:20,102 INFO L793 eck$LassoCheckResult]: Stem: 12456#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 12337#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 12338#L606-3 [2018-10-27 06:06:20,103 INFO L795 eck$LassoCheckResult]: Loop: 12338#L606-3 assume true; 13344#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 13342#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 13341#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 13339#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 13338#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 13337#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 13336#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 13334#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 13332#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 13327#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 13326#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 13324#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 13322#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 13320#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 13318#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 13316#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 13314#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 13312#L106 assume !((~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1); 13310#L113 assume !(~a17~0 == 8 && ~a21~0 == 1 && !(~a11~0 == 1) && !(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3); 13308#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 13306#L123 assume !(!(~a11~0 == 1) && !(~a19~0 == 1) && (~a17~0 == 8 && calculate_output_~input == 6 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a28~0 == 8 && ~a25~0 == 1))) && ~a21~0 == 1); 13304#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 13302#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 13300#L139 assume !((~a11~0 == 1 && (~a19~0 == 1 && ~a21~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 4) && ~a17~0 == 9) && ~a28~0 == 9); 13298#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13296#L148 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && (((~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7)) || (~a28~0 == 8 && ~a25~0 == 1)) && calculate_output_~input == 3) && !(~a19~0 == 1)) && ~a21~0 == 1); 13294#L154 assume !(~a21~0 == 1 && !(~a19~0 == 1) && ((calculate_output_~input == 5 && ((~a28~0 == 8 && ~a25~0 == 1) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7))) && !(~a11~0 == 1)) && ~a17~0 == 8); 13292#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 13290#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 13288#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 13286#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 13284#L179 assume !((~a21~0 == 1 && (~a19~0 == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8)) && calculate_output_~input == 4) && ~a11~0 == 1) && ~a17~0 == 9); 13282#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 13280#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 13278#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 13276#L191 assume !((((((calculate_output_~input == 4 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8) && ~a28~0 == 10) && ~a19~0 == 1); 13274#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 13272#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 13270#L202 assume !((((~a21~0 == 1 && calculate_output_~input == 1 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a19~0 == 1); 13268#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 13266#L215 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && ~a28~0 == 10 && (((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1); 13264#L218 assume !((((~a17~0 == 9 && ((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 6) && ~a11~0 == 1) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 9); 13262#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 13260#L225 assume !((!(~a19~0 == 1) && ~a17~0 == 8 && !(~a11~0 == 1) && calculate_output_~input == 1 && (((~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a21~0 == 1); 13258#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 13256#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 13254#L237 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && (((!(~a25~0 == 1) && ~a28~0 == 11) || (!(~a25~0 == 1) && ~a28~0 == 10) || (~a28~0 == 11 && ~a25~0 == 1)) && calculate_output_~input == 3) && ~a21~0 == 1) && !(~a19~0 == 1)); 13252#L248 assume !((((!(~a11~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a19~0 == 1)) && ~a17~0 == 8); 13250#L253 assume !((~a17~0 == 9 && (((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a19~0 == 1) && ~a28~0 == 9); 13248#L259 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && (((~a28~0 == 9 && calculate_output_~input == 6) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a25~0 == 1)); 13246#L261 assume !(~a17~0 == 9 && ~a21~0 == 1 && ~a11~0 == 1 && (calculate_output_~input == 3 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7))) && ~a19~0 == 1); 13244#L276 assume !(~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && ~a21~0 == 1 && ~a19~0 == 1 && calculate_output_~input == 5 && !(~a11~0 == 1)); 13242#L280 assume !(~a28~0 == 8 && ~a21~0 == 1 && (!(~a11~0 == 1) && (calculate_output_~input == 1 && ~a17~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 13240#L283 assume !((((~a17~0 == 8 && (calculate_output_~input == 6 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a21~0 == 1) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a19~0 == 1); 13238#L286 assume !((!(~a11~0 == 1) && (!(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 11) || (~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1); 13236#L291 assume !(~a17~0 == 8 && (~a21~0 == 1 && !(~a11~0 == 1) && ~a25~0 == 1 && ~a28~0 == 8 && calculate_output_~input == 6) && ~a19~0 == 1); 13234#L293 assume !((~a19~0 == 1 && ~a17~0 == 8 && ((!(~a25~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 11); 13232#L297 assume !(~a11~0 == 1 && (~a17~0 == 9 && ~a28~0 == 9 && ~a19~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 5) && ~a21~0 == 1); 13230#L309 assume !((((((calculate_output_~input == 3 && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a28~0 == 11) && !(~a11~0 == 1)); 13228#L314 assume !(~a19~0 == 1 && ~a21~0 == 1 && ((calculate_output_~input == 5 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7))) && ~a11~0 == 1) && ~a17~0 == 9); 13226#L328 assume !((~a19~0 == 1 && ((!(~a11~0 == 1) && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a28~0 == 10) && ~a21~0 == 1) && ~a17~0 == 8); 13224#L331 assume !((!(~a11~0 == 1) && (((calculate_output_~input == 4 && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1); 13222#L337 assume !(((!(~a19~0 == 1) && (calculate_output_~input == 4 && (((!(~a25~0 == 1) && ~a28~0 == 10) || (~a28~0 == 11 && ~a25~0 == 1)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 13220#L349 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && ((~a25~0 == 1 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 11) && ~a21~0 == 1); 13218#L354 assume !((((~a21~0 == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a28~0 == 9 && ~a25~0 == 1)) && calculate_output_~input == 6) && !(~a11~0 == 1)) && !(~a19~0 == 1)) && ~a17~0 == 8); 13216#L361 assume !(~a19~0 == 1 && ((~a21~0 == 1 && (!(~a25~0 == 1) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a28~0 == 8) && ~a11~0 == 1); 13214#L368 assume !(~a17~0 == 8 && (~a21~0 == 1 && (calculate_output_~input == 5 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a28~0 == 9 && ~a25~0 == 1))) && ~a19~0 == 1) && !(~a11~0 == 1)); 13212#L375 assume !(~a19~0 == 1 && (((~a17~0 == 8 && calculate_output_~input == 5 && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a25~0 == 1) && ~a28~0 == 8); 13210#L378 assume !(((!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 4) && ~a28~0 == 10) && ~a17~0 == 8) && !(~a19~0 == 1)) && ~a25~0 == 1); 13208#L380 assume !(~a28~0 == 8 && (~a19~0 == 1 && ~a11~0 == 1 && !(~a25~0 == 1) && ~a17~0 == 9 && calculate_output_~input == 6) && ~a21~0 == 1); 13206#L389 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 6 && (((~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a17~0 == 8) && !(~a19~0 == 1)); 13204#L394 assume !(((((!(~a25~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 9) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 13202#L398 assume !((~a17~0 == 8 && ((calculate_output_~input == 4 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)); 13200#L402 assume !(((!(~a11~0 == 1) && ((~a19~0 == 1 && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)); 13198#L404 assume !((~a11~0 == 1 && ~a19~0 == 1 && ~a21~0 == 1 && (~a17~0 == 9 && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a28~0 == 8); 13196#L407 assume !(!(~a11~0 == 1) && ~a21~0 == 1 && (~a19~0 == 1 && ~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 5) && ~a28~0 == 11); 13194#L409 assume !(~a19~0 == 1 && ~a17~0 == 8 && ((((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3) && !(~a11~0 == 1)) && ~a21~0 == 1); 13192#L414 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13190#L414-2 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13188#L417-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13186#L420-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13184#L423-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13182#L426-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13180#L429-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13178#L432-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13176#L435-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 12356#L438-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13173#L441-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13171#L444-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13169#L447-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13167#L450-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13165#L453-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13163#L456-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13161#L459-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13159#L462-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13157#L465-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13154#L468-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13152#L471-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13150#L474-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13148#L477-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13146#L480-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13144#L483-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13142#L486-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13140#L489-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13138#L492-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13136#L495-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13135#L498-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13134#L501-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13132#L504-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13130#L507-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13128#L510-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13127#L513-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 12488#L516-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13399#L519-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13397#L522-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13395#L525-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13393#L528-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13391#L531-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13389#L534-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13387#L537-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13385#L540-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13383#L543-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13381#L546-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13379#L549-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13377#L552-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13375#L555-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13373#L558-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13371#L561-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13369#L564-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13367#L567-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13365#L570-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13363#L573-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13361#L576-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13359#L579-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13357#L582-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13355#L585-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13353#L588-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13351#L591-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13349#L594-1 calculate_output_#res := -2; 13347#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 12338#L606-3 [2018-10-27 06:06:20,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:20,104 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2018-10-27 06:06:20,104 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:20,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:20,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:20,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:20,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:20,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:20,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:20,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:20,120 INFO L82 PathProgramCache]: Analyzing trace with hash 245249823, now seen corresponding path program 1 times [2018-10-27 06:06:20,120 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:20,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:20,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:20,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:20,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:20,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:20,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:20,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:20,170 INFO L82 PathProgramCache]: Analyzing trace with hash -2003304803, now seen corresponding path program 1 times [2018-10-27 06:06:20,170 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:20,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:20,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:20,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:20,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:20,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:20,414 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-27 06:06:20,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:06:20,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:06:20,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-27 06:06:21,474 WARN L179 SmtUtils]: Spent 788.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 69 [2018-10-27 06:06:21,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 06:06:21,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-10-27 06:06:21,546 INFO L87 Difference]: Start difference. First operand 1496 states and 1779 transitions. cyclomatic complexity: 286 Second operand 10 states. [2018-10-27 06:06:21,937 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2018-10-27 06:06:22,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:06:22,606 INFO L93 Difference]: Finished difference Result 1688 states and 1968 transitions. [2018-10-27 06:06:22,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-27 06:06:22,608 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1688 states and 1968 transitions. [2018-10-27 06:06:22,613 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1632 [2018-10-27 06:06:22,619 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1688 states to 1688 states and 1968 transitions. [2018-10-27 06:06:22,620 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1688 [2018-10-27 06:06:22,621 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1688 [2018-10-27 06:06:22,621 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1688 states and 1968 transitions. [2018-10-27 06:06:22,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:06:22,625 INFO L705 BuchiCegarLoop]: Abstraction has 1688 states and 1968 transitions. [2018-10-27 06:06:22,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1688 states and 1968 transitions. [2018-10-27 06:06:22,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1688 to 1546. [2018-10-27 06:06:22,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1546 states. [2018-10-27 06:06:22,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 1826 transitions. [2018-10-27 06:06:22,647 INFO L728 BuchiCegarLoop]: Abstraction has 1546 states and 1826 transitions. [2018-10-27 06:06:22,647 INFO L608 BuchiCegarLoop]: Abstraction has 1546 states and 1826 transitions. [2018-10-27 06:06:22,647 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-10-27 06:06:22,647 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1546 states and 1826 transitions. [2018-10-27 06:06:22,652 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1490 [2018-10-27 06:06:22,652 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:22,652 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:22,652 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:22,652 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:22,653 INFO L793 eck$LassoCheckResult]: Stem: 15663#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 15546#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 15547#L606-3 assume true; 16762#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 16758#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 16753#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 16302#L35 assume ~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1);~a28~0 := 10;calculate_output_#res := 22; 15817#L597 [2018-10-27 06:06:22,653 INFO L795 eck$LassoCheckResult]: Loop: 15817#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 16278#L606-3 assume true; 16276#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 16274#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 16272#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 16270#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 16268#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 16266#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 16264#L47 assume ((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10;~a25~0 := 0;calculate_output_#res := -1; 15817#L597 [2018-10-27 06:06:22,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:22,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1805984299, now seen corresponding path program 1 times [2018-10-27 06:06:22,653 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:22,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:22,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:22,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:22,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:22,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:22,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:22,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:22,673 INFO L82 PathProgramCache]: Analyzing trace with hash -278812021, now seen corresponding path program 1 times [2018-10-27 06:06:22,673 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:22,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:22,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:22,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:22,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:22,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:22,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:22,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:22,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1569761375, now seen corresponding path program 1 times [2018-10-27 06:06:22,685 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:22,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:22,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:22,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:22,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:22,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:22,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:23,163 WARN L179 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 32 [2018-10-27 06:06:23,298 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:06:23,298 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:06:23,298 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:06:23,298 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:06:23,298 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-10-27 06:06:23,299 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:23,299 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:06:23,299 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:06:23,299 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label24_true-unreach-call_false-termination.c_Iteration8_Lasso [2018-10-27 06:06:23,299 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:06:23,299 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:06:23,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:23,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:23,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:23,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:23,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:23,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:23,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:23,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:23,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:23,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:23,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:23,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:23,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:23,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:23,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:23,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:23,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:23,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:23,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:23,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:23,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:23,552 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:06:23,553 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fc0f74cf-fc18-4d9b-95da-2b694b7c3ce8/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:23,557 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:06:23,558 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:06:23,560 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:06:23,561 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~u~0=0} Honda state: {~u~0=21} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fc0f74cf-fc18-4d9b-95da-2b694b7c3ce8/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:23,579 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:06:23,580 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:06:23,596 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:06:23,596 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~f~0=0} Honda state: {~f~0=6} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fc0f74cf-fc18-4d9b-95da-2b694b7c3ce8/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:23,600 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:06:23,600 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:06:23,602 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:06:23,603 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fc0f74cf-fc18-4d9b-95da-2b694b7c3ce8/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:23,622 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:06:23,622 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:06:23,644 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:06:23,644 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~y~0=0} Honda state: {~y~0=25} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fc0f74cf-fc18-4d9b-95da-2b694b7c3ce8/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:23,664 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:06:23,664 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:06:23,667 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:06:23,667 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~z~0=0} Honda state: {~z~0=26} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fc0f74cf-fc18-4d9b-95da-2b694b7c3ce8/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:23,688 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:06:23,688 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:06:23,705 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:06:23,706 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a21~0=0} Honda state: {~a21~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fc0f74cf-fc18-4d9b-95da-2b694b7c3ce8/bin-2019/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:23,711 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:06:23,711 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:06:23,714 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:06:23,714 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~v~0=0} Honda state: {~v~0=22} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fc0f74cf-fc18-4d9b-95da-2b694b7c3ce8/bin-2019/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:23,733 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:06:23,733 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:06:23,754 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:06:23,754 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a~0=0} Honda state: {~a~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fc0f74cf-fc18-4d9b-95da-2b694b7c3ce8/bin-2019/uautomizer/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:23,765 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:06:23,765 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:06:23,783 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:06:23,784 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a17~0=0} Honda state: {~a17~0=8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fc0f74cf-fc18-4d9b-95da-2b694b7c3ce8/bin-2019/uautomizer/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:23,788 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:06:23,788 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:06:23,794 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:06:23,794 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret3=0} Honda state: {ULTIMATE.start_main_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fc0f74cf-fc18-4d9b-95da-2b694b7c3ce8/bin-2019/uautomizer/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:23,813 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:06:23,813 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:06:23,832 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:06:23,832 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~e~0=0} Honda state: {~e~0=5} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fc0f74cf-fc18-4d9b-95da-2b694b7c3ce8/bin-2019/uautomizer/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:23,837 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:06:23,837 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:06:23,857 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:06:23,857 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~d~0=0} Honda state: {~d~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fc0f74cf-fc18-4d9b-95da-2b694b7c3ce8/bin-2019/uautomizer/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:23,862 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:06:23,863 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:06:23,866 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:06:23,866 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~w~0=0} Honda state: {~w~0=23} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fc0f74cf-fc18-4d9b-95da-2b694b7c3ce8/bin-2019/uautomizer/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:23,886 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:06:23,886 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:06:23,889 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:06:23,889 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a25~0=0} Honda state: {~a25~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fc0f74cf-fc18-4d9b-95da-2b694b7c3ce8/bin-2019/uautomizer/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:23,908 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:06:23,908 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:06:23,925 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:06:23,925 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c~0=0} Honda state: {~c~0=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fc0f74cf-fc18-4d9b-95da-2b694b7c3ce8/bin-2019/uautomizer/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:23,934 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:06:23,934 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fc0f74cf-fc18-4d9b-95da-2b694b7c3ce8/bin-2019/uautomizer/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:23,959 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-10-27 06:06:23,959 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:06:24,174 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:06:24,174 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#in~input=0, ULTIMATE.start_calculate_output_~input=0, ULTIMATE.start_main_~input~0=0, ULTIMATE.start_main_#t~nondet2=0} Honda state: {ULTIMATE.start_calculate_output_#in~input=6, ULTIMATE.start_calculate_output_~input=6, ULTIMATE.start_main_~input~0=6, ULTIMATE.start_main_#t~nondet2=1} Generalized eigenvectors: [{ULTIMATE.start_calculate_output_#in~input=4, ULTIMATE.start_calculate_output_~input=3, ULTIMATE.start_main_~input~0=5, ULTIMATE.start_main_#t~nondet2=0}, {ULTIMATE.start_calculate_output_#in~input=-4, ULTIMATE.start_calculate_output_~input=-3, ULTIMATE.start_main_~input~0=-5, ULTIMATE.start_main_#t~nondet2=0}, {ULTIMATE.start_calculate_output_#in~input=-5, ULTIMATE.start_calculate_output_~input=-5, ULTIMATE.start_main_~input~0=-5, ULTIMATE.start_main_#t~nondet2=0}] Lambdas: [1, 0, 0] Nus: [1, 0] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fc0f74cf-fc18-4d9b-95da-2b694b7c3ce8/bin-2019/uautomizer/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:24,193 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:06:24,193 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:06:24,222 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:06:24,222 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~x~0=0} Honda state: {~x~0=24} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fc0f74cf-fc18-4d9b-95da-2b694b7c3ce8/bin-2019/uautomizer/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:24,240 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:06:24,240 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fc0f74cf-fc18-4d9b-95da-2b694b7c3ce8/bin-2019/uautomizer/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:24,260 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-10-27 06:06:24,260 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:06:24,419 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:06:24,419 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#res=0, ULTIMATE.start_main_~output~0=0} Honda state: {ULTIMATE.start_calculate_output_#res=22, ULTIMATE.start_main_~output~0=-1} Generalized eigenvectors: [{ULTIMATE.start_calculate_output_#res=-23, ULTIMATE.start_main_~output~0=22}, {ULTIMATE.start_calculate_output_#res=0, ULTIMATE.start_main_~output~0=-23}, {ULTIMATE.start_calculate_output_#res=0, ULTIMATE.start_main_~output~0=24}] Lambdas: [0, 0, 0] Nus: [1, 0] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fc0f74cf-fc18-4d9b-95da-2b694b7c3ce8/bin-2019/uautomizer/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:24,438 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:06:24,438 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:06:24,455 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:06:24,455 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a19~0=0} Honda state: {~a19~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fc0f74cf-fc18-4d9b-95da-2b694b7c3ce8/bin-2019/uautomizer/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:24,459 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:06:24,459 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:06:24,466 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:06:24,466 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a11~0=0} Honda state: {~a11~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fc0f74cf-fc18-4d9b-95da-2b694b7c3ce8/bin-2019/uautomizer/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:24,484 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:06:24,484 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:06:24,487 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:06:24,487 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a28~0=0} Honda state: {~a28~0=10} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2018-10-27 06:06:24,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.10 06:06:24 BoogieIcfgContainer [2018-10-27 06:06:24,529 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-10-27 06:06:24,529 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 06:06:24,529 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 06:06:24,529 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 06:06:24,530 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:06:07" (3/4) ... [2018-10-27 06:06:24,532 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-10-27 06:06:24,588 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_fc0f74cf-fc18-4d9b-95da-2b694b7c3ce8/bin-2019/uautomizer/witness.graphml [2018-10-27 06:06:24,588 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 06:06:24,589 INFO L168 Benchmark]: Toolchain (without parser) took 21054.80 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 394.8 MB). Free memory was 957.1 MB in the beginning and 938.4 MB in the end (delta: 18.7 MB). Peak memory consumption was 413.5 MB. Max. memory is 11.5 GB. [2018-10-27 06:06:24,590 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:06:24,590 INFO L168 Benchmark]: CACSL2BoogieTranslator took 483.56 ms. Allocated memory is still 1.0 GB. Free memory was 957.1 MB in the beginning and 930.3 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2018-10-27 06:06:24,590 INFO L168 Benchmark]: Boogie Procedure Inliner took 213.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 930.3 MB in the beginning and 1.1 GB in the end (delta: -202.1 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. [2018-10-27 06:06:24,591 INFO L168 Benchmark]: Boogie Preprocessor took 70.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:06:24,591 INFO L168 Benchmark]: RCFGBuilder took 2797.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 102.3 MB). Peak memory consumption was 102.3 MB. Max. memory is 11.5 GB. [2018-10-27 06:06:24,591 INFO L168 Benchmark]: BuchiAutomizer took 17426.97 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 249.0 MB). Free memory was 1.0 GB in the beginning and 938.4 MB in the end (delta: 89.9 MB). Peak memory consumption was 338.9 MB. Max. memory is 11.5 GB. [2018-10-27 06:06:24,592 INFO L168 Benchmark]: Witness Printer took 59.63 ms. Allocated memory is still 1.4 GB. Free memory is still 938.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:06:24,602 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 483.56 ms. Allocated memory is still 1.0 GB. Free memory was 957.1 MB in the beginning and 930.3 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 213.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 930.3 MB in the beginning and 1.1 GB in the end (delta: -202.1 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 70.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2797.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 102.3 MB). Peak memory consumption was 102.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 17426.97 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 249.0 MB). Free memory was 1.0 GB in the beginning and 938.4 MB in the end (delta: 89.9 MB). Peak memory consumption was 338.9 MB. Max. memory is 11.5 GB. * Witness Printer took 59.63 ms. Allocated memory is still 1.4 GB. Free memory is still 938.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (7 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.7 modules have a trivial ranking function, the largest among these consists of 10 locations. The remainder module has 1546 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 17.3s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 9.2s. Construction of modules took 6.4s. Büchi inclusion checks took 1.1s. Highest rank in rank-based complementation 0. Minimization of det autom 7. Minimization of nondet autom 0. Automata minimization 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 147 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 1546 states and ocurred in iteration 7. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1468 SDtfs, 3083 SDslu, 488 SDs, 0 SdLazy, 3702 SolverSat, 849 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.4s Time LassoAnalysisResults: nont1 unkn0 SFLI4 SFLT0 conc3 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital65 mio100 ax100 hnf103 lsp39 ukn90 mio100 lsp100 div100 bol100 ite100 ukn100 eq209 hnf93 smp100 dnf148 smp89 tf102 neg98 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 3 Time: 100ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 0 MotzkinApplications: 18 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 31 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - GeometricNonTerminationArgumentResult [Line: 614]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {a19=0, a17=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6675ed08=0, a11=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@bf3f0e6=0, y=0, x=0, z=0, u=0, w=0, v=0, a=0, c=0, a28=0, \old(input)=0, output=0, a25=0, a21=0, d=0, e=0, f=0, input=0, input=0} State at position 1 is {a19=1, a17=8, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6675ed08=0, a11=0, \result=22, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@bf3f0e6=1, y=25, x=24, z=26, u=21, w=23, v=22, a=1, c=3, a28=10, \old(input)=6, output=-1, a25=0, a21=1, d=4, e=5, f=6, input=6, input=6} For i>1, the state at position i is {a19=1 + sum_{k=0}^i 0, a17=8 + sum_{k=0}^i 0, \result=0 + sum_{k=0}^i 0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6675ed08=0 + sum_{k=0}^i 0, a11=0 + sum_{k=0}^i 0, \result=22 + sum_{k=0}^i -23*0^k, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@bf3f0e6=1 + sum_{k=0}^i 0, y=25 + sum_{k=0}^i 0, x=24 + sum_{k=0}^i 0, z=26 + sum_{k=0}^i 0, u=21 + sum_{k=0}^i 0, w=23 + sum_{k=0}^i 0, v=22 + sum_{k=0}^i 0, a=1 + sum_{k=0}^i 0, c=3 + sum_{k=0}^i 0, a28=10 + sum_{k=0}^i 0, \old(input)=6 + sum_{k=0}^i 4 + -4*0^k + -4*k + -5*0^k, output=-1 + sum_{k=0}^i 22*0^k + -23*0^k + -23*k*0^(k-1) + 24*0^k, a25=0 + sum_{k=0}^i 0, a21=1 + sum_{k=0}^i 0, d=4 + sum_{k=0}^i 0, e=5 + sum_{k=0}^i 0, f=6 + sum_{k=0}^i 0, input=6 + sum_{k=0}^i 5 + -5*0^k + -5*k + -5*0^k, input=6 + sum_{k=0}^i 3 + -3*0^k + -3*k + -5*0^k} - StatisticsResult: NonterminationArgumentStatistics Unbounded Execution 6GEVs Lambdas: [1, 0, 0, 0, 0, 0] Mus: [1, 0, 0, 1, 0] - NonterminatingLassoResult [Line: 29]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L7] int a= 1; [L8] int e= 5; [L9] int d= 4; [L10] int f= 6; [L11] int c= 3; [L14] int u = 21; [L15] int v = 22; [L16] int w = 23; [L17] int x = 24; [L18] int y = 25; [L19] int z = 26; [L22] int a25 = 0; [L23] int a11 = 0; [L24] int a28 = 7; [L25] int a19 = 1; [L26] int a21 = 1; [L27] int a17 = 8; [L603] int output = -1; [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND TRUE ((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1))) [L36] a28 = 10 [L37] return 22; Loop: [L614] RET, EXPR calculate_output(input) [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) [L47] COND TRUE ((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10)) [L48] a25 = 0 [L49] return -1; End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...