./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label20.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_bdda6edf-2785-4d6c-a5eb-72f4e6e0e109/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_bdda6edf-2785-4d6c-a5eb-72f4e6e0e109/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_bdda6edf-2785-4d6c-a5eb-72f4e6e0e109/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_bdda6edf-2785-4d6c-a5eb-72f4e6e0e109/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label20.c -s /tmp/vcloud-vcloud-master/worker/working_dir_bdda6edf-2785-4d6c-a5eb-72f4e6e0e109/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_bdda6edf-2785-4d6c-a5eb-72f4e6e0e109/bin/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 5360c3d4aebe9582cd01259f723ea710f280bf1f ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.24-cad4683 [2019-10-22 08:59:57,757 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:59:57,759 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:59:57,768 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:59:57,769 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:59:57,770 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:59:57,771 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:59:57,772 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:59:57,773 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:59:57,774 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:59:57,775 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:59:57,776 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:59:57,776 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:59:57,777 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:59:57,778 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:59:57,778 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:59:57,779 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:59:57,780 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:59:57,782 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:59:57,784 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:59:57,785 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:59:57,786 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:59:57,787 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:59:57,788 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:59:57,791 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:59:57,791 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:59:57,791 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:59:57,792 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:59:57,793 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:59:57,793 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:59:57,794 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:59:57,795 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:59:57,795 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:59:57,796 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:59:57,797 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:59:57,797 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:59:57,798 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:59:57,798 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:59:57,799 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:59:57,800 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:59:57,800 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:59:57,801 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_bdda6edf-2785-4d6c-a5eb-72f4e6e0e109/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-10-22 08:59:57,816 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:59:57,816 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:59:57,817 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:59:57,818 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:59:57,818 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:59:57,818 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:59:57,818 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:59:57,818 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:59:57,819 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:59:57,819 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:59:57,819 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:59:57,819 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:59:57,819 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:59:57,819 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:59:57,820 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:59:57,820 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:59:57,820 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:59:57,820 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:59:57,820 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:59:57,820 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:59:57,821 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:59:57,821 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:59:57,821 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:59:57,821 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:59:57,821 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:59:57,821 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:59:57,822 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:59:57,822 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:59:57,822 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:59:57,822 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:59:57,822 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:59:57,823 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:59:57,824 INFO L138 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_bdda6edf-2785-4d6c-a5eb-72f4e6e0e109/bin/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 -> 5360c3d4aebe9582cd01259f723ea710f280bf1f [2019-10-22 08:59:57,852 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:59:57,864 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:59:57,868 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:59:57,870 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:59:57,870 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:59:57,871 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_bdda6edf-2785-4d6c-a5eb-72f4e6e0e109/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem02_label20.c [2019-10-22 08:59:57,932 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bdda6edf-2785-4d6c-a5eb-72f4e6e0e109/bin/uautomizer/data/6fa8ae070/da908dffd7dd41da8034a8ba5b2d5567/FLAG19dc636fa [2019-10-22 08:59:58,431 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:59:58,431 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_bdda6edf-2785-4d6c-a5eb-72f4e6e0e109/sv-benchmarks/c/eca-rers2012/Problem02_label20.c [2019-10-22 08:59:58,443 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bdda6edf-2785-4d6c-a5eb-72f4e6e0e109/bin/uautomizer/data/6fa8ae070/da908dffd7dd41da8034a8ba5b2d5567/FLAG19dc636fa [2019-10-22 08:59:58,943 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_bdda6edf-2785-4d6c-a5eb-72f4e6e0e109/bin/uautomizer/data/6fa8ae070/da908dffd7dd41da8034a8ba5b2d5567 [2019-10-22 08:59:58,946 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:59:58,947 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:59:58,948 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:59:58,948 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:59:58,952 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:59:58,953 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:59:58" (1/1) ... [2019-10-22 08:59:58,956 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f0d4389 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:58, skipping insertion in model container [2019-10-22 08:59:58,956 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:59:58" (1/1) ... [2019-10-22 08:59:58,963 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:59:59,019 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:59:59,466 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:59:59,477 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:59:59,601 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:59:59,618 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:59:59,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:59 WrapperNode [2019-10-22 08:59:59,619 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:59:59,620 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:59:59,620 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:59:59,620 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:59:59,630 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:59" (1/1) ... [2019-10-22 08:59:59,646 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:59" (1/1) ... [2019-10-22 08:59:59,716 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:59:59,716 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:59:59,716 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:59:59,716 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:59:59,728 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:59" (1/1) ... [2019-10-22 08:59:59,728 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:59" (1/1) ... [2019-10-22 08:59:59,733 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:59" (1/1) ... [2019-10-22 08:59:59,733 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:59" (1/1) ... [2019-10-22 08:59:59,770 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:59" (1/1) ... [2019-10-22 08:59:59,785 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:59" (1/1) ... [2019-10-22 08:59:59,800 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:59" (1/1) ... [2019-10-22 08:59:59,805 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:59:59,805 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:59:59,805 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:59:59,805 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:59:59,806 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:59" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bdda6edf-2785-4d6c-a5eb-72f4e6e0e109/bin/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 [2019-10-22 08:59:59,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:59:59,883 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:00:01,347 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:00:01,348 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 09:00:01,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:00:01 BoogieIcfgContainer [2019-10-22 09:00:01,349 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:00:01,350 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 09:00:01,350 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 09:00:01,356 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 09:00:01,357 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:00:01,357 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:59:58" (1/3) ... [2019-10-22 09:00:01,358 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@10b85bd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:00:01, skipping insertion in model container [2019-10-22 09:00:01,359 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:00:01,359 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:59" (2/3) ... [2019-10-22 09:00:01,360 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@10b85bd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:00:01, skipping insertion in model container [2019-10-22 09:00:01,360 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:00:01,360 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:00:01" (3/3) ... [2019-10-22 09:00:01,362 INFO L371 chiAutomizerObserver]: Analyzing ICFG Problem02_label20.c [2019-10-22 09:00:01,411 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 09:00:01,411 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 09:00:01,411 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 09:00:01,411 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:00:01,411 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:00:01,412 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 09:00:01,413 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:00:01,413 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 09:00:01,438 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states. [2019-10-22 09:00:01,479 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 221 [2019-10-22 09:00:01,479 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:01,482 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:01,494 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 09:00:01,495 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 09:00:01,495 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 09:00:01,495 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states. [2019-10-22 09:00:01,507 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 221 [2019-10-22 09:00:01,507 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:01,507 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:01,513 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 09:00:01,514 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 09:00:01,523 INFO L791 eck$LassoCheckResult]: Stem: 78#ULTIMATE.startENTRYtrue ~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 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 164#L606-2true [2019-10-22 09:00:01,523 INFO L793 eck$LassoCheckResult]: Loop: 164#L606-2true assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 65#L611true assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 191#L30true assume ((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 206#L597true main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 164#L606-2true [2019-10-22 09:00:01,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:01,530 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-10-22 09:00:01,538 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:01,538 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96116405] [2019-10-22 09:00:01,539 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:01,539 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:01,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:01,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:01,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:01,657 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:01,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:01,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1268139, now seen corresponding path program 1 times [2019-10-22 09:00:01,658 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:01,658 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894002620] [2019-10-22 09:00:01,659 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:01,659 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:01,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:01,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:01,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:01,696 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:01,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:01,698 INFO L82 PathProgramCache]: Analyzing trace with hash 889695341, now seen corresponding path program 1 times [2019-10-22 09:00:01,698 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:01,698 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232321] [2019-10-22 09:00:01,699 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:01,699 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:01,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:01,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:01,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:01,783 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232321] [2019-10-22 09:00:01,783 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:01,784 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:00:01,784 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730416729] [2019-10-22 09:00:01,904 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2019-10-22 09:00:01,967 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:01,968 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:01,968 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:01,968 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:01,968 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 09:00:01,969 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:01,969 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:01,969 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:01,969 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label20.c_Iteration1_Loop [2019-10-22 09:00:01,969 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:01,970 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:01,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:02,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:02,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:02,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:02,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:02,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:02,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:02,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:02,349 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 23 [2019-10-22 09:00:02,427 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:02,429 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bdda6edf-2785-4d6c-a5eb-72f4e6e0e109/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:00:02,441 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:02,441 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:02,451 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:02,452 INFO L440 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_bdda6edf-2785-4d6c-a5eb-72f4e6e0e109/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:00:02,463 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:02,464 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:02,474 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:02,474 INFO L440 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_bdda6edf-2785-4d6c-a5eb-72f4e6e0e109/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:00:02,483 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:02,483 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:02,491 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:02,491 INFO L440 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_bdda6edf-2785-4d6c-a5eb-72f4e6e0e109/bin/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:00:02,515 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:02,516 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:02,522 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:02,523 INFO L440 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_bdda6edf-2785-4d6c-a5eb-72f4e6e0e109/bin/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:00:02,531 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:02,532 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:02,538 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:02,538 INFO L440 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_bdda6edf-2785-4d6c-a5eb-72f4e6e0e109/bin/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:00:02,547 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:02,547 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:02,552 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:02,552 INFO L440 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_bdda6edf-2785-4d6c-a5eb-72f4e6e0e109/bin/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 [2019-10-22 09:00:02,562 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:02,562 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:02,574 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:02,575 INFO L440 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_bdda6edf-2785-4d6c-a5eb-72f4e6e0e109/bin/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 [2019-10-22 09:00:02,588 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:02,588 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bdda6edf-2785-4d6c-a5eb-72f4e6e0e109/bin/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:00:02,611 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 09:00:02,611 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:02,659 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 09:00:02,662 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:02,662 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:02,662 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:02,663 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:02,663 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:00:02,663 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:02,663 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:02,663 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:02,663 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label20.c_Iteration1_Loop [2019-10-22 09:00:02,664 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:02,664 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:02,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:02,805 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-10-22 09:00:02,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:02,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:02,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:02,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:02,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:02,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:02,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:03,173 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 23 [2019-10-22 09:00:03,222 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:03,232 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:00:03,234 INFO L120 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 [2019-10-22 09:00:03,248 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:03,248 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:03,249 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:03,249 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:03,249 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:03,252 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:03,252 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:03,274 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:03,275 INFO L120 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 [2019-10-22 09:00:03,277 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:03,277 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:03,278 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:03,278 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:03,278 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:03,279 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:03,283 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:03,287 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:03,288 INFO L120 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 [2019-10-22 09:00:03,288 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:03,289 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:03,289 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:03,289 INFO L203 nArgumentSynthesizer]: 3 loop disjuncts [2019-10-22 09:00:03,289 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:03,291 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:03,292 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:03,330 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:03,330 INFO L120 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 [2019-10-22 09:00:03,331 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:03,331 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:03,331 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:03,331 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:03,332 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:03,332 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:03,332 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:03,345 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:03,346 INFO L120 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 [2019-10-22 09:00:03,347 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:03,347 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:03,347 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:03,347 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:03,347 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:03,348 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:03,348 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:03,356 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:03,357 INFO L120 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 [2019-10-22 09:00:03,358 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:03,359 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:03,360 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:03,360 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:03,360 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:03,360 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:03,361 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:03,363 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:03,363 INFO L120 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 [2019-10-22 09:00:03,367 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:03,367 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:03,367 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:03,367 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:03,368 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:03,368 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:03,368 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:03,369 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:03,370 INFO L120 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 [2019-10-22 09:00:03,370 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:03,370 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:03,371 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:03,371 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:00:03,371 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:03,372 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:00:03,379 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:03,389 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:03,389 INFO L489 LassoAnalysis]: Using template '2-nested'. [2019-10-22 09:00:03,390 INFO L120 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 [2019-10-22 09:00:03,390 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:03,391 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:03,391 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:03,391 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:03,391 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:00:03,392 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 09:00:03,392 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:03,402 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:03,403 INFO L120 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 [2019-10-22 09:00:03,405 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:03,405 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:03,405 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:03,405 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:03,405 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:00:03,406 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 09:00:03,406 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:03,409 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:03,409 INFO L120 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 [2019-10-22 09:00:03,410 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:03,410 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:03,410 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:03,410 INFO L203 nArgumentSynthesizer]: 3 loop disjuncts [2019-10-22 09:00:03,410 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:00:03,413 INFO L400 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-10-22 09:00:03,413 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:03,455 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:03,455 INFO L120 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 [2019-10-22 09:00:03,456 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:03,456 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:03,456 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:03,456 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:03,456 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:00:03,457 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 09:00:03,457 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:03,461 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:03,462 INFO L120 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 [2019-10-22 09:00:03,463 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:03,463 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:03,463 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:03,463 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:03,463 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:00:03,464 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 09:00:03,464 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:03,466 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:03,466 INFO L120 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 [2019-10-22 09:00:03,467 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:03,467 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:03,467 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:03,468 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:03,468 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:00:03,468 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 09:00:03,468 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:03,476 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:03,477 INFO L120 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 [2019-10-22 09:00:03,477 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:03,477 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:03,478 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:03,478 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:03,478 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:00:03,478 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 09:00:03,478 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:03,479 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:03,480 INFO L120 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 [2019-10-22 09:00:03,480 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:03,480 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:03,480 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:03,481 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:00:03,481 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:00:03,482 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:03,482 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:03,487 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:03,487 INFO L489 LassoAnalysis]: Using template '3-nested'. [2019-10-22 09:00:03,488 INFO L120 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 [2019-10-22 09:00:03,488 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:03,488 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:03,488 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:03,489 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:03,489 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:03,490 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:00:03,490 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:03,512 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:03,512 INFO L120 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 [2019-10-22 09:00:03,513 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:03,513 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:03,513 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:03,514 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:03,514 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:03,514 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:00:03,514 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:03,525 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:03,526 INFO L120 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 [2019-10-22 09:00:03,526 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:03,526 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:03,527 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:03,527 INFO L203 nArgumentSynthesizer]: 3 loop disjuncts [2019-10-22 09:00:03,527 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:03,529 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 09:00:03,529 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:03,563 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:03,564 INFO L120 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 [2019-10-22 09:00:03,565 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:03,565 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:03,565 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:03,565 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:03,565 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:03,566 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:00:03,566 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:03,577 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:03,577 INFO L120 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 [2019-10-22 09:00:03,578 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:03,578 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:03,578 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:03,579 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:03,579 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:03,579 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:00:03,589 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:03,592 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:03,592 INFO L120 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 [2019-10-22 09:00:03,593 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:03,593 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:03,593 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:03,593 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:03,593 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:03,594 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:00:03,594 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:03,600 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:03,601 INFO L120 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 [2019-10-22 09:00:03,602 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:03,602 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:03,602 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:03,602 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:03,602 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:03,603 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:00:03,603 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:03,608 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:03,609 INFO L120 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 [2019-10-22 09:00:03,609 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:03,609 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:03,610 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:03,610 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:00:03,610 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:03,611 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 09:00:03,611 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:03,622 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:03,622 INFO L489 LassoAnalysis]: Using template '4-nested'. [2019-10-22 09:00:03,623 INFO L120 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 [2019-10-22 09:00:03,624 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:03,624 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:03,624 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:03,624 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:03,624 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:00:03,625 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 09:00:03,626 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:03,639 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:03,640 INFO L120 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 [2019-10-22 09:00:03,640 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:03,640 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:03,641 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:03,641 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:03,641 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:00:03,641 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 09:00:03,642 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:03,646 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:03,647 INFO L120 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 [2019-10-22 09:00:03,647 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:03,647 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:03,648 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:03,648 INFO L203 nArgumentSynthesizer]: 3 loop disjuncts [2019-10-22 09:00:03,648 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:00:03,650 INFO L400 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-10-22 09:00:03,651 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:03,696 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:03,696 INFO L120 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 [2019-10-22 09:00:03,697 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:03,697 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:03,697 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:03,697 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:03,698 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:00:03,698 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 09:00:03,699 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:03,706 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:03,706 INFO L120 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 [2019-10-22 09:00:03,707 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:03,707 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:03,707 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:03,707 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:03,710 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:00:03,711 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 09:00:03,711 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:03,713 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:03,714 INFO L120 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 [2019-10-22 09:00:03,714 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:03,714 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:03,714 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:03,715 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:03,715 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:00:03,715 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 09:00:03,717 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:03,720 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:03,720 INFO L120 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 [2019-10-22 09:00:03,721 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:03,721 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:03,721 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:03,721 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:03,721 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:00:03,722 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 09:00:03,722 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:03,723 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:03,723 INFO L120 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 [2019-10-22 09:00:03,724 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:03,725 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:03,725 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:03,725 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:00:03,725 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:00:03,726 INFO L400 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-10-22 09:00:03,726 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:03,733 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:03,733 INFO L489 LassoAnalysis]: Using template '2-phase'. [2019-10-22 09:00:03,734 INFO L120 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 [2019-10-22 09:00:03,734 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:03,735 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:00:03,735 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:03,735 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:03,735 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:03,735 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:00:03,740 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 09:00:03,740 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:03,759 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:03,760 INFO L120 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 [2019-10-22 09:00:03,761 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:03,761 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:00:03,761 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:03,761 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:03,761 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:03,762 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:00:03,762 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 09:00:03,763 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:03,766 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:03,767 INFO L120 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 [2019-10-22 09:00:03,768 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:03,768 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:00:03,768 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:03,768 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:03,769 INFO L203 nArgumentSynthesizer]: 3 loop disjuncts [2019-10-22 09:00:03,769 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:00:03,771 INFO L400 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-10-22 09:00:03,771 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:03,823 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:03,823 INFO L120 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 [2019-10-22 09:00:03,826 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:03,826 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:00:03,826 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:03,827 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:03,827 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:03,827 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:00:03,828 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 09:00:03,828 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:03,838 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:03,839 INFO L120 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 [2019-10-22 09:00:03,839 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:03,839 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:00:03,840 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:03,840 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:03,840 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:03,840 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:00:03,841 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 09:00:03,841 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:03,846 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:03,846 INFO L120 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 [2019-10-22 09:00:03,847 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:03,847 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:00:03,847 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:03,847 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:03,847 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:03,847 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:00:03,848 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 09:00:03,848 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:03,854 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:03,855 INFO L120 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 [2019-10-22 09:00:03,855 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:03,855 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:00:03,855 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:03,856 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:03,856 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:03,856 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:00:03,856 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 09:00:03,857 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:03,858 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:03,859 INFO L120 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 [2019-10-22 09:00:03,860 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:03,860 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:00:03,861 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:03,861 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:03,861 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:00:03,861 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:00:03,862 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:03,862 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:03,873 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:03,874 INFO L489 LassoAnalysis]: Using template '3-phase'. [2019-10-22 09:00:03,874 INFO L120 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 [2019-10-22 09:00:03,875 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:03,875 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 09:00:03,875 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:03,875 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:03,876 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:03,876 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:03,878 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:00:03,878 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:03,903 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:03,905 INFO L120 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 [2019-10-22 09:00:03,906 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:03,906 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 09:00:03,906 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:03,906 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:03,906 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:03,907 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:03,908 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:00:03,908 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:03,912 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:03,913 INFO L120 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 [2019-10-22 09:00:03,914 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:03,914 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 09:00:03,914 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:03,914 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:03,914 INFO L203 nArgumentSynthesizer]: 3 loop disjuncts [2019-10-22 09:00:03,914 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:03,919 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 09:00:03,923 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:04,032 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:04,033 INFO L120 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 [2019-10-22 09:00:04,034 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:04,035 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 09:00:04,036 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:04,036 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:04,036 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:04,036 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:04,038 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:00:04,038 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:04,045 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:04,045 INFO L120 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 [2019-10-22 09:00:04,046 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:04,048 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 09:00:04,048 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:04,048 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:04,048 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:04,048 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:04,049 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:00:04,049 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:04,054 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:04,056 INFO L120 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 [2019-10-22 09:00:04,056 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:04,056 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 09:00:04,057 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:04,057 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:04,057 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:04,057 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:04,058 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:00:04,058 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:04,063 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:04,064 INFO L120 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 [2019-10-22 09:00:04,066 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:04,067 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 09:00:04,067 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:04,067 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:04,067 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:04,067 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:04,068 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:00:04,069 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:04,070 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:04,071 INFO L120 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 [2019-10-22 09:00:04,071 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:04,072 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 09:00:04,072 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:04,072 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:04,072 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:00:04,073 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:04,074 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 09:00:04,075 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:04,086 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:04,087 INFO L489 LassoAnalysis]: Using template '4-phase'. [2019-10-22 09:00:04,087 INFO L120 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 [2019-10-22 09:00:04,088 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:04,088 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:00:04,089 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:04,089 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:04,089 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:04,089 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:00:04,093 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 09:00:04,093 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:04,117 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:04,117 INFO L120 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 [2019-10-22 09:00:04,118 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:04,118 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:00:04,118 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:04,118 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:04,118 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:04,119 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:00:04,121 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 09:00:04,121 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:04,127 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:04,128 INFO L120 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 [2019-10-22 09:00:04,129 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:04,130 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:00:04,130 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:04,130 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:04,130 INFO L203 nArgumentSynthesizer]: 3 loop disjuncts [2019-10-22 09:00:04,130 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:00:04,137 INFO L400 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-10-22 09:00:04,143 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:04,311 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:04,312 INFO L120 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 [2019-10-22 09:00:04,313 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:04,313 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:00:04,313 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:04,313 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:04,313 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:04,313 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:00:04,316 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 09:00:04,316 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:04,325 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:04,325 INFO L120 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 [2019-10-22 09:00:04,326 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:04,326 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:00:04,326 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:04,326 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:04,326 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:04,326 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:00:04,328 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 09:00:04,328 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:04,333 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:04,333 INFO L120 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 [2019-10-22 09:00:04,334 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:04,334 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:00:04,334 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:04,334 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:04,335 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:04,335 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:00:04,336 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 09:00:04,336 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:04,342 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:04,342 INFO L120 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 [2019-10-22 09:00:04,343 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:04,343 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:00:04,343 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:04,344 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:04,344 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:04,344 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:00:04,345 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 09:00:04,345 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:04,346 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:04,346 INFO L120 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 [2019-10-22 09:00:04,347 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:04,347 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:00:04,347 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:04,348 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:04,348 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:00:04,348 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:00:04,351 INFO L400 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-10-22 09:00:04,351 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:04,364 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:04,364 INFO L489 LassoAnalysis]: Using template '2-lex'. [2019-10-22 09:00:04,365 INFO L120 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 [2019-10-22 09:00:04,365 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:04,365 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:00:04,365 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:04,366 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:04,366 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:04,366 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:04,367 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:00:04,367 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:04,380 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:04,381 INFO L120 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 [2019-10-22 09:00:04,381 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:04,382 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:00:04,382 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:04,382 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:04,382 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:04,382 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:04,382 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:00:04,383 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:04,385 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:04,386 INFO L120 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 [2019-10-22 09:00:04,386 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:04,386 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:00:04,386 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:04,387 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:04,387 INFO L203 nArgumentSynthesizer]: 3 loop disjuncts [2019-10-22 09:00:04,387 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:04,392 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 09:00:04,393 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:04,433 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:04,434 INFO L120 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 [2019-10-22 09:00:04,434 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:04,435 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:00:04,435 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:04,435 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:04,435 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:04,435 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:04,436 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:00:04,436 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:04,440 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:04,440 INFO L120 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 [2019-10-22 09:00:04,441 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:04,441 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:00:04,441 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:04,441 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:04,442 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:04,442 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:04,442 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:00:04,442 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:04,444 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:04,445 INFO L120 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 [2019-10-22 09:00:04,445 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:04,446 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:00:04,446 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:04,446 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:04,446 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:04,446 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:04,447 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:00:04,447 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:04,449 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:04,449 INFO L120 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 [2019-10-22 09:00:04,450 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:04,450 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:00:04,450 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:04,450 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:04,450 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:04,451 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:04,451 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:00:04,451 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:04,453 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:04,453 INFO L120 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 [2019-10-22 09:00:04,454 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:04,454 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:00:04,454 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:04,454 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:04,455 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:00:04,455 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:04,455 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 09:00:04,456 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:04,463 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:04,464 INFO L489 LassoAnalysis]: Using template '3-lex'. [2019-10-22 09:00:04,464 INFO L120 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 [2019-10-22 09:00:04,465 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:04,465 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:00:04,465 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:04,465 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:04,465 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:04,465 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 09:00:04,467 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:04,467 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:04,537 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:04,538 INFO L120 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 [2019-10-22 09:00:04,538 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:04,538 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:00:04,539 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:04,539 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:04,539 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:04,539 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 09:00:04,540 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:04,540 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:04,544 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:04,545 INFO L120 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 [2019-10-22 09:00:04,545 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:04,545 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:00:04,546 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:04,546 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:04,546 INFO L203 nArgumentSynthesizer]: 3 loop disjuncts [2019-10-22 09:00:04,546 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 09:00:04,550 INFO L400 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2019-10-22 09:00:04,550 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:04,747 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:04,747 INFO L120 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 [2019-10-22 09:00:04,748 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:04,748 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:00:04,748 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:04,748 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:04,749 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:04,749 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 09:00:04,750 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:04,750 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:04,758 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:04,759 INFO L120 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 [2019-10-22 09:00:04,759 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:04,759 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:00:04,770 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:04,770 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:04,771 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:04,771 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 09:00:04,771 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:04,771 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:04,775 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:04,775 INFO L120 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 [2019-10-22 09:00:04,776 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:04,776 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:00:04,776 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:04,776 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:04,776 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:04,776 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 09:00:04,777 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:04,777 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:04,780 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:04,780 INFO L120 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 [2019-10-22 09:00:04,781 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:04,781 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:00:04,781 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:04,781 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:04,781 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:04,782 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 09:00:04,782 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:04,782 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:04,785 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:04,785 INFO L120 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 [2019-10-22 09:00:04,786 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:04,786 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:00:04,786 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:04,786 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:04,786 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:00:04,786 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 09:00:04,789 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 09:00:04,789 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:04,800 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:04,801 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:04,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:04,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:04,818 INFO L87 Difference]: Start difference. First operand 226 states. Second operand 3 states. [2019-10-22 09:00:05,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:05,753 INFO L93 Difference]: Finished difference Result 374 states and 489 transitions. [2019-10-22 09:00:05,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:05,755 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 374 states and 489 transitions. [2019-10-22 09:00:05,765 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 305 [2019-10-22 09:00:05,779 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 374 states to 307 states and 409 transitions. [2019-10-22 09:00:05,781 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 307 [2019-10-22 09:00:05,782 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 307 [2019-10-22 09:00:05,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 307 states and 409 transitions. [2019-10-22 09:00:05,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:05,787 INFO L688 BuchiCegarLoop]: Abstraction has 307 states and 409 transitions. [2019-10-22 09:00:05,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states and 409 transitions. [2019-10-22 09:00:05,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 305. [2019-10-22 09:00:05,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-10-22 09:00:05,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 405 transitions. [2019-10-22 09:00:05,837 INFO L711 BuchiCegarLoop]: Abstraction has 305 states and 405 transitions. [2019-10-22 09:00:05,838 INFO L591 BuchiCegarLoop]: Abstraction has 305 states and 405 transitions. [2019-10-22 09:00:05,838 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 09:00:05,838 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 305 states and 405 transitions. [2019-10-22 09:00:05,840 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 303 [2019-10-22 09:00:05,841 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:05,841 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:05,841 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 09:00:05,842 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:05,842 INFO L791 eck$LassoCheckResult]: Stem: 765#ULTIMATE.startENTRY ~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; 630#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 631#L606-2 [2019-10-22 09:00:05,842 INFO L793 eck$LassoCheckResult]: Loop: 631#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 720#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 756#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 760#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 776#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 712#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 713#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 705#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 633#L54 assume (((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0);~a28~0 := 7;~a11~0 := 1;~a25~0 := 0;calculate_output_#res := -1; 634#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 631#L606-2 [2019-10-22 09:00:05,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:05,843 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-10-22 09:00:05,843 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:05,843 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848708799] [2019-10-22 09:00:05,843 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:05,843 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:05,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:05,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:05,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:05,858 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:05,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:05,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1948456188, now seen corresponding path program 1 times [2019-10-22 09:00:05,859 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:05,859 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535869808] [2019-10-22 09:00:05,859 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:05,859 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:05,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:05,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:05,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:05,876 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:05,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:05,877 INFO L82 PathProgramCache]: Analyzing trace with hash -141898178, now seen corresponding path program 1 times [2019-10-22 09:00:05,877 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:05,877 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449847887] [2019-10-22 09:00:05,877 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:05,877 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:05,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:05,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:05,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:05,975 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449847887] [2019-10-22 09:00:05,975 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:05,975 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:00:05,976 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012997337] [2019-10-22 09:00:06,091 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 41 [2019-10-22 09:00:06,123 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:06,123 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:06,123 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:06,123 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:06,124 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 09:00:06,124 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:06,124 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:06,124 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:06,124 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label20.c_Iteration2_Loop [2019-10-22 09:00:06,124 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:06,124 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:06,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:06,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:06,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:06,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:06,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:06,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:06,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:06,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:06,313 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:06,313 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bdda6edf-2785-4d6c-a5eb-72f4e6e0e109/bin/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 [2019-10-22 09:00:06,319 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:06,319 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:06,324 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:06,324 INFO L440 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_bdda6edf-2785-4d6c-a5eb-72f4e6e0e109/bin/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 [2019-10-22 09:00:06,340 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:06,340 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:06,346 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:06,346 INFO L440 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_bdda6edf-2785-4d6c-a5eb-72f4e6e0e109/bin/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:00:06,353 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:06,354 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:06,362 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:06,362 INFO L440 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_bdda6edf-2785-4d6c-a5eb-72f4e6e0e109/bin/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:00:06,376 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:06,376 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:06,381 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:06,381 INFO L440 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_bdda6edf-2785-4d6c-a5eb-72f4e6e0e109/bin/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:00:06,391 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:06,391 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:06,407 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:06,408 INFO L440 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_bdda6edf-2785-4d6c-a5eb-72f4e6e0e109/bin/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 [2019-10-22 09:00:06,416 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:06,416 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bdda6edf-2785-4d6c-a5eb-72f4e6e0e109/bin/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 [2019-10-22 09:00:06,430 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 09:00:06,430 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:06,450 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 09:00:06,452 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:06,452 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:06,452 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:06,452 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:06,452 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:00:06,452 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:06,452 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:06,453 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:06,453 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label20.c_Iteration2_Loop [2019-10-22 09:00:06,453 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:06,453 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:06,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:06,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:06,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:06,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:06,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:06,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:06,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:06,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:06,691 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:06,692 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:00:06,692 INFO L120 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 [2019-10-22 09:00:06,692 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:06,693 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:06,693 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:06,693 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:06,693 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:06,693 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:06,693 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:06,694 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:06,695 INFO L120 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 [2019-10-22 09:00:06,695 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:06,695 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:06,695 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:06,699 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:00:06,699 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:06,699 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:00:06,699 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:06,700 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:06,700 INFO L120 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 [2019-10-22 09:00:06,701 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:06,701 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:06,701 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:06,701 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:06,701 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:06,701 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:06,701 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:06,702 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:06,702 INFO L120 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 [2019-10-22 09:00:06,702 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:06,702 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:06,703 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:06,703 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:06,703 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:06,703 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:06,703 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:06,704 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:06,705 INFO L120 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 [2019-10-22 09:00:06,705 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:06,705 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:06,705 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:06,705 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:00:06,705 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:06,706 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:00:06,706 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:06,707 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:06,708 INFO L120 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 [2019-10-22 09:00:06,708 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:06,708 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:06,708 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:06,708 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:00:06,709 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:06,709 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:00:06,709 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:06,712 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:06,712 INFO L120 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 [2019-10-22 09:00:06,713 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:06,713 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:06,713 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:06,713 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:06,713 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:06,714 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:06,714 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:06,715 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:06,715 INFO L120 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 [2019-10-22 09:00:06,716 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:06,716 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:06,716 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:06,716 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:06,716 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:06,717 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:06,717 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:06,718 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:06,718 INFO L489 LassoAnalysis]: Using template '2-nested'. [2019-10-22 09:00:06,718 INFO L120 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 [2019-10-22 09:00:06,718 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:06,719 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:06,719 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:06,719 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:06,719 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:00:06,719 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 09:00:06,721 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:06,722 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:06,722 INFO L120 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 [2019-10-22 09:00:06,723 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:06,723 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:06,723 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:06,723 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:00:06,723 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:00:06,723 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:06,724 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:06,724 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:06,724 INFO L120 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 [2019-10-22 09:00:06,725 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:06,725 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:06,725 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:06,725 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:06,725 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:00:06,725 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 09:00:06,725 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:06,726 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:06,726 INFO L120 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 [2019-10-22 09:00:06,726 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:06,727 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:06,727 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:06,727 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:06,727 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:00:06,727 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 09:00:06,728 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:06,729 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:06,729 INFO L120 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 [2019-10-22 09:00:06,730 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:06,730 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:06,730 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:06,730 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:00:06,730 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:00:06,731 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:06,731 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:06,733 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:06,734 INFO L120 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 [2019-10-22 09:00:06,734 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:06,734 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:06,734 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:06,734 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:00:06,735 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:00:06,735 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:06,735 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:06,739 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:06,740 INFO L120 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 [2019-10-22 09:00:06,740 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:06,740 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:06,741 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:06,741 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:06,741 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:00:06,741 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 09:00:06,741 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:06,744 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:06,744 INFO L120 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 [2019-10-22 09:00:06,745 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:06,745 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:06,745 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:06,745 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:06,745 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:00:06,746 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 09:00:06,746 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:06,756 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:06,756 INFO L489 LassoAnalysis]: Using template '3-nested'. [2019-10-22 09:00:06,757 INFO L120 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 [2019-10-22 09:00:06,757 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:06,757 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:06,757 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:06,758 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:06,758 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:06,758 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:00:06,758 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:06,760 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:06,760 INFO L120 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 [2019-10-22 09:00:06,760 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:06,760 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:06,761 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:06,761 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:00:06,761 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:06,761 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 09:00:06,761 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:06,762 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:06,762 INFO L120 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 [2019-10-22 09:00:06,762 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:06,763 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:06,763 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:06,763 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:06,763 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:06,763 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:00:06,765 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:06,765 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:06,766 INFO L120 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 [2019-10-22 09:00:06,766 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:06,766 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:06,766 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:06,766 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:06,766 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:06,767 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:00:06,767 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:06,768 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:06,769 INFO L120 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 [2019-10-22 09:00:06,769 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:06,770 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:06,771 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:06,771 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:00:06,771 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:06,771 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 09:00:06,771 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:06,775 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:06,775 INFO L120 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 [2019-10-22 09:00:06,776 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:06,776 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:06,776 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:06,776 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:00:06,776 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:06,777 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 09:00:06,777 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:06,783 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:06,783 INFO L120 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 [2019-10-22 09:00:06,784 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:06,784 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:06,784 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:06,784 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:06,784 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:06,785 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:00:06,785 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:06,789 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:06,789 INFO L120 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 [2019-10-22 09:00:06,790 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:06,790 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:06,790 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:06,790 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:06,790 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:06,791 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:00:06,791 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:06,793 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:06,794 INFO L489 LassoAnalysis]: Using template '4-nested'. [2019-10-22 09:00:06,794 INFO L120 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 [2019-10-22 09:00:06,794 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:06,794 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:06,795 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:06,795 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:06,795 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:00:06,795 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 09:00:06,796 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:06,798 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:06,798 INFO L120 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 [2019-10-22 09:00:06,798 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:06,799 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:06,799 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:06,799 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:00:06,799 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:00:06,800 INFO L400 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-10-22 09:00:06,800 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:06,800 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:06,801 INFO L120 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 [2019-10-22 09:00:06,801 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:06,801 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:06,802 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:06,802 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:06,802 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:00:06,802 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 09:00:06,802 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:06,803 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:06,803 INFO L120 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 [2019-10-22 09:00:06,804 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:06,804 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:06,804 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:06,804 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:06,805 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:00:06,805 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 09:00:06,805 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:06,807 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:06,807 INFO L120 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 [2019-10-22 09:00:06,808 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:06,808 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:06,808 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:06,808 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:00:06,808 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:00:06,809 INFO L400 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-10-22 09:00:06,809 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:06,814 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:06,814 INFO L120 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 [2019-10-22 09:00:06,814 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:06,815 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:06,815 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:06,815 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:00:06,815 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:00:06,816 INFO L400 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-10-22 09:00:06,816 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:06,823 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:06,824 INFO L120 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 [2019-10-22 09:00:06,824 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:06,824 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:06,825 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:06,825 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:06,825 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:00:06,826 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 09:00:06,826 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:06,830 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:06,830 INFO L120 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 [2019-10-22 09:00:06,831 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:06,831 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:06,831 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:06,832 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:06,832 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:00:06,832 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 09:00:06,832 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:06,835 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:06,835 INFO L489 LassoAnalysis]: Using template '2-phase'. [2019-10-22 09:00:06,836 INFO L120 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 [2019-10-22 09:00:06,836 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:06,836 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:00:06,836 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:06,836 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:06,837 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:06,837 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:00:06,837 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 09:00:06,837 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:06,839 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:06,840 INFO L120 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 [2019-10-22 09:00:06,840 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:06,841 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:00:06,841 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:06,841 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:06,841 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:00:06,841 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:00:06,842 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:06,842 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:06,842 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:06,843 INFO L120 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 [2019-10-22 09:00:06,843 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:06,843 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:00:06,844 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:06,844 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:06,844 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:06,844 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:00:06,845 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 09:00:06,845 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:06,845 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:06,846 INFO L120 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 [2019-10-22 09:00:06,846 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:06,846 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:00:06,846 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:06,847 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:06,847 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:06,847 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:00:06,847 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 09:00:06,848 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:06,850 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:06,850 INFO L120 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 [2019-10-22 09:00:06,851 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:06,851 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:00:06,851 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:06,851 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:06,851 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:00:06,851 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:00:06,852 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:06,853 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:06,857 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:06,858 INFO L120 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 [2019-10-22 09:00:06,858 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:06,858 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:00:06,859 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:06,859 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:06,859 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:00:06,859 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:00:06,860 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:06,861 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:06,869 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:06,869 INFO L120 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 [2019-10-22 09:00:06,870 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:06,870 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:00:06,870 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:06,870 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:06,870 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:06,871 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:00:06,872 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 09:00:06,872 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:06,880 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:06,880 INFO L120 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 [2019-10-22 09:00:06,881 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:06,881 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:00:06,881 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:06,881 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:06,881 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:06,882 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-10-22 09:00:06,882 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-10-22 09:00:06,882 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:06,886 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:06,886 INFO L489 LassoAnalysis]: Using template '3-phase'. [2019-10-22 09:00:06,886 INFO L120 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 [2019-10-22 09:00:06,887 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:06,887 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 09:00:06,887 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:06,887 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:06,887 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:06,888 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:06,888 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:00:06,888 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:06,891 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:06,892 INFO L120 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 [2019-10-22 09:00:06,892 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:06,893 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 09:00:06,893 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:06,893 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:06,893 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:00:06,893 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:06,894 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 09:00:06,894 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:06,895 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:06,896 INFO L120 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 [2019-10-22 09:00:06,896 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:06,896 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 09:00:06,897 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:06,897 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:06,897 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:06,897 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:06,898 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:00:06,898 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:06,899 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:06,899 INFO L120 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 [2019-10-22 09:00:06,900 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:06,900 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 09:00:06,900 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:06,900 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:06,901 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:06,901 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:06,901 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:00:06,901 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:06,905 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:06,905 INFO L120 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 [2019-10-22 09:00:06,905 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:06,905 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 09:00:06,906 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:06,906 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:06,906 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:00:06,906 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:06,907 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 09:00:06,908 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:06,915 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:06,915 INFO L120 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 [2019-10-22 09:00:06,916 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:06,916 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 09:00:06,916 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:06,916 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:06,916 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:00:06,916 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:06,919 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 09:00:06,919 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:06,938 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:06,939 INFO L120 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 [2019-10-22 09:00:06,940 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:06,940 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 09:00:06,940 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:06,940 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:06,940 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:06,940 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:06,942 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:00:06,942 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:06,949 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:06,950 INFO L120 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 [2019-10-22 09:00:06,950 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:06,950 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-10-22 09:00:06,951 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:06,951 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:06,951 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:06,951 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:06,952 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:00:06,952 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:06,957 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:06,957 INFO L489 LassoAnalysis]: Using template '4-phase'. [2019-10-22 09:00:06,958 INFO L120 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 [2019-10-22 09:00:06,958 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:06,958 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:00:06,958 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:06,959 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:06,959 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:06,959 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:00:06,960 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 09:00:06,960 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:06,966 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:06,966 INFO L120 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 [2019-10-22 09:00:06,967 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:06,967 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:00:06,967 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:06,967 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:06,967 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:00:06,968 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:00:06,970 INFO L400 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-10-22 09:00:06,970 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:06,971 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:06,971 INFO L120 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 [2019-10-22 09:00:06,972 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:06,972 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:00:06,972 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:06,972 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:06,972 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:06,972 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:00:06,973 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 09:00:06,973 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:06,975 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:06,975 INFO L120 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 [2019-10-22 09:00:06,975 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:06,976 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:00:06,976 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:06,976 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:06,976 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:06,976 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:00:06,977 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 09:00:06,977 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:06,982 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:06,983 INFO L120 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 [2019-10-22 09:00:06,984 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:06,984 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:00:06,984 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:06,984 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:06,984 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:00:06,984 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:00:06,987 INFO L400 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-10-22 09:00:06,987 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:06,998 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:06,998 INFO L120 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 [2019-10-22 09:00:06,999 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:06,999 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:00:06,999 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:06,999 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:07,000 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:00:07,000 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:00:07,004 INFO L400 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-10-22 09:00:07,004 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:07,027 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:07,027 INFO L120 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 [2019-10-22 09:00:07,028 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:07,028 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:00:07,028 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:07,028 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:07,028 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:07,028 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:00:07,031 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 09:00:07,031 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:07,043 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:07,043 INFO L120 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 [2019-10-22 09:00:07,044 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:07,044 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:00:07,044 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:07,044 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:07,045 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:07,045 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-10-22 09:00:07,047 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-10-22 09:00:07,047 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:07,055 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:07,055 INFO L489 LassoAnalysis]: Using template '2-lex'. [2019-10-22 09:00:07,055 INFO L120 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 [2019-10-22 09:00:07,056 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:07,056 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:00:07,056 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:07,056 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:07,056 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:07,056 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:07,057 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:00:07,057 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:07,059 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:07,059 INFO L120 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 [2019-10-22 09:00:07,060 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:07,060 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:00:07,060 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:07,060 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:07,060 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:00:07,061 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:07,061 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 09:00:07,061 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:07,063 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:07,063 INFO L120 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 [2019-10-22 09:00:07,064 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:07,064 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:00:07,064 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:07,064 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:07,064 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:07,064 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:07,065 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:00:07,065 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:07,066 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:07,067 INFO L120 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 [2019-10-22 09:00:07,067 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:07,067 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:00:07,067 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:07,068 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:07,068 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:07,068 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:07,068 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:00:07,068 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:07,070 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:07,071 INFO L120 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 [2019-10-22 09:00:07,071 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:07,071 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:00:07,072 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:07,072 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:07,072 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:00:07,072 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:07,073 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 09:00:07,073 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:07,079 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:07,080 INFO L120 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 [2019-10-22 09:00:07,080 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:07,080 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:00:07,080 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:07,080 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:07,080 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:00:07,081 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:07,082 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 09:00:07,082 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:07,096 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:07,096 INFO L120 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 [2019-10-22 09:00:07,097 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:07,097 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:00:07,097 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:07,098 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:07,098 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:07,098 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:07,099 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:00:07,099 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:07,109 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:07,109 INFO L120 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 [2019-10-22 09:00:07,110 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:07,110 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-10-22 09:00:07,110 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:07,110 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:07,110 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:07,110 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-10-22 09:00:07,111 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:00:07,111 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:07,115 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:07,115 INFO L489 LassoAnalysis]: Using template '3-lex'. [2019-10-22 09:00:07,116 INFO L120 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 [2019-10-22 09:00:07,116 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:07,116 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:00:07,116 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:07,116 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:07,117 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:07,117 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 09:00:07,117 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:07,117 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:07,121 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:07,121 INFO L120 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 [2019-10-22 09:00:07,121 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:07,122 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:00:07,122 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:07,122 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:07,122 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:00:07,122 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 09:00:07,123 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 09:00:07,123 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:07,125 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:07,125 INFO L120 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 [2019-10-22 09:00:07,126 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:07,126 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:00:07,126 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:07,126 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:07,126 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:07,126 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 09:00:07,127 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:07,127 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:07,129 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:07,130 INFO L120 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 [2019-10-22 09:00:07,130 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:07,130 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:00:07,130 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:07,130 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:07,130 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:07,131 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 09:00:07,131 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:07,131 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:07,134 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:07,135 INFO L120 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 [2019-10-22 09:00:07,135 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:07,135 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:00:07,135 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:07,136 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:07,136 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:00:07,136 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 09:00:07,137 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 09:00:07,137 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:07,157 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:07,158 INFO L120 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 [2019-10-22 09:00:07,158 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:07,158 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:00:07,158 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:07,158 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:07,159 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:00:07,159 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 09:00:07,161 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 09:00:07,161 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:07,201 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:07,201 INFO L120 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 [2019-10-22 09:00:07,202 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:07,202 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:00:07,202 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:07,202 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:07,202 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:07,202 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 09:00:07,204 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:07,205 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:07,238 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:07,238 INFO L120 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 [2019-10-22 09:00:07,239 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-10-22 09:00:07,239 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-10-22 09:00:07,239 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:07,240 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:07,240 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:07,240 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-10-22 09:00:07,241 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:07,241 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:07,252 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:07,252 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:07,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:07,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:07,253 INFO L87 Difference]: Start difference. First operand 305 states and 405 transitions. cyclomatic complexity: 101 Second operand 3 states. [2019-10-22 09:00:07,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:07,828 INFO L93 Difference]: Finished difference Result 590 states and 749 transitions. [2019-10-22 09:00:07,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:07,829 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 590 states and 749 transitions. [2019-10-22 09:00:07,833 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 588 [2019-10-22 09:00:07,837 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 590 states to 590 states and 749 transitions. [2019-10-22 09:00:07,840 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 590 [2019-10-22 09:00:07,841 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 590 [2019-10-22 09:00:07,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 590 states and 749 transitions. [2019-10-22 09:00:07,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:07,846 INFO L688 BuchiCegarLoop]: Abstraction has 590 states and 749 transitions. [2019-10-22 09:00:07,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states and 749 transitions. [2019-10-22 09:00:07,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2019-10-22 09:00:07,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-10-22 09:00:07,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 749 transitions. [2019-10-22 09:00:07,894 INFO L711 BuchiCegarLoop]: Abstraction has 590 states and 749 transitions. [2019-10-22 09:00:07,894 INFO L591 BuchiCegarLoop]: Abstraction has 590 states and 749 transitions. [2019-10-22 09:00:07,894 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 09:00:07,894 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 590 states and 749 transitions. [2019-10-22 09:00:07,898 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 588 [2019-10-22 09:00:07,898 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:07,898 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:07,899 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 09:00:07,900 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1] [2019-10-22 09:00:07,901 INFO L791 eck$LassoCheckResult]: Stem: 1676#ULTIMATE.startENTRY ~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; 1534#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 1535#L606-2 [2019-10-22 09:00:07,901 INFO L793 eck$LassoCheckResult]: Loop: 1535#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 2015#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 2014#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 2013#L35 assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0);~a28~0 := 10;calculate_output_#res := 22; 1531#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 1626#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 1627#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 1662#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 1669#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 1688#L38 assume 1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0;~a28~0 := 7;~a25~0 := 1;calculate_output_#res := 22; 1567#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 1535#L606-2 [2019-10-22 09:00:07,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:07,907 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2019-10-22 09:00:07,907 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:07,907 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947693750] [2019-10-22 09:00:07,908 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:07,908 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:07,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:07,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:07,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:07,919 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:07,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:07,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1689438932, now seen corresponding path program 1 times [2019-10-22 09:00:07,922 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:07,923 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355319009] [2019-10-22 09:00:07,923 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:07,923 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:07,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:07,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:07,944 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:07,944 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355319009] [2019-10-22 09:00:07,945 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:07,945 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:07,945 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920515154] [2019-10-22 09:00:07,945 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:00:07,946 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:07,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:07,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:07,946 INFO L87 Difference]: Start difference. First operand 590 states and 749 transitions. cyclomatic complexity: 160 Second operand 3 states. [2019-10-22 09:00:08,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:08,610 INFO L93 Difference]: Finished difference Result 1149 states and 1416 transitions. [2019-10-22 09:00:08,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:08,610 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1149 states and 1416 transitions. [2019-10-22 09:00:08,617 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1147 [2019-10-22 09:00:08,622 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1149 states to 1149 states and 1416 transitions. [2019-10-22 09:00:08,622 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1149 [2019-10-22 09:00:08,623 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1149 [2019-10-22 09:00:08,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1149 states and 1416 transitions. [2019-10-22 09:00:08,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:08,625 INFO L688 BuchiCegarLoop]: Abstraction has 1149 states and 1416 transitions. [2019-10-22 09:00:08,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states and 1416 transitions. [2019-10-22 09:00:08,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 1149. [2019-10-22 09:00:08,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1149 states. [2019-10-22 09:00:08,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 1416 transitions. [2019-10-22 09:00:08,644 INFO L711 BuchiCegarLoop]: Abstraction has 1149 states and 1416 transitions. [2019-10-22 09:00:08,644 INFO L591 BuchiCegarLoop]: Abstraction has 1149 states and 1416 transitions. [2019-10-22 09:00:08,644 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 09:00:08,644 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1149 states and 1416 transitions. [2019-10-22 09:00:08,649 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1147 [2019-10-22 09:00:08,650 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:08,650 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:08,651 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 09:00:08,651 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 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] [2019-10-22 09:00:08,652 INFO L791 eck$LassoCheckResult]: Stem: 3407#ULTIMATE.startENTRY ~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; 3278#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 3279#L606-2 [2019-10-22 09:00:08,652 INFO L793 eck$LassoCheckResult]: Loop: 3279#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 3366#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 3399#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 3402#L35 assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0);~a28~0 := 10;calculate_output_#res := 22; 3275#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3645#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 3642#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 3639#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 3636#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 3633#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 3630#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 3627#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 3624#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 3621#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 3618#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 3615#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 3612#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 3609#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 3606#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 3602#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 3599#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 3596#L99 assume (!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0;~a17~0 := 7;~a25~0 := 0;~a11~0 := 1;~a28~0 := 10;~a19~0 := 0;calculate_output_#res := -1; 3560#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3644#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 3641#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 3638#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 3635#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 3632#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 3629#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 3626#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 3623#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 3620#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 3617#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 3614#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 3611#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 3608#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 3604#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 3601#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 3598#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 3595#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 3592#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 3589#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 3586#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 3583#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 3580#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 3577#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 3573#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 3570#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 3567#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 3564#L154 assume 1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0;~a25~0 := 1;~a19~0 := 1;~a28~0 := 7;calculate_output_#res := -1; 3421#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3279#L606-2 [2019-10-22 09:00:08,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:08,653 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2019-10-22 09:00:08,653 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:08,653 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194077281] [2019-10-22 09:00:08,653 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:08,653 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:08,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:08,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:08,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:08,659 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:08,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:08,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1352924138, now seen corresponding path program 1 times [2019-10-22 09:00:08,660 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:08,660 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653060332] [2019-10-22 09:00:08,660 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:08,660 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:08,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:08,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:08,694 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 09:00:08,697 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653060332] [2019-10-22 09:00:08,698 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:08,698 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:08,698 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423001028] [2019-10-22 09:00:08,698 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:00:08,699 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:08,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:08,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:08,700 INFO L87 Difference]: Start difference. First operand 1149 states and 1416 transitions. cyclomatic complexity: 268 Second operand 3 states. [2019-10-22 09:00:09,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:09,261 INFO L93 Difference]: Finished difference Result 1996 states and 2450 transitions. [2019-10-22 09:00:09,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:09,261 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1996 states and 2450 transitions. [2019-10-22 09:00:09,276 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1994 [2019-10-22 09:00:09,288 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1996 states to 1996 states and 2450 transitions. [2019-10-22 09:00:09,288 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1996 [2019-10-22 09:00:09,290 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1996 [2019-10-22 09:00:09,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1996 states and 2450 transitions. [2019-10-22 09:00:09,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:09,294 INFO L688 BuchiCegarLoop]: Abstraction has 1996 states and 2450 transitions. [2019-10-22 09:00:09,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1996 states and 2450 transitions. [2019-10-22 09:00:09,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1996 to 1710. [2019-10-22 09:00:09,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1710 states. [2019-10-22 09:00:09,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1710 states to 1710 states and 2146 transitions. [2019-10-22 09:00:09,332 INFO L711 BuchiCegarLoop]: Abstraction has 1710 states and 2146 transitions. [2019-10-22 09:00:09,332 INFO L591 BuchiCegarLoop]: Abstraction has 1710 states and 2146 transitions. [2019-10-22 09:00:09,332 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 09:00:09,332 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1710 states and 2146 transitions. [2019-10-22 09:00:09,344 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1708 [2019-10-22 09:00:09,344 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:09,344 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:09,346 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 09:00:09,346 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:09,347 INFO L791 eck$LassoCheckResult]: Stem: 6571#ULTIMATE.startENTRY ~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; 6429#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 6430#L606-2 [2019-10-22 09:00:09,347 INFO L793 eck$LassoCheckResult]: Loop: 6430#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6521#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 6563#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 6566#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 6582#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 6513#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 6514#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 6506#L50 assume 1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0;~a28~0 := 11;~a25~0 := 1;calculate_output_#res := 26; 6443#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6994#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6992#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 6990#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 6988#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 6986#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 6984#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 6982#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 6980#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 6978#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 6976#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 6974#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 6972#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 6970#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 6968#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 6966#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 6964#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 6962#L99 assume (!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0;~a17~0 := 7;~a25~0 := 0;~a11~0 := 1;~a28~0 := 10;~a19~0 := 0;calculate_output_#res := -1; 6879#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 7193#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 7188#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 7183#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 7178#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 7173#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 7168#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 7164#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 7160#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 7155#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 7150#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 7145#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 7140#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 7135#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 7129#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 7124#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 7118#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 7112#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 7106#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 7100#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 6937#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 6806#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 6801#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 6795#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 6789#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 6783#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 6776#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 6775#L154 assume 1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0;~a25~0 := 1;~a19~0 := 1;~a28~0 := 7;calculate_output_#res := -1; 6587#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6430#L606-2 [2019-10-22 09:00:09,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:09,347 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2019-10-22 09:00:09,348 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:09,348 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729900971] [2019-10-22 09:00:09,348 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:09,348 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:09,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:09,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:09,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:09,354 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:09,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:09,354 INFO L82 PathProgramCache]: Analyzing trace with hash -879392628, now seen corresponding path program 1 times [2019-10-22 09:00:09,355 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:09,355 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588312845] [2019-10-22 09:00:09,355 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:09,355 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:09,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:09,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:09,389 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-22 09:00:09,389 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588312845] [2019-10-22 09:00:09,390 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:09,390 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:09,390 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130257989] [2019-10-22 09:00:09,390 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:00:09,391 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:09,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:09,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:09,391 INFO L87 Difference]: Start difference. First operand 1710 states and 2146 transitions. cyclomatic complexity: 437 Second operand 3 states. [2019-10-22 09:00:09,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:09,936 INFO L93 Difference]: Finished difference Result 1709 states and 1964 transitions. [2019-10-22 09:00:09,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:09,937 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1709 states and 1964 transitions. [2019-10-22 09:00:09,949 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1707 [2019-10-22 09:00:09,958 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1709 states to 1709 states and 1964 transitions. [2019-10-22 09:00:09,959 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1709 [2019-10-22 09:00:09,961 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1709 [2019-10-22 09:00:09,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1709 states and 1964 transitions. [2019-10-22 09:00:09,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:09,963 INFO L688 BuchiCegarLoop]: Abstraction has 1709 states and 1964 transitions. [2019-10-22 09:00:09,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1709 states and 1964 transitions. [2019-10-22 09:00:09,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1709 to 1429. [2019-10-22 09:00:09,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1429 states. [2019-10-22 09:00:09,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1429 states to 1429 states and 1654 transitions. [2019-10-22 09:00:09,984 INFO L711 BuchiCegarLoop]: Abstraction has 1429 states and 1654 transitions. [2019-10-22 09:00:09,984 INFO L591 BuchiCegarLoop]: Abstraction has 1429 states and 1654 transitions. [2019-10-22 09:00:09,984 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 09:00:09,984 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1429 states and 1654 transitions. [2019-10-22 09:00:09,992 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1427 [2019-10-22 09:00:09,992 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:09,992 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:09,993 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 09:00:09,994 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 3, 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] [2019-10-22 09:00:09,994 INFO L791 eck$LassoCheckResult]: Stem: 9998#ULTIMATE.startENTRY ~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; 9854#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 9855#L606-2 [2019-10-22 09:00:09,994 INFO L793 eck$LassoCheckResult]: Loop: 9855#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 10437#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 10431#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 10415#L35 assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0);~a28~0 := 10;calculate_output_#res := 22; 9851#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 10406#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 10404#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 10402#L30 assume ((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 9925#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 11190#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 9985#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 9986#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 11076#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 11077#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 9940#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 9941#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 9934#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 9857#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 9858#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 9859#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 9860#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 9960#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 10012#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 9961#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 9879#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 9880#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 10001#L106 assume (1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0;~a17~0 := 8;~a25~0 := 0;~a19~0 := 0;~a28~0 := 11;~a11~0 := 0;calculate_output_#res := 23; 9932#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 10320#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 10318#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 10316#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 10314#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 10261#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 10257#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 10252#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 10247#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 10242#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 10237#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 10232#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 10227#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 10222#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 10215#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 10212#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 10209#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 10206#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 10203#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 10200#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 10196#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 10192#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 10188#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 10184#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 10180#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 10176#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 10172#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 10168#L154 assume 1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0;~a25~0 := 1;~a19~0 := 1;~a28~0 := 7;calculate_output_#res := -1; 10134#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 9855#L606-2 [2019-10-22 09:00:09,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:09,995 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2019-10-22 09:00:09,995 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:09,995 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513996648] [2019-10-22 09:00:09,995 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:09,995 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:09,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:09,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:09,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:10,001 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:10,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:10,001 INFO L82 PathProgramCache]: Analyzing trace with hash 274284660, now seen corresponding path program 1 times [2019-10-22 09:00:10,002 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:10,002 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803352406] [2019-10-22 09:00:10,002 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:10,002 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:10,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:10,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:10,027 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-22 09:00:10,027 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803352406] [2019-10-22 09:00:10,027 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:10,027 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:10,027 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172025963] [2019-10-22 09:00:10,028 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:00:10,028 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:10,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:10,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:10,028 INFO L87 Difference]: Start difference. First operand 1429 states and 1654 transitions. cyclomatic complexity: 226 Second operand 3 states. [2019-10-22 09:00:10,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:10,530 INFO L93 Difference]: Finished difference Result 1851 states and 2102 transitions. [2019-10-22 09:00:10,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:10,530 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1851 states and 2102 transitions. [2019-10-22 09:00:10,542 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1846 [2019-10-22 09:00:10,551 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1851 states to 1851 states and 2102 transitions. [2019-10-22 09:00:10,551 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1851 [2019-10-22 09:00:10,553 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1851 [2019-10-22 09:00:10,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1851 states and 2102 transitions. [2019-10-22 09:00:10,556 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:10,557 INFO L688 BuchiCegarLoop]: Abstraction has 1851 states and 2102 transitions. [2019-10-22 09:00:10,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1851 states and 2102 transitions. [2019-10-22 09:00:10,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1851 to 1849. [2019-10-22 09:00:10,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1849 states. [2019-10-22 09:00:10,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1849 states to 1849 states and 2099 transitions. [2019-10-22 09:00:10,585 INFO L711 BuchiCegarLoop]: Abstraction has 1849 states and 2099 transitions. [2019-10-22 09:00:10,585 INFO L591 BuchiCegarLoop]: Abstraction has 1849 states and 2099 transitions. [2019-10-22 09:00:10,585 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-10-22 09:00:10,585 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1849 states and 2099 transitions. [2019-10-22 09:00:10,594 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1844 [2019-10-22 09:00:10,595 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:10,595 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:10,596 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 09:00:10,597 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [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] [2019-10-22 09:00:10,597 INFO L791 eck$LassoCheckResult]: Stem: 13279#ULTIMATE.startENTRY ~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; 13140#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 13141#L606-2 [2019-10-22 09:00:10,597 INFO L793 eck$LassoCheckResult]: Loop: 13141#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 14669#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 14667#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 14665#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 14663#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 14661#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 14659#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 14614#L50 assume 1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0;~a28~0 := 11;~a25~0 := 1;calculate_output_#res := 26; 13154#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 13488#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 13486#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 13484#L30 assume ((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 13337#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 14108#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 14106#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 14104#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 14102#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 14099#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 14100#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 14136#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 14134#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 14132#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 13511#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 13512#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 14445#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 14443#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 14020#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 14019#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 14017#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 14015#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 14013#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 14011#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 14009#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 14007#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 14005#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 14003#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 14001#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 13999#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13997#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 13995#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 13993#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 13991#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 13989#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 13987#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 13985#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 13977#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 13973#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 13969#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 13965#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 13961#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 13957#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 13953#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 13949#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 13945#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 13941#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 13937#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 13933#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 13929#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 13764#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 13765#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 13664#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 13665#L253 assume (9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 13394#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 13141#L606-2 [2019-10-22 09:00:10,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:10,598 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2019-10-22 09:00:10,598 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:10,598 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702150823] [2019-10-22 09:00:10,598 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:10,598 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:10,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:10,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:10,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:10,607 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:10,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:10,607 INFO L82 PathProgramCache]: Analyzing trace with hash -917902191, now seen corresponding path program 1 times [2019-10-22 09:00:10,609 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:10,609 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310304147] [2019-10-22 09:00:10,609 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:10,609 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:10,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:10,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:10,642 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 09:00:10,643 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310304147] [2019-10-22 09:00:10,643 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:10,643 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:10,643 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194577848] [2019-10-22 09:00:10,644 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:00:10,644 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:10,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:10,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:10,644 INFO L87 Difference]: Start difference. First operand 1849 states and 2099 transitions. cyclomatic complexity: 252 Second operand 3 states. [2019-10-22 09:00:11,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:11,171 INFO L93 Difference]: Finished difference Result 1989 states and 2244 transitions. [2019-10-22 09:00:11,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:11,172 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1989 states and 2244 transitions. [2019-10-22 09:00:11,184 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1984 [2019-10-22 09:00:11,193 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1989 states to 1989 states and 2244 transitions. [2019-10-22 09:00:11,193 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1989 [2019-10-22 09:00:11,196 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1989 [2019-10-22 09:00:11,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1989 states and 2244 transitions. [2019-10-22 09:00:11,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:11,198 INFO L688 BuchiCegarLoop]: Abstraction has 1989 states and 2244 transitions. [2019-10-22 09:00:11,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1989 states and 2244 transitions. [2019-10-22 09:00:11,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1989 to 1989. [2019-10-22 09:00:11,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1989 states. [2019-10-22 09:00:11,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1989 states to 1989 states and 2244 transitions. [2019-10-22 09:00:11,238 INFO L711 BuchiCegarLoop]: Abstraction has 1989 states and 2244 transitions. [2019-10-22 09:00:11,238 INFO L591 BuchiCegarLoop]: Abstraction has 1989 states and 2244 transitions. [2019-10-22 09:00:11,238 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-10-22 09:00:11,238 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1989 states and 2244 transitions. [2019-10-22 09:00:11,249 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1984 [2019-10-22 09:00:11,249 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:11,249 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:11,285 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 09:00:11,285 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:11,285 INFO L791 eck$LassoCheckResult]: Stem: 17120#ULTIMATE.startENTRY ~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; 16984#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 16985#L606-2 [2019-10-22 09:00:11,285 INFO L793 eck$LassoCheckResult]: Loop: 16985#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 17073#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 17110#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 17114#L35 assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0);~a28~0 := 10;calculate_output_#res := 22; 16983#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 18289#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 18287#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 18285#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 18283#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 18281#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 18279#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 18277#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 18275#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 18273#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 18271#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 18269#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 18267#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 18265#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 18263#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 18261#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 18259#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 18257#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 18255#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 18253#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 18251#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 18249#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 18247#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 18245#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 18243#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 18241#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 18239#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 18237#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 18235#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 18233#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 18220#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 18221#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 18497#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 18493#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 18488#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 18482#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 17321#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 17322#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 18494#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 18489#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 18483#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 17323#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 17324#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 18333#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 18331#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 18329#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 18327#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 18325#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 18323#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 18321#L253 assume !((9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0); 18319#L259 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && (((9 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)); 18317#L261 assume !(9 == ~a17~0 && 1 == ~a21~0 && 1 == ~a11~0 && (3 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && 1 == ~a19~0); 18315#L276 assume !(7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 1 == ~a21~0 && 1 == ~a19~0 && 5 == calculate_output_~input && !(1 == ~a11~0)); 18313#L280 assume !(8 == ~a28~0 && 1 == ~a21~0 && (!(1 == ~a11~0) && (1 == calculate_output_~input && 8 == ~a17~0) && 1 == ~a19~0) && 1 == ~a25~0); 18292#L283 assume !((((8 == ~a17~0 && (6 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a21~0) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 18293#L286 assume !((!(1 == ~a11~0) && (!(1 == ~a19~0) && ((!(1 == ~a25~0) && 11 == ~a28~0) || (10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 18463#L291 assume !(8 == ~a17~0 && (1 == ~a21~0 && !(1 == ~a11~0) && 1 == ~a25~0 && 8 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a19~0); 18462#L293 assume (1 == ~a19~0 && 8 == ~a17~0 && ((!(1 == ~a25~0) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a11~0)) && 11 == ~a28~0;~a28~0 := 7;~a25~0 := 1;calculate_output_#res := -1; 17133#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 16985#L606-2 [2019-10-22 09:00:11,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:11,286 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2019-10-22 09:00:11,286 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:11,286 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820345042] [2019-10-22 09:00:11,286 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:11,286 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:11,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:11,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:11,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:11,292 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:11,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:11,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1740840234, now seen corresponding path program 1 times [2019-10-22 09:00:11,293 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:11,293 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231237643] [2019-10-22 09:00:11,293 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:11,294 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:11,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:11,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:11,352 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:11,352 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231237643] [2019-10-22 09:00:11,352 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:11,353 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:00:11,353 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990166193] [2019-10-22 09:00:11,353 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:00:11,353 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:11,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:00:11,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:00:11,354 INFO L87 Difference]: Start difference. First operand 1989 states and 2244 transitions. cyclomatic complexity: 257 Second operand 4 states. [2019-10-22 09:00:12,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:12,194 INFO L93 Difference]: Finished difference Result 2552 states and 2753 transitions. [2019-10-22 09:00:12,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:00:12,194 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2552 states and 2753 transitions. [2019-10-22 09:00:12,210 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 2546 [2019-10-22 09:00:12,220 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2552 states to 2552 states and 2753 transitions. [2019-10-22 09:00:12,220 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2552 [2019-10-22 09:00:12,223 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2552 [2019-10-22 09:00:12,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2552 states and 2753 transitions. [2019-10-22 09:00:12,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:12,226 INFO L688 BuchiCegarLoop]: Abstraction has 2552 states and 2753 transitions. [2019-10-22 09:00:12,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2552 states and 2753 transitions. [2019-10-22 09:00:12,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2552 to 2130. [2019-10-22 09:00:12,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2130 states. [2019-10-22 09:00:12,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2130 states to 2130 states and 2325 transitions. [2019-10-22 09:00:12,261 INFO L711 BuchiCegarLoop]: Abstraction has 2130 states and 2325 transitions. [2019-10-22 09:00:12,261 INFO L591 BuchiCegarLoop]: Abstraction has 2130 states and 2325 transitions. [2019-10-22 09:00:12,261 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-10-22 09:00:12,261 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2130 states and 2325 transitions. [2019-10-22 09:00:12,270 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 2124 [2019-10-22 09:00:12,270 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:12,270 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:12,272 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 09:00:12,274 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 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, 1] [2019-10-22 09:00:12,274 INFO L791 eck$LassoCheckResult]: Stem: 21661#ULTIMATE.startENTRY ~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; 21532#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 21533#L606-2 [2019-10-22 09:00:12,274 INFO L793 eck$LassoCheckResult]: Loop: 21533#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 23339#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 23336#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 23333#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 23330#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 23327#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 23324#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 22297#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 22298#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 23465#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 23463#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 23461#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 23459#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 23457#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 23455#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 23453#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 23451#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 23449#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 23447#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 23445#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 23443#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 23441#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 23438#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 23435#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 23432#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 23429#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 23427#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 23425#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 23423#L165 assume (1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0);~a25~0 := 1;~a28~0 := 9;calculate_output_#res := 26; 21546#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 21839#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 21837#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 21834#L30 assume ((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 21835#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 22351#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 22349#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 22347#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 22345#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 22343#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 22341#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 22339#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 22337#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 22335#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 22333#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 22331#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 22329#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 22327#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 22325#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 22323#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 22321#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 22319#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 22317#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 22315#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 22313#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 22311#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 22309#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 22307#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 22134#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 22135#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 22949#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 22944#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 22361#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 22362#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 22922#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 22916#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 22910#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 22904#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 22898#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 22892#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 22886#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 22576#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 22577#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 22583#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 22566#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 22561#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 22359#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 22360#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 22663#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 22661#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 22659#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 22657#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 22655#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 22653#L253 assume (9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 22024#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 21533#L606-2 [2019-10-22 09:00:12,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:12,275 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2019-10-22 09:00:12,275 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:12,275 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868533663] [2019-10-22 09:00:12,275 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:12,275 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:12,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:12,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:12,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:12,289 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:12,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:12,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1701192337, now seen corresponding path program 1 times [2019-10-22 09:00:12,290 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:12,291 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115124228] [2019-10-22 09:00:12,291 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:12,291 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:12,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:12,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:12,353 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-22 09:00:12,353 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115124228] [2019-10-22 09:00:12,353 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:12,353 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:12,353 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050060823] [2019-10-22 09:00:12,354 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:00:12,354 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:12,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:12,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:12,354 INFO L87 Difference]: Start difference. First operand 2130 states and 2325 transitions. cyclomatic complexity: 198 Second operand 3 states. [2019-10-22 09:00:12,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:12,631 INFO L93 Difference]: Finished difference Result 1838 states and 1967 transitions. [2019-10-22 09:00:12,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:12,632 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1838 states and 1967 transitions. [2019-10-22 09:00:12,641 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 1833 [2019-10-22 09:00:12,648 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1838 states to 1838 states and 1967 transitions. [2019-10-22 09:00:12,649 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1838 [2019-10-22 09:00:12,651 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1838 [2019-10-22 09:00:12,651 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1838 states and 1967 transitions. [2019-10-22 09:00:12,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:12,653 INFO L688 BuchiCegarLoop]: Abstraction has 1838 states and 1967 transitions. [2019-10-22 09:00:12,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states and 1967 transitions. [2019-10-22 09:00:12,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1278. [2019-10-22 09:00:12,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1278 states. [2019-10-22 09:00:12,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1278 states to 1278 states and 1407 transitions. [2019-10-22 09:00:12,673 INFO L711 BuchiCegarLoop]: Abstraction has 1278 states and 1407 transitions. [2019-10-22 09:00:12,674 INFO L591 BuchiCegarLoop]: Abstraction has 1278 states and 1407 transitions. [2019-10-22 09:00:12,674 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-10-22 09:00:12,674 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1278 states and 1407 transitions. [2019-10-22 09:00:12,678 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1273 [2019-10-22 09:00:12,679 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:12,679 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:12,680 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 09:00:12,681 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-22 09:00:12,681 INFO L791 eck$LassoCheckResult]: Stem: 25622#ULTIMATE.startENTRY ~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; 25503#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 25504#L606-2 [2019-10-22 09:00:12,681 INFO L793 eck$LassoCheckResult]: Loop: 25504#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 26311#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 26309#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 26307#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 26305#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 26303#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 26301#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 26299#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 26297#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 26295#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 26293#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 26289#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 26290#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 26284#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 26280#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 26281#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 26272#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 26273#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 26264#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 26265#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 26256#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 26257#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 26248#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 26249#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 26236#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 26237#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 26224#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 26225#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 25818#L165 assume (1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0);~a25~0 := 1;~a28~0 := 9;calculate_output_#res := 26; 25635#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 25813#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 25810#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 25807#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 25803#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 25799#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 25795#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 25791#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 25785#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 25780#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 25774#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 25768#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 25763#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 25758#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 25753#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 25748#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 25743#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 25738#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 25732#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 25727#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 25722#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 25717#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 25712#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 25707#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 25702#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 25697#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 25693#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 25688#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 25684#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 25680#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 25676#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 25671#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 25672#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 25821#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 25822#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 25914#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 25909#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 25904#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 25899#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 25894#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 25890#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 25886#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 25882#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 25878#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 25874#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 25870#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 25866#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 25862#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 25858#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 25854#L253 assume !((9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0); 25850#L259 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && (((9 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)); 25846#L261 assume !(9 == ~a17~0 && 1 == ~a21~0 && 1 == ~a11~0 && (3 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && 1 == ~a19~0); 25842#L276 assume !(7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 1 == ~a21~0 && 1 == ~a19~0 && 5 == calculate_output_~input && !(1 == ~a11~0)); 25838#L280 assume !(8 == ~a28~0 && 1 == ~a21~0 && (!(1 == ~a11~0) && (1 == calculate_output_~input && 8 == ~a17~0) && 1 == ~a19~0) && 1 == ~a25~0); 25834#L283 assume !((((8 == ~a17~0 && (6 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a21~0) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 25830#L286 assume !((!(1 == ~a11~0) && (!(1 == ~a19~0) && ((!(1 == ~a25~0) && 11 == ~a28~0) || (10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 25825#L291 assume !(8 == ~a17~0 && (1 == ~a21~0 && !(1 == ~a11~0) && 1 == ~a25~0 && 8 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a19~0); 25826#L293 assume !((1 == ~a19~0 && 8 == ~a17~0 && ((!(1 == ~a25~0) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a11~0)) && 11 == ~a28~0); 26132#L297 assume !(1 == ~a11~0 && (9 == ~a17~0 && 9 == ~a28~0 && 1 == ~a19~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 1 == ~a21~0); 26129#L309 assume !((((((3 == calculate_output_~input && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)) && 11 == ~a28~0) && !(1 == ~a11~0)); 26126#L314 assume !(1 == ~a19~0 && 1 == ~a21~0 && ((5 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && 1 == ~a11~0) && 9 == ~a17~0); 26123#L328 assume !((1 == ~a19~0 && ((!(1 == ~a11~0) && (1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 10 == ~a28~0) && 1 == ~a21~0) && 8 == ~a17~0); 26120#L331 assume !((!(1 == ~a11~0) && (((4 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0) && 11 == ~a28~0) && 1 == ~a19~0); 26117#L337 assume !(((!(1 == ~a19~0) && (4 == calculate_output_~input && (((!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 26114#L349 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && ((1 == ~a25~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 11 == ~a28~0) && 1 == ~a21~0); 26111#L354 assume !((((1 == ~a21~0 && ((8 == ~a28~0 && !(1 == ~a25~0)) || (9 == ~a28~0 && 1 == ~a25~0)) && 6 == calculate_output_~input) && !(1 == ~a11~0)) && !(1 == ~a19~0)) && 8 == ~a17~0); 26108#L361 assume !(1 == ~a19~0 && ((1 == ~a21~0 && (!(1 == ~a25~0) && 3 == calculate_output_~input) && 9 == ~a17~0) && 8 == ~a28~0) && 1 == ~a11~0); 26105#L368 assume !(8 == ~a17~0 && (1 == ~a21~0 && (5 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (9 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a19~0) && !(1 == ~a11~0)); 26102#L375 assume !(1 == ~a19~0 && (((8 == ~a17~0 && 5 == calculate_output_~input && !(1 == ~a11~0)) && 1 == ~a21~0) && 1 == ~a25~0) && 8 == ~a28~0); 26099#L378 assume !(((!(1 == ~a11~0) && ((1 == ~a21~0 && 4 == calculate_output_~input) && 10 == ~a28~0) && 8 == ~a17~0) && !(1 == ~a19~0)) && 1 == ~a25~0); 26096#L380 assume !(8 == ~a28~0 && (1 == ~a19~0 && 1 == ~a11~0 && !(1 == ~a25~0) && 9 == ~a17~0 && 6 == calculate_output_~input) && 1 == ~a21~0); 26093#L389 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 6 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a19~0)); 26090#L394 assume ((((!(1 == ~a25~0) && 1 == ~a19~0 && 3 == calculate_output_~input) && 9 == ~a28~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0);~a19~0 := 0;~a28~0 := 7;calculate_output_#res := 25; 25566#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 26313#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 26312#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 26310#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 26308#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 26306#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 26304#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 26302#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 26300#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 26298#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 26296#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 26294#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 26292#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 26287#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 26288#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 26291#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 26276#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 26277#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 26268#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 26269#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 26260#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 26261#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 26252#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 26253#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 26242#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 26243#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 26230#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 26231#L154 assume 1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0;~a25~0 := 1;~a19~0 := 1;~a28~0 := 7;calculate_output_#res := -1; 25772#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 25504#L606-2 [2019-10-22 09:00:12,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:12,682 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2019-10-22 09:00:12,682 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:12,682 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86480341] [2019-10-22 09:00:12,682 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:12,682 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:12,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:12,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:12,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:12,687 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:12,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:12,688 INFO L82 PathProgramCache]: Analyzing trace with hash -645173945, now seen corresponding path program 1 times [2019-10-22 09:00:12,688 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:12,688 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823962543] [2019-10-22 09:00:12,688 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:12,689 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:12,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:12,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:12,755 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 09:00:12,755 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823962543] [2019-10-22 09:00:12,756 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:12,756 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:12,756 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282421283] [2019-10-22 09:00:12,756 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:00:12,756 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:12,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:12,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:12,757 INFO L87 Difference]: Start difference. First operand 1278 states and 1407 transitions. cyclomatic complexity: 133 Second operand 3 states. [2019-10-22 09:00:13,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:13,157 INFO L93 Difference]: Finished difference Result 1841 states and 1970 transitions. [2019-10-22 09:00:13,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:13,158 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1841 states and 1970 transitions. [2019-10-22 09:00:13,166 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 1835 [2019-10-22 09:00:13,172 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1841 states to 1841 states and 1970 transitions. [2019-10-22 09:00:13,173 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1841 [2019-10-22 09:00:13,174 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1841 [2019-10-22 09:00:13,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1841 states and 1970 transitions. [2019-10-22 09:00:13,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:13,176 INFO L688 BuchiCegarLoop]: Abstraction has 1841 states and 1970 transitions. [2019-10-22 09:00:13,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1841 states and 1970 transitions. [2019-10-22 09:00:13,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1841 to 1418. [2019-10-22 09:00:13,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1418 states. [2019-10-22 09:00:13,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1418 states to 1418 states and 1541 transitions. [2019-10-22 09:00:13,196 INFO L711 BuchiCegarLoop]: Abstraction has 1418 states and 1541 transitions. [2019-10-22 09:00:13,196 INFO L591 BuchiCegarLoop]: Abstraction has 1418 states and 1541 transitions. [2019-10-22 09:00:13,196 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-10-22 09:00:13,197 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1418 states and 1541 transitions. [2019-10-22 09:00:13,201 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 1412 [2019-10-22 09:00:13,202 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:13,202 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:13,202 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 09:00:13,202 INFO L850 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] [2019-10-22 09:00:13,203 INFO L791 eck$LassoCheckResult]: Stem: 28746#ULTIMATE.startENTRY ~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; 28628#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 28629#L606-2 [2019-10-22 09:00:13,203 INFO L793 eck$LassoCheckResult]: Loop: 28629#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 29450#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 29447#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 29444#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 29441#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 29438#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 29435#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 29432#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 29429#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 29426#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 29423#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 29415#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 29416#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 29407#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 29408#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 29399#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 29400#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 29391#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 29392#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 29383#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 29384#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 29375#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 29376#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 29367#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 29368#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 29355#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 29356#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 29343#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 29344#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 29413#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 29414#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 29405#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 29406#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 29397#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 29398#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 29389#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 29390#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 29381#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 29382#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 29373#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 29374#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 29363#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 29364#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 29351#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 29352#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 29245#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 29246#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 29359#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 29360#L253 assume !((9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0); 29347#L259 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && (((9 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)); 29348#L261 assume !(9 == ~a17~0 && 1 == ~a21~0 && 1 == ~a11~0 && (3 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && 1 == ~a19~0); 28916#L276 assume !(7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 1 == ~a21~0 && 1 == ~a19~0 && 5 == calculate_output_~input && !(1 == ~a11~0)); 28917#L280 assume !(8 == ~a28~0 && 1 == ~a21~0 && (!(1 == ~a11~0) && (1 == calculate_output_~input && 8 == ~a17~0) && 1 == ~a19~0) && 1 == ~a25~0); 29711#L283 assume !((((8 == ~a17~0 && (6 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a21~0) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 29708#L286 assume !((!(1 == ~a11~0) && (!(1 == ~a19~0) && ((!(1 == ~a25~0) && 11 == ~a28~0) || (10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 29705#L291 assume !(8 == ~a17~0 && (1 == ~a21~0 && !(1 == ~a11~0) && 1 == ~a25~0 && 8 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a19~0); 29702#L293 assume !((1 == ~a19~0 && 8 == ~a17~0 && ((!(1 == ~a25~0) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a11~0)) && 11 == ~a28~0); 29699#L297 assume !(1 == ~a11~0 && (9 == ~a17~0 && 9 == ~a28~0 && 1 == ~a19~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 1 == ~a21~0); 29696#L309 assume !((((((3 == calculate_output_~input && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)) && 11 == ~a28~0) && !(1 == ~a11~0)); 29693#L314 assume !(1 == ~a19~0 && 1 == ~a21~0 && ((5 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && 1 == ~a11~0) && 9 == ~a17~0); 29690#L328 assume !((1 == ~a19~0 && ((!(1 == ~a11~0) && (1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 10 == ~a28~0) && 1 == ~a21~0) && 8 == ~a17~0); 29687#L331 assume !((!(1 == ~a11~0) && (((4 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0) && 11 == ~a28~0) && 1 == ~a19~0); 29684#L337 assume !(((!(1 == ~a19~0) && (4 == calculate_output_~input && (((!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 29681#L349 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && ((1 == ~a25~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 11 == ~a28~0) && 1 == ~a21~0); 29678#L354 assume !((((1 == ~a21~0 && ((8 == ~a28~0 && !(1 == ~a25~0)) || (9 == ~a28~0 && 1 == ~a25~0)) && 6 == calculate_output_~input) && !(1 == ~a11~0)) && !(1 == ~a19~0)) && 8 == ~a17~0); 29675#L361 assume !(1 == ~a19~0 && ((1 == ~a21~0 && (!(1 == ~a25~0) && 3 == calculate_output_~input) && 9 == ~a17~0) && 8 == ~a28~0) && 1 == ~a11~0); 29672#L368 assume !(8 == ~a17~0 && (1 == ~a21~0 && (5 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (9 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a19~0) && !(1 == ~a11~0)); 29669#L375 assume !(1 == ~a19~0 && (((8 == ~a17~0 && 5 == calculate_output_~input && !(1 == ~a11~0)) && 1 == ~a21~0) && 1 == ~a25~0) && 8 == ~a28~0); 29666#L378 assume !(((!(1 == ~a11~0) && ((1 == ~a21~0 && 4 == calculate_output_~input) && 10 == ~a28~0) && 8 == ~a17~0) && !(1 == ~a19~0)) && 1 == ~a25~0); 29663#L380 assume !(8 == ~a28~0 && (1 == ~a19~0 && 1 == ~a11~0 && !(1 == ~a25~0) && 9 == ~a17~0 && 6 == calculate_output_~input) && 1 == ~a21~0); 29660#L389 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 6 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a19~0)); 29657#L394 assume !(((((!(1 == ~a25~0) && 1 == ~a19~0 && 3 == calculate_output_~input) && 9 == ~a28~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 29654#L398 assume !((8 == ~a17~0 && ((4 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)); 29651#L402 assume !(((!(1 == ~a11~0) && ((1 == ~a19~0 && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)); 29648#L404 assume !((1 == ~a11~0 && 1 == ~a19~0 && 1 == ~a21~0 && (9 == ~a17~0 && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 8 == ~a28~0); 29645#L407 assume !(!(1 == ~a11~0) && 1 == ~a21~0 && (1 == ~a19~0 && 8 == ~a17~0 && 1 == ~a25~0 && 5 == calculate_output_~input) && 11 == ~a28~0); 29642#L409 assume !(1 == ~a19~0 && 8 == ~a17~0 && ((((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input) && !(1 == ~a11~0)) && 1 == ~a21~0); 29639#L414 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 29636#L414-2 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 29633#L417-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 29630#L420-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 29627#L423-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 29624#L426-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 29621#L429-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 29618#L432-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 29615#L435-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 29612#L438-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 29609#L441-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 29606#L444-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 29603#L447-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 29600#L450-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 29597#L453-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 29594#L456-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 29591#L459-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 29588#L462-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 29585#L465-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 29582#L468-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 29579#L471-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 29576#L474-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 29573#L477-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 29570#L480-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 29567#L483-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 29564#L486-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 29561#L489-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 29558#L492-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 29555#L495-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 29552#L498-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 29549#L501-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 29546#L504-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 29543#L507-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 29540#L510-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 29537#L513-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 29534#L516-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 29531#L519-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 29528#L522-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 29525#L525-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 29522#L528-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 29519#L531-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 29516#L534-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 29513#L537-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 29510#L540-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 29507#L543-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 29504#L546-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 29501#L549-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 29498#L552-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 29495#L555-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 29492#L558-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 29489#L561-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 29486#L564-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 29483#L567-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 29480#L570-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 29477#L573-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 29474#L576-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 29471#L579-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 29468#L582-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 29465#L585-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 29462#L588-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 29459#L591-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 29456#L594-1 calculate_output_#res := -2; 29454#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 28629#L606-2 [2019-10-22 09:00:13,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:13,204 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2019-10-22 09:00:13,205 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:13,205 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824814256] [2019-10-22 09:00:13,205 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:13,206 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:13,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:13,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:13,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:13,209 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:13,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:13,210 INFO L82 PathProgramCache]: Analyzing trace with hash 2053340219, now seen corresponding path program 1 times [2019-10-22 09:00:13,210 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:13,210 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324963678] [2019-10-22 09:00:13,210 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:13,210 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:13,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:13,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:13,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:13,250 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:13,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:13,251 INFO L82 PathProgramCache]: Analyzing trace with hash 41143549, now seen corresponding path program 1 times [2019-10-22 09:00:13,251 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:13,251 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744856683] [2019-10-22 09:00:13,251 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:13,251 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:13,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:13,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:13,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:13,797 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744856683] [2019-10-22 09:00:13,797 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:13,797 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-22 09:00:13,797 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126193182] [2019-10-22 09:00:14,801 WARN L191 SmtUtils]: Spent 980.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 69 [2019-10-22 09:00:14,894 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:14,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 09:00:14,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-22 09:00:14,894 INFO L87 Difference]: Start difference. First operand 1418 states and 1541 transitions. cyclomatic complexity: 128 Second operand 9 states. [2019-10-22 09:00:15,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:15,576 INFO L93 Difference]: Finished difference Result 1330 states and 1452 transitions. [2019-10-22 09:00:15,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 09:00:15,577 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1330 states and 1452 transitions. [2019-10-22 09:00:15,582 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1272 [2019-10-22 09:00:15,587 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1330 states to 1330 states and 1452 transitions. [2019-10-22 09:00:15,588 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1330 [2019-10-22 09:00:15,589 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1330 [2019-10-22 09:00:15,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1330 states and 1452 transitions. [2019-10-22 09:00:15,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:15,591 INFO L688 BuchiCegarLoop]: Abstraction has 1330 states and 1452 transitions. [2019-10-22 09:00:15,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states and 1452 transitions. [2019-10-22 09:00:15,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1330. [2019-10-22 09:00:15,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1330 states. [2019-10-22 09:00:15,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1452 transitions. [2019-10-22 09:00:15,610 INFO L711 BuchiCegarLoop]: Abstraction has 1330 states and 1452 transitions. [2019-10-22 09:00:15,610 INFO L591 BuchiCegarLoop]: Abstraction has 1330 states and 1452 transitions. [2019-10-22 09:00:15,610 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-10-22 09:00:15,610 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1330 states and 1452 transitions. [2019-10-22 09:00:15,616 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1272 [2019-10-22 09:00:15,616 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:15,616 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:15,617 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-10-22 09:00:15,617 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:15,617 INFO L791 eck$LassoCheckResult]: Stem: 31519#ULTIMATE.startENTRY ~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; 31398#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 31399#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 32229#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 32226#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 32223#L35 assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0);~a28~0 := 10;calculate_output_#res := 22; 31441#L597 [2019-10-22 09:00:15,617 INFO L793 eck$LassoCheckResult]: Loop: 31441#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 32483#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 32480#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 32476#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 32472#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 32468#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 32464#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 32457#L47 assume ((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0;~a25~0 := 0;calculate_output_#res := -1; 31441#L597 [2019-10-22 09:00:15,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:15,617 INFO L82 PathProgramCache]: Analyzing trace with hash 889694475, now seen corresponding path program 1 times [2019-10-22 09:00:15,617 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:15,618 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451934269] [2019-10-22 09:00:15,618 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:15,618 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:15,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:15,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:15,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:15,625 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:15,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:15,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1141479969, now seen corresponding path program 1 times [2019-10-22 09:00:15,626 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:15,626 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021049594] [2019-10-22 09:00:15,626 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:15,626 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:15,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:15,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:15,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:15,633 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:15,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:15,633 INFO L82 PathProgramCache]: Analyzing trace with hash 2047121707, now seen corresponding path program 1 times [2019-10-22 09:00:15,634 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:15,634 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38484351] [2019-10-22 09:00:15,634 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:15,634 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:15,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:15,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:15,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:15,644 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:15,850 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 65 [2019-10-22 09:00:15,896 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:15,896 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:15,896 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:15,896 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:15,896 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 09:00:15,896 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:15,896 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:15,896 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:15,896 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label20.c_Iteration12_Lasso [2019-10-22 09:00:15,897 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:15,897 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:15,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:15,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:15,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:15,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:15,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:15,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:15,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:15,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:15,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:15,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:15,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:15,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:15,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:15,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:15,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:15,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:15,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:15,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:15,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:15,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:15,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:16,160 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:16,160 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bdda6edf-2785-4d6c-a5eb-72f4e6e0e109/bin/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 [2019-10-22 09:00:16,164 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:16,164 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:16,166 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:16,167 INFO L440 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_bdda6edf-2785-4d6c-a5eb-72f4e6e0e109/bin/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 [2019-10-22 09:00:16,171 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:16,171 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:16,173 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:16,174 INFO L440 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_bdda6edf-2785-4d6c-a5eb-72f4e6e0e109/bin/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 [2019-10-22 09:00:16,178 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:16,178 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:16,181 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:16,181 INFO L440 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_bdda6edf-2785-4d6c-a5eb-72f4e6e0e109/bin/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 [2019-10-22 09:00:16,185 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:16,185 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:16,188 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:16,188 INFO L440 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_bdda6edf-2785-4d6c-a5eb-72f4e6e0e109/bin/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 [2019-10-22 09:00:16,197 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:16,198 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:16,208 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:16,208 INFO L440 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_bdda6edf-2785-4d6c-a5eb-72f4e6e0e109/bin/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 [2019-10-22 09:00:16,213 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:16,214 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:16,216 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:16,216 INFO L440 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_bdda6edf-2785-4d6c-a5eb-72f4e6e0e109/bin/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 [2019-10-22 09:00:16,221 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:16,222 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:16,225 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:16,225 INFO L440 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_bdda6edf-2785-4d6c-a5eb-72f4e6e0e109/bin/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 [2019-10-22 09:00:16,229 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:16,229 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:16,232 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:16,232 INFO L440 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_bdda6edf-2785-4d6c-a5eb-72f4e6e0e109/bin/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 [2019-10-22 09:00:16,245 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:16,245 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:16,247 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:16,247 INFO L440 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_bdda6edf-2785-4d6c-a5eb-72f4e6e0e109/bin/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 [2019-10-22 09:00:16,278 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:16,278 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:16,281 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:16,281 INFO L440 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_bdda6edf-2785-4d6c-a5eb-72f4e6e0e109/bin/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 [2019-10-22 09:00:16,285 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:16,285 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:16,288 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:16,288 INFO L440 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_bdda6edf-2785-4d6c-a5eb-72f4e6e0e109/bin/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 [2019-10-22 09:00:16,292 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:16,292 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:16,295 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:16,295 INFO L440 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_bdda6edf-2785-4d6c-a5eb-72f4e6e0e109/bin/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 [2019-10-22 09:00:16,299 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:16,300 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:16,302 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:16,302 INFO L440 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_bdda6edf-2785-4d6c-a5eb-72f4e6e0e109/bin/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 [2019-10-22 09:00:16,307 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:16,307 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:16,309 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:16,309 INFO L440 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_bdda6edf-2785-4d6c-a5eb-72f4e6e0e109/bin/uautomizer/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:00:16,314 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:16,315 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:16,320 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:16,320 INFO L440 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_bdda6edf-2785-4d6c-a5eb-72f4e6e0e109/bin/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 [2019-10-22 09:00:16,327 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:16,327 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bdda6edf-2785-4d6c-a5eb-72f4e6e0e109/bin/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 [2019-10-22 09:00:16,338 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 09:00:16,338 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:16,562 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:16,562 INFO L440 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=-5, ULTIMATE.start_calculate_output_~input=-5, ULTIMATE.start_main_~input~0=-5, ULTIMATE.start_main_#t~nondet2=0}, {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}, {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}] Lambdas: [0, 15, 13] Nus: [0, 1] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bdda6edf-2785-4d6c-a5eb-72f4e6e0e109/bin/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 [2019-10-22 09:00:16,567 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:16,567 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:16,570 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:16,570 INFO L440 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_bdda6edf-2785-4d6c-a5eb-72f4e6e0e109/bin/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 [2019-10-22 09:00:16,574 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:16,574 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:16,577 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:16,577 INFO L440 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_bdda6edf-2785-4d6c-a5eb-72f4e6e0e109/bin/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 [2019-10-22 09:00:16,581 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:16,581 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bdda6edf-2785-4d6c-a5eb-72f4e6e0e109/bin/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 [2019-10-22 09:00:16,597 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 09:00:16,597 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:16,720 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:16,720 INFO L440 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=18}, {ULTIMATE.start_calculate_output_#res=0, ULTIMATE.start_main_~output~0=-23}, {ULTIMATE.start_calculate_output_#res=0, ULTIMATE.start_main_~output~0=28}] Lambdas: [0, 0, 0] Nus: [1, 0] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bdda6edf-2785-4d6c-a5eb-72f4e6e0e109/bin/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 [2019-10-22 09:00:16,727 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:16,727 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:16,729 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:16,730 INFO L440 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_bdda6edf-2785-4d6c-a5eb-72f4e6e0e109/bin/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 [2019-10-22 09:00:16,735 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:16,735 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:16,738 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:16,738 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a28~0=0} Honda state: {~a28~0=10} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2019-10-22 09:00:16,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 09:00:16 BoogieIcfgContainer [2019-10-22 09:00:16,768 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 09:00:16,768 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:00:16,768 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:00:16,768 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:00:16,769 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:00:01" (3/4) ... [2019-10-22 09:00:16,772 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-10-22 09:00:16,842 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_bdda6edf-2785-4d6c-a5eb-72f4e6e0e109/bin/uautomizer/witness.graphml [2019-10-22 09:00:16,845 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:00:16,846 INFO L168 Benchmark]: Toolchain (without parser) took 17899.41 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 666.4 MB). Free memory was 937.8 MB in the beginning and 1.4 GB in the end (delta: -465.6 MB). Peak memory consumption was 200.8 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:16,847 INFO L168 Benchmark]: CDTParser took 0.37 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:00:16,847 INFO L168 Benchmark]: CACSL2BoogieTranslator took 671.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 937.8 MB in the beginning and 1.1 GB in the end (delta: -180.2 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:16,848 INFO L168 Benchmark]: Boogie Procedure Inliner took 96.09 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:16,848 INFO L168 Benchmark]: Boogie Preprocessor took 88.82 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:16,848 INFO L168 Benchmark]: RCFGBuilder took 1544.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 998.1 MB in the end (delta: 106.7 MB). Peak memory consumption was 106.7 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:16,849 INFO L168 Benchmark]: BuchiAutomizer took 15417.70 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 524.8 MB). Free memory was 998.1 MB in the beginning and 1.4 GB in the end (delta: -411.4 MB). Peak memory consumption was 515.6 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:16,849 INFO L168 Benchmark]: Witness Printer took 77.06 ms. Allocated memory is still 1.7 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 6.1 MB). Peak memory consumption was 6.1 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:16,858 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.37 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 671.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 937.8 MB in the beginning and 1.1 GB in the end (delta: -180.2 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 96.09 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 88.82 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1544.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 998.1 MB in the end (delta: 106.7 MB). Peak memory consumption was 106.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 15417.70 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 524.8 MB). Free memory was 998.1 MB in the beginning and 1.4 GB in the end (delta: -411.4 MB). Peak memory consumption was 515.6 MB. Max. memory is 11.5 GB. * Witness Printer took 77.06 ms. Allocated memory is still 1.7 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 6.1 MB). Peak memory consumption was 6.1 MB. 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 11 terminating modules (11 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.11 modules have a trivial ranking function, the largest among these consists of 9 locations. The remainder module has 1330 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 15.3s and 12 iterations. TraceHistogramMax:4. Analysis of lassos took 7.9s. Construction of modules took 4.8s. Büchi inclusion checks took 1.7s. Highest rank in rank-based complementation 0. Minimization of det autom 11. Minimization of nondet autom 0. Automata minimization 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 1975 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had 2130 states and ocurred in iteration 8. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1503 SDtfs, 1791 SDslu, 175 SDs, 0 SdLazy, 4260 SolverSat, 739 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.8s Time LassoAnalysisResults: nont1 unkn0 SFLI8 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: 202ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 0 MotzkinApplications: 18 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 31 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.8s - 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@576151e8=0, a11=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2c2ce387=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@576151e8=0, a11=0, \result=22, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2c2ce387=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@576151e8=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@2c2ce387=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 -5*0^k, output=-1 + sum_{k=0}^i 18*0^k + -23*0^k + -23*k*0^(k-1) + 28*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*0^k, input=6 + sum_{k=0}^i -5*0^k} - StatisticsResult: NonterminationArgumentStatistics Unbounded Execution 4GEVs Lambdas: [0, 15, 13, 0, 0, 0] Mus: [0, 1, 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)) [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] 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)) [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...