./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.2.ufo.BOUNDED-8.pals.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/run_dir_c41f7e4c-45c8-4992-bf07-55211aacfae0/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c41f7e4c-45c8-4992-bf07-55211aacfae0/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c41f7e4c-45c8-4992-bf07-55211aacfae0/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c41f7e4c-45c8-4992-bf07-55211aacfae0/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.2.ufo.BOUNDED-8.pals.c -s /tmp/vcloud-vcloud-master/worker/run_dir_c41f7e4c-45c8-4992-bf07-55211aacfae0/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c41f7e4c-45c8-4992-bf07-55211aacfae0/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 18f19371a7a9ee6a4bf7a15f55bfde20933d94db ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:33:25,723 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:33:25,725 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:33:25,742 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:33:25,742 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:33:25,744 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:33:25,746 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:33:25,758 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:33:25,763 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:33:25,767 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:33:25,770 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:33:25,771 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:33:25,772 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:33:25,774 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:33:25,776 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:33:25,777 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:33:25,778 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:33:25,780 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:33:25,784 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:33:25,788 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:33:25,792 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:33:25,794 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:33:25,798 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:33:25,799 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:33:25,802 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:33:25,802 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:33:25,803 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:33:25,804 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:33:25,805 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:33:25,806 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:33:25,806 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:33:25,807 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:33:25,808 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:33:25,809 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:33:25,810 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:33:25,811 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:33:25,812 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:33:25,812 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:33:25,812 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:33:25,813 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:33:25,814 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:33:25,815 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c41f7e4c-45c8-4992-bf07-55211aacfae0/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-16 00:33:25,849 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:33:25,850 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:33:25,852 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:33:25,853 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:33:25,854 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:33:25,854 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-16 00:33:25,855 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-16 00:33:25,855 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-16 00:33:25,855 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-16 00:33:25,855 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-16 00:33:25,857 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-16 00:33:25,857 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:33:25,857 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:33:25,858 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:33:25,858 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:33:25,858 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:33:25,858 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:33:25,859 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-16 00:33:25,859 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-16 00:33:25,859 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-16 00:33:25,860 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:33:25,860 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:33:25,860 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-16 00:33:25,861 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:33:25,861 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-16 00:33:25,862 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:33:25,862 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:33:25,862 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-16 00:33:25,862 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:33:25,863 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:33:25,863 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-16 00:33:25,867 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-16 00:33:25,867 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/run_dir_c41f7e4c-45c8-4992-bf07-55211aacfae0/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 -> 18f19371a7a9ee6a4bf7a15f55bfde20933d94db [2019-11-16 00:33:25,914 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:33:25,932 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:33:25,937 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:33:25,939 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:33:25,940 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:33:25,940 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c41f7e4c-45c8-4992-bf07-55211aacfae0/bin/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.2.ufo.BOUNDED-8.pals.c [2019-11-16 00:33:26,016 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c41f7e4c-45c8-4992-bf07-55211aacfae0/bin/uautomizer/data/92e77979d/30293f591a5a48d59893632111ca2e3d/FLAG42b17bf29 [2019-11-16 00:33:26,685 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:33:26,686 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c41f7e4c-45c8-4992-bf07-55211aacfae0/sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.2.ufo.BOUNDED-8.pals.c [2019-11-16 00:33:26,706 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c41f7e4c-45c8-4992-bf07-55211aacfae0/bin/uautomizer/data/92e77979d/30293f591a5a48d59893632111ca2e3d/FLAG42b17bf29 [2019-11-16 00:33:26,852 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c41f7e4c-45c8-4992-bf07-55211aacfae0/bin/uautomizer/data/92e77979d/30293f591a5a48d59893632111ca2e3d [2019-11-16 00:33:26,855 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:33:26,857 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:33:26,858 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:33:26,858 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:33:26,868 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:33:26,870 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:33:26" (1/1) ... [2019-11-16 00:33:26,873 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@439860f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:33:26, skipping insertion in model container [2019-11-16 00:33:26,873 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:33:26" (1/1) ... [2019-11-16 00:33:26,882 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:33:26,959 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:33:27,422 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:33:27,435 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:33:27,600 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:33:27,624 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:33:27,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:33:27 WrapperNode [2019-11-16 00:33:27,625 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:33:27,626 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:33:27,626 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:33:27,627 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:33:27,638 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:33:27" (1/1) ... [2019-11-16 00:33:27,656 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:33:27" (1/1) ... [2019-11-16 00:33:27,722 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:33:27,722 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:33:27,722 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:33:27,722 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:33:27,734 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:33:27" (1/1) ... [2019-11-16 00:33:27,735 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:33:27" (1/1) ... [2019-11-16 00:33:27,745 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:33:27" (1/1) ... [2019-11-16 00:33:27,746 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:33:27" (1/1) ... [2019-11-16 00:33:27,767 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:33:27" (1/1) ... [2019-11-16 00:33:27,801 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:33:27" (1/1) ... [2019-11-16 00:33:27,805 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:33:27" (1/1) ... [2019-11-16 00:33:27,829 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:33:27,830 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:33:27,830 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:33:27,830 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:33:27,831 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:33:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c41f7e4c-45c8-4992-bf07-55211aacfae0/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-11-16 00:33:27,916 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:33:27,916 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:33:29,379 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:33:29,380 INFO L284 CfgBuilder]: Removed 19 assume(true) statements. [2019-11-16 00:33:29,381 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:33:29 BoogieIcfgContainer [2019-11-16 00:33:29,382 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:33:29,382 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-16 00:33:29,383 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-16 00:33:29,389 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-16 00:33:29,390 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:33:29,390 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.11 12:33:26" (1/3) ... [2019-11-16 00:33:29,391 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6169ff3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:33:29, skipping insertion in model container [2019-11-16 00:33:29,391 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:33:29,392 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:33:27" (2/3) ... [2019-11-16 00:33:29,392 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6169ff3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:33:29, skipping insertion in model container [2019-11-16 00:33:29,392 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:33:29,392 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:33:29" (3/3) ... [2019-11-16 00:33:29,399 INFO L371 chiAutomizerObserver]: Analyzing ICFG pals_floodmax.4.2.ufo.BOUNDED-8.pals.c [2019-11-16 00:33:29,447 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-16 00:33:29,448 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-16 00:33:29,448 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-16 00:33:29,448 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:33:29,448 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:33:29,448 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-16 00:33:29,449 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:33:29,449 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-16 00:33:29,477 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 301 states. [2019-11-16 00:33:29,526 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 107 [2019-11-16 00:33:29,526 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:33:29,527 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:33:29,540 INFO L849 BuchiCegarLoop]: Counterexample stem 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] [2019-11-16 00:33:29,540 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] [2019-11-16 00:33:29,541 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-16 00:33:29,541 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 301 states. [2019-11-16 00:33:29,555 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 107 [2019-11-16 00:33:29,556 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:33:29,556 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:33:29,561 INFO L849 BuchiCegarLoop]: Counterexample stem 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] [2019-11-16 00:33:29,561 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] [2019-11-16 00:33:29,572 INFO L791 eck$LassoCheckResult]: Stem: 108#ULTIMATE.startENTRYtrue ~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset]; 10#L-1true havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~ret52, main_#t~ret53, main_#t~post54, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet12;havoc main_#t~nondet12;~ep13~0 := main_#t~nondet13;havoc main_#t~nondet13;~ep14~0 := main_#t~nondet14;havoc main_#t~nondet14;~ep21~0 := main_#t~nondet15;havoc main_#t~nondet15;~ep23~0 := main_#t~nondet16;havoc main_#t~nondet16;~ep24~0 := main_#t~nondet17;havoc main_#t~nondet17;~ep31~0 := main_#t~nondet18;havoc main_#t~nondet18;~ep32~0 := main_#t~nondet19;havoc main_#t~nondet19;~ep34~0 := main_#t~nondet20;havoc main_#t~nondet20;~ep41~0 := main_#t~nondet21;havoc main_#t~nondet21;~ep42~0 := main_#t~nondet22;havoc main_#t~nondet22;~ep43~0 := main_#t~nondet23;havoc main_#t~nondet23;~id1~0 := main_#t~nondet24;havoc main_#t~nondet24;~r1~0 := main_#t~nondet25;havoc main_#t~nondet25;~st1~0 := main_#t~nondet26;havoc main_#t~nondet26;~nl1~0 := main_#t~nondet27;havoc main_#t~nondet27;~m1~0 := main_#t~nondet28;havoc main_#t~nondet28;~max1~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode1~0 := main_#t~nondet30;havoc main_#t~nondet30;~id2~0 := main_#t~nondet31;havoc main_#t~nondet31;~r2~0 := main_#t~nondet32;havoc main_#t~nondet32;~st2~0 := main_#t~nondet33;havoc main_#t~nondet33;~nl2~0 := main_#t~nondet34;havoc main_#t~nondet34;~m2~0 := main_#t~nondet35;havoc main_#t~nondet35;~max2~0 := main_#t~nondet36;havoc main_#t~nondet36;~mode2~0 := main_#t~nondet37;havoc main_#t~nondet37;~id3~0 := main_#t~nondet38;havoc main_#t~nondet38;~r3~0 := main_#t~nondet39;havoc main_#t~nondet39;~st3~0 := main_#t~nondet40;havoc main_#t~nondet40;~nl3~0 := main_#t~nondet41;havoc main_#t~nondet41;~m3~0 := main_#t~nondet42;havoc main_#t~nondet42;~max3~0 := main_#t~nondet43;havoc main_#t~nondet43;~mode3~0 := main_#t~nondet44;havoc main_#t~nondet44;~id4~0 := main_#t~nondet45;havoc main_#t~nondet45;~r4~0 := main_#t~nondet46;havoc main_#t~nondet46;~st4~0 := main_#t~nondet47;havoc main_#t~nondet47;~nl4~0 := main_#t~nondet48;havoc main_#t~nondet48;~m4~0 := main_#t~nondet49;havoc main_#t~nondet49;~max4~0 := main_#t~nondet50;havoc main_#t~nondet50;~mode4~0 := main_#t~nondet51;havoc main_#t~nondet51;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r141~0, init_~r211~0, init_~r231~0, init_~r241~0, init_~r311~0, init_~r321~0, init_~r341~0, init_~r411~0, init_~r421~0, init_~r431~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r142~0, init_~tmp___1~0, init_~r212~0, init_~tmp___2~0, init_~r232~0, init_~tmp___3~0, init_~r242~0, init_~tmp___4~0, init_~r312~0, init_~tmp___5~0, init_~r322~0, init_~tmp___6~0, init_~r342~0, init_~tmp___7~0, init_~r412~0, init_~tmp___8~0, init_~r422~0, init_~tmp___9~0, init_~r432~0, init_~tmp___10~0, init_~r123~0, init_~tmp___11~0, init_~r133~0, init_~tmp___12~0, init_~r143~0, init_~tmp___13~0, init_~r213~0, init_~tmp___14~0, init_~r233~0, init_~tmp___15~0, init_~r243~0, init_~tmp___16~0, init_~r313~0, init_~tmp___17~0, init_~r323~0, init_~tmp___18~0, init_~r343~0, init_~tmp___19~0, init_~r413~0, init_~tmp___20~0, init_~r423~0, init_~tmp___21~0, init_~r433~0, init_~tmp___22~0, init_~tmp___23~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r141~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r241~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r341~0;havoc init_~r411~0;havoc init_~r421~0;havoc init_~r431~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r142~0;havoc init_~tmp___1~0;havoc init_~r212~0;havoc init_~tmp___2~0;havoc init_~r232~0;havoc init_~tmp___3~0;havoc init_~r242~0;havoc init_~tmp___4~0;havoc init_~r312~0;havoc init_~tmp___5~0;havoc init_~r322~0;havoc init_~tmp___6~0;havoc init_~r342~0;havoc init_~tmp___7~0;havoc init_~r412~0;havoc init_~tmp___8~0;havoc init_~r422~0;havoc init_~tmp___9~0;havoc init_~r432~0;havoc init_~tmp___10~0;havoc init_~r123~0;havoc init_~tmp___11~0;havoc init_~r133~0;havoc init_~tmp___12~0;havoc init_~r143~0;havoc init_~tmp___13~0;havoc init_~r213~0;havoc init_~tmp___14~0;havoc init_~r233~0;havoc init_~tmp___15~0;havoc init_~r243~0;havoc init_~tmp___16~0;havoc init_~r313~0;havoc init_~tmp___17~0;havoc init_~r323~0;havoc init_~tmp___18~0;havoc init_~r343~0;havoc init_~tmp___19~0;havoc init_~r413~0;havoc init_~tmp___20~0;havoc init_~r423~0;havoc init_~tmp___21~0;havoc init_~r433~0;havoc init_~tmp___22~0;havoc init_~tmp___23~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r141~0 := ~ep14~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r241~0 := ~ep24~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0;init_~r341~0 := ~ep34~0;init_~r411~0 := ~ep41~0;init_~r421~0 := ~ep42~0;init_~r431~0 := ~ep43~0; 177#L436true assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; 199#L447true init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); 83#L457true assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; 81#L468true init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); 139#L478true assume 0 != init_~r141~0 % 256;init_~tmp___1~0 := 1; 137#L489true init_~r142~0 := (if 0 == init_~tmp___1~0 then 0 else 1); 47#L499true assume 0 != init_~r211~0 % 256;init_~tmp___2~0 := 1; 45#L510true init_~r212~0 := (if 0 == init_~tmp___2~0 then 0 else 1); 254#L520true assume 0 != init_~r231~0 % 256;init_~tmp___3~0 := 1; 252#L531true init_~r232~0 := (if 0 == init_~tmp___3~0 then 0 else 1); 164#L541true assume 0 != init_~r241~0 % 256;init_~tmp___4~0 := 1; 163#L552true init_~r242~0 := (if 0 == init_~tmp___4~0 then 0 else 1); 224#L562true assume 0 != init_~r311~0 % 256;init_~tmp___5~0 := 1; 223#L573true init_~r312~0 := (if 0 == init_~tmp___5~0 then 0 else 1); 128#L583true assume 0 != init_~r321~0 % 256;init_~tmp___6~0 := 1; 127#L594true init_~r322~0 := (if 0 == init_~tmp___6~0 then 0 else 1); 33#L604true assume 0 != init_~r341~0 % 256;init_~tmp___7~0 := 1; 32#L615true init_~r342~0 := (if 0 == init_~tmp___7~0 then 0 else 1); 237#L625true assume 0 != init_~r411~0 % 256;init_~tmp___8~0 := 1; 235#L636true init_~r412~0 := (if 0 == init_~tmp___8~0 then 0 else 1); 299#L646true assume 0 != init_~r421~0 % 256;init_~tmp___9~0 := 1; 297#L657true init_~r422~0 := (if 0 == init_~tmp___9~0 then 0 else 1); 207#L667true assume 0 != init_~r431~0 % 256;init_~tmp___10~0 := 1; 206#L678true init_~r432~0 := (if 0 == init_~tmp___10~0 then 0 else 1); 113#L688true assume 0 != init_~r122~0 % 256;init_~tmp___11~0 := 1; 112#L699true init_~r123~0 := (if 0 == init_~tmp___11~0 then 0 else 1); 17#L709true assume 0 != init_~r132~0 % 256;init_~tmp___12~0 := 1; 16#L720true init_~r133~0 := (if 0 == init_~tmp___12~0 then 0 else 1); 73#L730true assume 0 != init_~r142~0 % 256;init_~tmp___13~0 := 1; 71#L741true init_~r143~0 := (if 0 == init_~tmp___13~0 then 0 else 1); 279#L751true assume 0 != init_~r212~0 % 256;init_~tmp___14~0 := 1; 278#L762true init_~r213~0 := (if 0 == init_~tmp___14~0 then 0 else 1); 170#L772true assume 0 != init_~r232~0 % 256;init_~tmp___15~0 := 1; 190#L783true init_~r233~0 := (if 0 == init_~tmp___15~0 then 0 else 1); 77#L793true assume 0 != init_~r242~0 % 256;init_~tmp___16~0 := 1; 76#L804true init_~r243~0 := (if 0 == init_~tmp___16~0 then 0 else 1); 133#L814true assume 0 != init_~r312~0 % 256;init_~tmp___17~0 := 1; 131#L825true init_~r313~0 := (if 0 == init_~tmp___17~0 then 0 else 1); 38#L835true assume 0 != init_~r322~0 % 256;init_~tmp___18~0 := 1; 36#L846true init_~r323~0 := (if 0 == init_~tmp___18~0 then 0 else 1); 243#L856true assume 0 != init_~r342~0 % 256;init_~tmp___19~0 := 1; 242#L867true init_~r343~0 := (if 0 == init_~tmp___19~0 then 0 else 1); 156#L877true assume 0 != init_~r412~0 % 256;init_~tmp___20~0 := 1; 155#L888true init_~r413~0 := (if 0 == init_~tmp___20~0 then 0 else 1); 215#L898true assume 0 != init_~r422~0 % 256;init_~tmp___21~0 := 1; 214#L909true init_~r423~0 := (if 0 == init_~tmp___21~0 then 0 else 1); 121#L919true assume 0 != init_~r432~0 % 256;init_~tmp___22~0 := 1; 120#L930true init_~r433~0 := (if 0 == init_~tmp___22~0 then 0 else 1); 25#L940true assume !(~id1~0 != ~id2~0);init_~tmp___23~0 := 0; 28#L940-1true init_#res := init_~tmp___23~0; 266#L1109true main_#t~ret52 := init_#res;main_~i2~0 := main_#t~ret52;havoc main_#t~ret52;assume 0 != main_~i2~0;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~nomsg~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;main_~i2~0 := 0; 298#L1246-2true [2019-11-16 00:33:29,574 INFO L793 eck$LassoCheckResult]: Loop: 298#L1246-2true assume !!(main_~i2~0 < 8);havoc node1_#t~ite0, node1_#t~ite1, node1_#t~ite2; 272#L151true assume !(0 != ~mode1~0 % 256); 182#L183true assume !(~r1~0 < 3); 179#L183-1true ~mode1~0 := 1; 269#L151-2true havoc node2_#t~ite3, node2_#t~ite4, node2_#t~ite5; 91#L204true assume !(0 != ~mode2~0 % 256); 147#L236true assume !(~r2~0 < 3); 142#L236-1true ~mode2~0 := 1; 84#L204-2true havoc node3_#t~ite6, node3_#t~ite7, node3_#t~ite8; 50#L257true assume !(0 != ~mode3~0 % 256); 256#L289true assume !(~r3~0 < 3); 253#L289-1true ~mode3~0 := 1; 44#L257-2true havoc node4_#t~ite9, node4_#t~ite10, node4_#t~ite11; 159#L310true assume !(0 != ~mode4~0 % 256); 217#L342true assume !(~r4~0 < 3); 218#L342-1true ~mode4~0 := 1; 292#L310-2true ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 126#L1117true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1 := 0; 130#L1117-1true check_#res := check_~tmp~1; 296#L1169true main_#t~ret53 := check_#res;main_~c1~0 := main_#t~ret53;havoc main_#t~ret53;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 202#L1289true assume !(0 == assert_~arg % 256); 172#L1284true main_#t~post54 := main_~i2~0;main_~i2~0 := 1 + main_#t~post54;havoc main_#t~post54; 298#L1246-2true [2019-11-16 00:33:29,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:33:29,581 INFO L82 PathProgramCache]: Analyzing trace with hash 15531844, now seen corresponding path program 1 times [2019-11-16 00:33:29,592 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:33:29,593 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734304607] [2019-11-16 00:33:29,593 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:33:29,593 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:33:29,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:33:29,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:30,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:33:30,028 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734304607] [2019-11-16 00:33:30,029 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:33:30,029 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:33:30,030 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881444122] [2019-11-16 00:33:30,035 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:33:30,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:33:30,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1969179729, now seen corresponding path program 1 times [2019-11-16 00:33:30,036 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:33:30,036 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604086095] [2019-11-16 00:33:30,036 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:33:30,036 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:33:30,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:33:30,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:30,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:33:30,197 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604086095] [2019-11-16 00:33:30,197 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:33:30,197 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:33:30,198 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382819872] [2019-11-16 00:33:30,199 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:33:30,200 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:33:30,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:33:30,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:33:30,217 INFO L87 Difference]: Start difference. First operand 301 states. Second operand 5 states. [2019-11-16 00:33:30,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:33:30,393 INFO L93 Difference]: Finished difference Result 305 states and 543 transitions. [2019-11-16 00:33:30,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:33:30,396 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 305 states and 543 transitions. [2019-11-16 00:33:30,408 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 106 [2019-11-16 00:33:30,427 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 305 states to 296 states and 526 transitions. [2019-11-16 00:33:30,429 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 296 [2019-11-16 00:33:30,436 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 296 [2019-11-16 00:33:30,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 296 states and 526 transitions. [2019-11-16 00:33:30,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:33:30,447 INFO L688 BuchiCegarLoop]: Abstraction has 296 states and 526 transitions. [2019-11-16 00:33:30,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states and 526 transitions. [2019-11-16 00:33:30,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2019-11-16 00:33:30,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-11-16 00:33:30,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 526 transitions. [2019-11-16 00:33:30,527 INFO L711 BuchiCegarLoop]: Abstraction has 296 states and 526 transitions. [2019-11-16 00:33:30,528 INFO L591 BuchiCegarLoop]: Abstraction has 296 states and 526 transitions. [2019-11-16 00:33:30,528 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-16 00:33:30,528 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 296 states and 526 transitions. [2019-11-16 00:33:30,533 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 106 [2019-11-16 00:33:30,533 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:33:30,533 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:33:30,541 INFO L849 BuchiCegarLoop]: Counterexample stem 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] [2019-11-16 00:33:30,541 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] [2019-11-16 00:33:30,542 INFO L791 eck$LassoCheckResult]: Stem: 824#ULTIMATE.startENTRY ~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset]; 639#L-1 havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~ret52, main_#t~ret53, main_#t~post54, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet12;havoc main_#t~nondet12;~ep13~0 := main_#t~nondet13;havoc main_#t~nondet13;~ep14~0 := main_#t~nondet14;havoc main_#t~nondet14;~ep21~0 := main_#t~nondet15;havoc main_#t~nondet15;~ep23~0 := main_#t~nondet16;havoc main_#t~nondet16;~ep24~0 := main_#t~nondet17;havoc main_#t~nondet17;~ep31~0 := main_#t~nondet18;havoc main_#t~nondet18;~ep32~0 := main_#t~nondet19;havoc main_#t~nondet19;~ep34~0 := main_#t~nondet20;havoc main_#t~nondet20;~ep41~0 := main_#t~nondet21;havoc main_#t~nondet21;~ep42~0 := main_#t~nondet22;havoc main_#t~nondet22;~ep43~0 := main_#t~nondet23;havoc main_#t~nondet23;~id1~0 := main_#t~nondet24;havoc main_#t~nondet24;~r1~0 := main_#t~nondet25;havoc main_#t~nondet25;~st1~0 := main_#t~nondet26;havoc main_#t~nondet26;~nl1~0 := main_#t~nondet27;havoc main_#t~nondet27;~m1~0 := main_#t~nondet28;havoc main_#t~nondet28;~max1~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode1~0 := main_#t~nondet30;havoc main_#t~nondet30;~id2~0 := main_#t~nondet31;havoc main_#t~nondet31;~r2~0 := main_#t~nondet32;havoc main_#t~nondet32;~st2~0 := main_#t~nondet33;havoc main_#t~nondet33;~nl2~0 := main_#t~nondet34;havoc main_#t~nondet34;~m2~0 := main_#t~nondet35;havoc main_#t~nondet35;~max2~0 := main_#t~nondet36;havoc main_#t~nondet36;~mode2~0 := main_#t~nondet37;havoc main_#t~nondet37;~id3~0 := main_#t~nondet38;havoc main_#t~nondet38;~r3~0 := main_#t~nondet39;havoc main_#t~nondet39;~st3~0 := main_#t~nondet40;havoc main_#t~nondet40;~nl3~0 := main_#t~nondet41;havoc main_#t~nondet41;~m3~0 := main_#t~nondet42;havoc main_#t~nondet42;~max3~0 := main_#t~nondet43;havoc main_#t~nondet43;~mode3~0 := main_#t~nondet44;havoc main_#t~nondet44;~id4~0 := main_#t~nondet45;havoc main_#t~nondet45;~r4~0 := main_#t~nondet46;havoc main_#t~nondet46;~st4~0 := main_#t~nondet47;havoc main_#t~nondet47;~nl4~0 := main_#t~nondet48;havoc main_#t~nondet48;~m4~0 := main_#t~nondet49;havoc main_#t~nondet49;~max4~0 := main_#t~nondet50;havoc main_#t~nondet50;~mode4~0 := main_#t~nondet51;havoc main_#t~nondet51;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r141~0, init_~r211~0, init_~r231~0, init_~r241~0, init_~r311~0, init_~r321~0, init_~r341~0, init_~r411~0, init_~r421~0, init_~r431~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r142~0, init_~tmp___1~0, init_~r212~0, init_~tmp___2~0, init_~r232~0, init_~tmp___3~0, init_~r242~0, init_~tmp___4~0, init_~r312~0, init_~tmp___5~0, init_~r322~0, init_~tmp___6~0, init_~r342~0, init_~tmp___7~0, init_~r412~0, init_~tmp___8~0, init_~r422~0, init_~tmp___9~0, init_~r432~0, init_~tmp___10~0, init_~r123~0, init_~tmp___11~0, init_~r133~0, init_~tmp___12~0, init_~r143~0, init_~tmp___13~0, init_~r213~0, init_~tmp___14~0, init_~r233~0, init_~tmp___15~0, init_~r243~0, init_~tmp___16~0, init_~r313~0, init_~tmp___17~0, init_~r323~0, init_~tmp___18~0, init_~r343~0, init_~tmp___19~0, init_~r413~0, init_~tmp___20~0, init_~r423~0, init_~tmp___21~0, init_~r433~0, init_~tmp___22~0, init_~tmp___23~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r141~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r241~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r341~0;havoc init_~r411~0;havoc init_~r421~0;havoc init_~r431~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r142~0;havoc init_~tmp___1~0;havoc init_~r212~0;havoc init_~tmp___2~0;havoc init_~r232~0;havoc init_~tmp___3~0;havoc init_~r242~0;havoc init_~tmp___4~0;havoc init_~r312~0;havoc init_~tmp___5~0;havoc init_~r322~0;havoc init_~tmp___6~0;havoc init_~r342~0;havoc init_~tmp___7~0;havoc init_~r412~0;havoc init_~tmp___8~0;havoc init_~r422~0;havoc init_~tmp___9~0;havoc init_~r432~0;havoc init_~tmp___10~0;havoc init_~r123~0;havoc init_~tmp___11~0;havoc init_~r133~0;havoc init_~tmp___12~0;havoc init_~r143~0;havoc init_~tmp___13~0;havoc init_~r213~0;havoc init_~tmp___14~0;havoc init_~r233~0;havoc init_~tmp___15~0;havoc init_~r243~0;havoc init_~tmp___16~0;havoc init_~r313~0;havoc init_~tmp___17~0;havoc init_~r323~0;havoc init_~tmp___18~0;havoc init_~r343~0;havoc init_~tmp___19~0;havoc init_~r413~0;havoc init_~tmp___20~0;havoc init_~r423~0;havoc init_~tmp___21~0;havoc init_~r433~0;havoc init_~tmp___22~0;havoc init_~tmp___23~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r141~0 := ~ep14~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r241~0 := ~ep24~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0;init_~r341~0 := ~ep34~0;init_~r411~0 := ~ep41~0;init_~r421~0 := ~ep42~0;init_~r431~0 := ~ep43~0; 640#L436 assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; 792#L447 init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); 786#L457 assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; 667#L468 init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); 783#L478 assume 0 != init_~r141~0 % 256;init_~tmp___1~0 := 1; 729#L489 init_~r142~0 := (if 0 == init_~tmp___1~0 then 0 else 1); 725#L499 assume 0 != init_~r211~0 % 256;init_~tmp___2~0 := 1; 638#L510 init_~r212~0 := (if 0 == init_~tmp___2~0 then 0 else 1); 718#L520 assume 0 != init_~r231~0 % 256;init_~tmp___3~0 := 1; 716#L531 init_~r232~0 := (if 0 == init_~tmp___3~0 then 0 else 1); 864#L541 assume 0 != init_~r241~0 % 256;init_~tmp___4~0 := 1; 819#L552 init_~r242~0 := (if 0 == init_~tmp___4~0 then 0 else 1); 863#L562 assume 0 != init_~r311~0 % 256;init_~tmp___5~0 := 1; 632#L573 init_~r312~0 := (if 0 == init_~tmp___5~0 then 0 else 1); 844#L583 assume 0 != init_~r321~0 % 256;init_~tmp___6~0 := 1; 695#L594 init_~r322~0 := (if 0 == init_~tmp___6~0 then 0 else 1); 692#L604 assume 0 != init_~r341~0 % 256;init_~tmp___7~0 := 1; 690#L615 init_~r342~0 := (if 0 == init_~tmp___7~0 then 0 else 1); 691#L625 assume 0 != init_~r411~0 % 256;init_~tmp___8~0 := 1; 689#L636 init_~r412~0 := (if 0 == init_~tmp___8~0 then 0 else 1); 914#L646 assume 0 != init_~r421~0 % 256;init_~tmp___9~0 := 1; 779#L657 init_~r422~0 := (if 0 == init_~tmp___9~0 then 0 else 1); 900#L667 assume 0 != init_~r431~0 % 256;init_~tmp___10~0 := 1; 831#L678 init_~r432~0 := (if 0 == init_~tmp___10~0 then 0 else 1); 828#L688 assume 0 != init_~r122~0 % 256;init_~tmp___11~0 := 1; 659#L699 init_~r123~0 := (if 0 == init_~tmp___11~0 then 0 else 1); 656#L709 assume 0 != init_~r132~0 % 256;init_~tmp___12~0 := 1; 654#L720 init_~r133~0 := (if 0 == init_~tmp___12~0 then 0 else 1); 655#L730 assume 0 != init_~r142~0 % 256;init_~tmp___13~0 := 1; 650#L741 init_~r143~0 := (if 0 == init_~tmp___13~0 then 0 else 1); 766#L751 assume 0 != init_~r212~0 % 256;init_~tmp___14~0 := 1; 765#L762 init_~r213~0 := (if 0 == init_~tmp___14~0 then 0 else 1); 873#L772 assume 0 != init_~r232~0 % 256;init_~tmp___15~0 := 1; 777#L783 init_~r233~0 := (if 0 == init_~tmp___15~0 then 0 else 1); 775#L793 assume 0 != init_~r242~0 % 256;init_~tmp___16~0 := 1; 644#L804 init_~r243~0 := (if 0 == init_~tmp___16~0 then 0 else 1); 772#L814 assume 0 != init_~r312~0 % 256;init_~tmp___17~0 := 1; 710#L825 init_~r313~0 := (if 0 == init_~tmp___17~0 then 0 else 1); 703#L835 assume 0 != init_~r322~0 % 256;init_~tmp___18~0 := 1; 701#L846 init_~r323~0 := (if 0 == init_~tmp___18~0 then 0 else 1); 702#L856 assume 0 != init_~r342~0 % 256;init_~tmp___19~0 := 1; 698#L867 init_~r343~0 := (if 0 == init_~tmp___19~0 then 0 else 1); 857#L877 assume 0 != init_~r412~0 % 256;init_~tmp___20~0 := 1; 804#L888 init_~r413~0 := (if 0 == init_~tmp___20~0 then 0 else 1); 856#L898 assume 0 != init_~r422~0 % 256;init_~tmp___21~0 := 1; 838#L909 init_~r423~0 := (if 0 == init_~tmp___21~0 then 0 else 1); 836#L919 assume 0 != init_~r432~0 % 256;init_~tmp___22~0 := 1; 679#L930 init_~r433~0 := (if 0 == init_~tmp___22~0 then 0 else 1); 676#L940 assume !(~id1~0 != ~id2~0);init_~tmp___23~0 := 0; 665#L940-1 init_#res := init_~tmp___23~0; 683#L1109 main_#t~ret52 := init_#res;main_~i2~0 := main_#t~ret52;havoc main_#t~ret52;assume 0 != main_~i2~0;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~nomsg~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;main_~i2~0 := 0; 875#L1246-2 [2019-11-16 00:33:30,543 INFO L793 eck$LassoCheckResult]: Loop: 875#L1246-2 assume !!(main_~i2~0 < 8);havoc node1_#t~ite0, node1_#t~ite1, node1_#t~ite2; 917#L151 assume !(0 != ~mode1~0 % 256); 886#L183 assume !(~r1~0 < 3); 682#L183-1 ~mode1~0 := 1; 767#L151-2 havoc node2_#t~ite3, node2_#t~ite4, node2_#t~ite5; 798#L204 assume !(0 != ~mode2~0 % 256); 800#L236 assume !(~r2~0 < 3); 747#L236-1 ~mode2~0 := 1; 788#L204-2 havoc node3_#t~ite6, node3_#t~ite7, node3_#t~ite8; 730#L257 assume !(0 != ~mode3~0 % 256); 732#L289 assume !(~r3~0 < 3); 818#L289-1 ~mode3~0 := 1; 713#L257-2 havoc node4_#t~ite9, node4_#t~ite10, node4_#t~ite11; 714#L310 assume !(0 != ~mode4~0 % 256); 861#L342 assume !(~r4~0 < 3); 760#L342-1 ~mode4~0 := 1; 905#L310-2 ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 841#L1117 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 842#L1118 assume ~st1~0 + ~nl1~0 <= 1; 878#L1119 assume ~st2~0 + ~nl2~0 <= 1; 879#L1120 assume ~st3~0 + ~nl3~0 <= 1; 754#L1121 assume ~st4~0 + ~nl4~0 <= 1; 628#L1122 assume ~r1~0 >= 3; 629#L1126 assume ~r1~0 < 3; 881#L1131 assume ~r1~0 >= 3; 903#L1136 assume ~r1~0 < 3;check_~tmp~1 := 1; 847#L1117-1 check_#res := check_~tmp~1; 848#L1169 main_#t~ret53 := check_#res;main_~c1~0 := main_#t~ret53;havoc main_#t~ret53;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 897#L1289 assume !(0 == assert_~arg % 256); 874#L1284 main_#t~post54 := main_~i2~0;main_~i2~0 := 1 + main_#t~post54;havoc main_#t~post54; 875#L1246-2 [2019-11-16 00:33:30,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:33:30,544 INFO L82 PathProgramCache]: Analyzing trace with hash 15531844, now seen corresponding path program 2 times [2019-11-16 00:33:30,544 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:33:30,545 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275679825] [2019-11-16 00:33:30,545 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:33:30,545 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:33:30,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:33:30,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:30,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:33:30,721 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275679825] [2019-11-16 00:33:30,722 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:33:30,722 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:33:30,723 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052975218] [2019-11-16 00:33:30,724 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:33:30,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:33:30,726 INFO L82 PathProgramCache]: Analyzing trace with hash -416905568, now seen corresponding path program 1 times [2019-11-16 00:33:30,727 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:33:30,727 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239888823] [2019-11-16 00:33:30,727 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:33:30,727 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:33:30,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:33:30,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:30,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:33:30,786 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239888823] [2019-11-16 00:33:30,786 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:33:30,787 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:33:30,787 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031912781] [2019-11-16 00:33:30,787 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:33:30,788 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:33:30,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:33:30,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:33:30,788 INFO L87 Difference]: Start difference. First operand 296 states and 526 transitions. cyclomatic complexity: 231 Second operand 3 states. [2019-11-16 00:33:30,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:33:30,880 INFO L93 Difference]: Finished difference Result 380 states and 659 transitions. [2019-11-16 00:33:30,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:33:30,882 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 380 states and 659 transitions. [2019-11-16 00:33:30,887 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 190 [2019-11-16 00:33:30,893 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 380 states to 380 states and 659 transitions. [2019-11-16 00:33:30,894 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 380 [2019-11-16 00:33:30,895 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 380 [2019-11-16 00:33:30,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 380 states and 659 transitions. [2019-11-16 00:33:30,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:33:30,899 INFO L688 BuchiCegarLoop]: Abstraction has 380 states and 659 transitions. [2019-11-16 00:33:30,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states and 659 transitions. [2019-11-16 00:33:30,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2019-11-16 00:33:30,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2019-11-16 00:33:30,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 659 transitions. [2019-11-16 00:33:30,934 INFO L711 BuchiCegarLoop]: Abstraction has 380 states and 659 transitions. [2019-11-16 00:33:30,934 INFO L591 BuchiCegarLoop]: Abstraction has 380 states and 659 transitions. [2019-11-16 00:33:30,934 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-16 00:33:30,934 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 380 states and 659 transitions. [2019-11-16 00:33:30,938 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 190 [2019-11-16 00:33:30,939 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:33:30,939 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:33:30,943 INFO L849 BuchiCegarLoop]: Counterexample stem 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] [2019-11-16 00:33:30,943 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] [2019-11-16 00:33:30,944 INFO L791 eck$LassoCheckResult]: Stem: 1507#ULTIMATE.startENTRY ~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset]; 1322#L-1 havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~ret52, main_#t~ret53, main_#t~post54, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet12;havoc main_#t~nondet12;~ep13~0 := main_#t~nondet13;havoc main_#t~nondet13;~ep14~0 := main_#t~nondet14;havoc main_#t~nondet14;~ep21~0 := main_#t~nondet15;havoc main_#t~nondet15;~ep23~0 := main_#t~nondet16;havoc main_#t~nondet16;~ep24~0 := main_#t~nondet17;havoc main_#t~nondet17;~ep31~0 := main_#t~nondet18;havoc main_#t~nondet18;~ep32~0 := main_#t~nondet19;havoc main_#t~nondet19;~ep34~0 := main_#t~nondet20;havoc main_#t~nondet20;~ep41~0 := main_#t~nondet21;havoc main_#t~nondet21;~ep42~0 := main_#t~nondet22;havoc main_#t~nondet22;~ep43~0 := main_#t~nondet23;havoc main_#t~nondet23;~id1~0 := main_#t~nondet24;havoc main_#t~nondet24;~r1~0 := main_#t~nondet25;havoc main_#t~nondet25;~st1~0 := main_#t~nondet26;havoc main_#t~nondet26;~nl1~0 := main_#t~nondet27;havoc main_#t~nondet27;~m1~0 := main_#t~nondet28;havoc main_#t~nondet28;~max1~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode1~0 := main_#t~nondet30;havoc main_#t~nondet30;~id2~0 := main_#t~nondet31;havoc main_#t~nondet31;~r2~0 := main_#t~nondet32;havoc main_#t~nondet32;~st2~0 := main_#t~nondet33;havoc main_#t~nondet33;~nl2~0 := main_#t~nondet34;havoc main_#t~nondet34;~m2~0 := main_#t~nondet35;havoc main_#t~nondet35;~max2~0 := main_#t~nondet36;havoc main_#t~nondet36;~mode2~0 := main_#t~nondet37;havoc main_#t~nondet37;~id3~0 := main_#t~nondet38;havoc main_#t~nondet38;~r3~0 := main_#t~nondet39;havoc main_#t~nondet39;~st3~0 := main_#t~nondet40;havoc main_#t~nondet40;~nl3~0 := main_#t~nondet41;havoc main_#t~nondet41;~m3~0 := main_#t~nondet42;havoc main_#t~nondet42;~max3~0 := main_#t~nondet43;havoc main_#t~nondet43;~mode3~0 := main_#t~nondet44;havoc main_#t~nondet44;~id4~0 := main_#t~nondet45;havoc main_#t~nondet45;~r4~0 := main_#t~nondet46;havoc main_#t~nondet46;~st4~0 := main_#t~nondet47;havoc main_#t~nondet47;~nl4~0 := main_#t~nondet48;havoc main_#t~nondet48;~m4~0 := main_#t~nondet49;havoc main_#t~nondet49;~max4~0 := main_#t~nondet50;havoc main_#t~nondet50;~mode4~0 := main_#t~nondet51;havoc main_#t~nondet51;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r141~0, init_~r211~0, init_~r231~0, init_~r241~0, init_~r311~0, init_~r321~0, init_~r341~0, init_~r411~0, init_~r421~0, init_~r431~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r142~0, init_~tmp___1~0, init_~r212~0, init_~tmp___2~0, init_~r232~0, init_~tmp___3~0, init_~r242~0, init_~tmp___4~0, init_~r312~0, init_~tmp___5~0, init_~r322~0, init_~tmp___6~0, init_~r342~0, init_~tmp___7~0, init_~r412~0, init_~tmp___8~0, init_~r422~0, init_~tmp___9~0, init_~r432~0, init_~tmp___10~0, init_~r123~0, init_~tmp___11~0, init_~r133~0, init_~tmp___12~0, init_~r143~0, init_~tmp___13~0, init_~r213~0, init_~tmp___14~0, init_~r233~0, init_~tmp___15~0, init_~r243~0, init_~tmp___16~0, init_~r313~0, init_~tmp___17~0, init_~r323~0, init_~tmp___18~0, init_~r343~0, init_~tmp___19~0, init_~r413~0, init_~tmp___20~0, init_~r423~0, init_~tmp___21~0, init_~r433~0, init_~tmp___22~0, init_~tmp___23~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r141~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r241~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r341~0;havoc init_~r411~0;havoc init_~r421~0;havoc init_~r431~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r142~0;havoc init_~tmp___1~0;havoc init_~r212~0;havoc init_~tmp___2~0;havoc init_~r232~0;havoc init_~tmp___3~0;havoc init_~r242~0;havoc init_~tmp___4~0;havoc init_~r312~0;havoc init_~tmp___5~0;havoc init_~r322~0;havoc init_~tmp___6~0;havoc init_~r342~0;havoc init_~tmp___7~0;havoc init_~r412~0;havoc init_~tmp___8~0;havoc init_~r422~0;havoc init_~tmp___9~0;havoc init_~r432~0;havoc init_~tmp___10~0;havoc init_~r123~0;havoc init_~tmp___11~0;havoc init_~r133~0;havoc init_~tmp___12~0;havoc init_~r143~0;havoc init_~tmp___13~0;havoc init_~r213~0;havoc init_~tmp___14~0;havoc init_~r233~0;havoc init_~tmp___15~0;havoc init_~r243~0;havoc init_~tmp___16~0;havoc init_~r313~0;havoc init_~tmp___17~0;havoc init_~r323~0;havoc init_~tmp___18~0;havoc init_~r343~0;havoc init_~tmp___19~0;havoc init_~r413~0;havoc init_~tmp___20~0;havoc init_~r423~0;havoc init_~tmp___21~0;havoc init_~r433~0;havoc init_~tmp___22~0;havoc init_~tmp___23~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r141~0 := ~ep14~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r241~0 := ~ep24~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0;init_~r341~0 := ~ep34~0;init_~r411~0 := ~ep41~0;init_~r421~0 := ~ep42~0;init_~r431~0 := ~ep43~0; 1323#L436 assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; 1475#L447 init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); 1470#L457 assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; 1350#L468 init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); 1466#L478 assume 0 != init_~r141~0 % 256;init_~tmp___1~0 := 1; 1412#L489 init_~r142~0 := (if 0 == init_~tmp___1~0 then 0 else 1); 1408#L499 assume 0 != init_~r211~0 % 256;init_~tmp___2~0 := 1; 1321#L510 init_~r212~0 := (if 0 == init_~tmp___2~0 then 0 else 1); 1404#L520 assume 0 != init_~r231~0 % 256;init_~tmp___3~0 := 1; 1400#L531 init_~r232~0 := (if 0 == init_~tmp___3~0 then 0 else 1); 1547#L541 assume 0 != init_~r241~0 % 256;init_~tmp___4~0 := 1; 1502#L552 init_~r242~0 := (if 0 == init_~tmp___4~0 then 0 else 1); 1546#L562 assume 0 != init_~r311~0 % 256;init_~tmp___5~0 := 1; 1315#L573 init_~r312~0 := (if 0 == init_~tmp___5~0 then 0 else 1); 1527#L583 assume 0 != init_~r321~0 % 256;init_~tmp___6~0 := 1; 1378#L594 init_~r322~0 := (if 0 == init_~tmp___6~0 then 0 else 1); 1375#L604 assume 0 != init_~r341~0 % 256;init_~tmp___7~0 := 1; 1373#L615 init_~r342~0 := (if 0 == init_~tmp___7~0 then 0 else 1); 1374#L625 assume 0 != init_~r411~0 % 256;init_~tmp___8~0 := 1; 1372#L636 init_~r412~0 := (if 0 == init_~tmp___8~0 then 0 else 1); 1600#L646 assume 0 != init_~r421~0 % 256;init_~tmp___9~0 := 1; 1462#L657 init_~r422~0 := (if 0 == init_~tmp___9~0 then 0 else 1); 1585#L667 assume 0 != init_~r431~0 % 256;init_~tmp___10~0 := 1; 1514#L678 init_~r432~0 := (if 0 == init_~tmp___10~0 then 0 else 1); 1511#L688 assume 0 != init_~r122~0 % 256;init_~tmp___11~0 := 1; 1344#L699 init_~r123~0 := (if 0 == init_~tmp___11~0 then 0 else 1); 1339#L709 assume 0 != init_~r132~0 % 256;init_~tmp___12~0 := 1; 1337#L720 init_~r133~0 := (if 0 == init_~tmp___12~0 then 0 else 1); 1338#L730 assume 0 != init_~r142~0 % 256;init_~tmp___13~0 := 1; 1333#L741 init_~r143~0 := (if 0 == init_~tmp___13~0 then 0 else 1); 1450#L751 assume 0 != init_~r212~0 % 256;init_~tmp___14~0 := 1; 1448#L762 init_~r213~0 := (if 0 == init_~tmp___14~0 then 0 else 1); 1556#L772 assume 0 != init_~r232~0 % 256;init_~tmp___15~0 := 1; 1460#L783 init_~r233~0 := (if 0 == init_~tmp___15~0 then 0 else 1); 1456#L793 assume 0 != init_~r242~0 % 256;init_~tmp___16~0 := 1; 1327#L804 init_~r243~0 := (if 0 == init_~tmp___16~0 then 0 else 1); 1455#L814 assume 0 != init_~r312~0 % 256;init_~tmp___17~0 := 1; 1390#L825 init_~r313~0 := (if 0 == init_~tmp___17~0 then 0 else 1); 1386#L835 assume 0 != init_~r322~0 % 256;init_~tmp___18~0 := 1; 1382#L846 init_~r323~0 := (if 0 == init_~tmp___18~0 then 0 else 1); 1383#L856 assume 0 != init_~r342~0 % 256;init_~tmp___19~0 := 1; 1381#L867 init_~r343~0 := (if 0 == init_~tmp___19~0 then 0 else 1); 1540#L877 assume 0 != init_~r412~0 % 256;init_~tmp___20~0 := 1; 1485#L888 init_~r413~0 := (if 0 == init_~tmp___20~0 then 0 else 1); 1539#L898 assume 0 != init_~r422~0 % 256;init_~tmp___21~0 := 1; 1521#L909 init_~r423~0 := (if 0 == init_~tmp___21~0 then 0 else 1); 1519#L919 assume 0 != init_~r432~0 % 256;init_~tmp___22~0 := 1; 1362#L930 init_~r433~0 := (if 0 == init_~tmp___22~0 then 0 else 1); 1359#L940 assume !(~id1~0 != ~id2~0);init_~tmp___23~0 := 0; 1348#L940-1 init_#res := init_~tmp___23~0; 1366#L1109 main_#t~ret52 := init_#res;main_~i2~0 := main_#t~ret52;havoc main_#t~ret52;assume 0 != main_~i2~0;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~nomsg~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;main_~i2~0 := 0; 1604#L1246-2 [2019-11-16 00:33:30,945 INFO L793 eck$LassoCheckResult]: Loop: 1604#L1246-2 assume !!(main_~i2~0 < 8);havoc node1_#t~ite0, node1_#t~ite1, node1_#t~ite2; 1608#L151 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256); 1341#L153 assume !(0 != ~ep21~0 % 256); 1334#L153-1 assume !(0 != ~ep31~0 % 256); 1335#L160 assume !(0 != ~ep41~0 % 256); 1478#L167 assume !(2 == ~r1~0); 1308#L174 ~mode1~0 := 0; 1449#L151-2 havoc node2_#t~ite3, node2_#t~ite4, node2_#t~ite5; 1663#L204 assume !(0 != ~mode2~0 % 256); 1664#L236 assume !(~r2~0 < 3); 1652#L236-1 ~mode2~0 := 1; 1651#L204-2 havoc node3_#t~ite6, node3_#t~ite7, node3_#t~ite8; 1647#L257 assume !(0 != ~mode3~0 % 256); 1643#L289 assume !(~r3~0 < 3); 1636#L289-1 ~mode3~0 := 1; 1635#L257-2 havoc node4_#t~ite9, node4_#t~ite10, node4_#t~ite11; 1633#L310 assume !(0 != ~mode4~0 % 256); 1623#L342 assume !(~r4~0 < 3); 1619#L342-1 ~mode4~0 := 1; 1618#L310-2 ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 1617#L1117 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 1616#L1118 assume ~st1~0 + ~nl1~0 <= 1; 1614#L1119 assume ~st2~0 + ~nl2~0 <= 1; 1613#L1120 assume ~st3~0 + ~nl3~0 <= 1; 1612#L1121 assume ~st4~0 + ~nl4~0 <= 1; 1611#L1122 assume !(~r1~0 >= 3); 1609#L1125 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; 1610#L1126 assume ~r1~0 < 3; 1684#L1131 assume !(~r1~0 >= 3); 1587#L1135 assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0 + ~nl4~0; 1588#L1136 assume ~r1~0 < 3;check_~tmp~1 := 1; 1530#L1117-1 check_#res := check_~tmp~1; 1531#L1169 main_#t~ret53 := check_#res;main_~c1~0 := main_#t~ret53;havoc main_#t~ret53;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 1581#L1289 assume !(0 == assert_~arg % 256); 1582#L1284 main_#t~post54 := main_~i2~0;main_~i2~0 := 1 + main_#t~post54;havoc main_#t~post54; 1604#L1246-2 [2019-11-16 00:33:30,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:33:30,946 INFO L82 PathProgramCache]: Analyzing trace with hash 15531844, now seen corresponding path program 3 times [2019-11-16 00:33:30,946 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:33:30,947 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407944413] [2019-11-16 00:33:30,947 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:33:30,947 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:33:30,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:33:30,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:31,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:33:31,041 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407944413] [2019-11-16 00:33:31,042 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:33:31,042 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:33:31,042 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499484712] [2019-11-16 00:33:31,043 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:33:31,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:33:31,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1736333593, now seen corresponding path program 1 times [2019-11-16 00:33:31,044 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:33:31,044 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986308156] [2019-11-16 00:33:31,044 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:33:31,044 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:33:31,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:33:31,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:33:31,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:33:31,116 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:33:32,008 WARN L191 SmtUtils]: Spent 880.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 157 [2019-11-16 00:33:32,378 WARN L191 SmtUtils]: Spent 369.00 ms on a formula simplification that was a NOOP. DAG size: 157 [2019-11-16 00:33:32,392 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:33:32,393 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:33:32,393 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:33:32,394 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:33:32,394 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:33:32,394 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:33:32,394 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:33:32,395 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:33:32,395 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_floodmax.4.2.ufo.BOUNDED-8.pals.c_Iteration3_Loop [2019-11-16 00:33:32,395 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:33:32,395 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:33:32,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:32,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:32,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:32,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:32,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:32,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-11-16 00:33:32,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:32,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:32,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-11-16 00:33:32,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:32,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:32,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:32,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:32,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:32,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:32,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:32,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:32,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:32,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:32,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:32,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:32,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:32,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:32,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:32,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:32,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:32,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:32,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:32,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:32,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:32,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:32,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:32,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:32,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:32,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:32,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:32,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:33,368 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-11-16 00:33:33,878 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-11-16 00:33:33,936 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:33:33,937 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c41f7e4c-45c8-4992-bf07-55211aacfae0/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-11-16 00:33:33,955 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:33:33,955 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 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c41f7e4c-45c8-4992-bf07-55211aacfae0/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) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:33:33,984 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:33:33,985 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:33:34,164 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:33:34,166 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:33:34,167 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:33:34,167 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:33:34,167 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:33:34,167 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:33:34,167 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:33:34,167 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:33:34,167 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:33:34,168 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_floodmax.4.2.ufo.BOUNDED-8.pals.c_Iteration3_Loop [2019-11-16 00:33:34,168 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:33:34,168 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:33:34,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:34,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:34,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:34,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:34,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:34,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:34,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:34,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:34,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:34,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:34,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:34,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:34,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:34,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:34,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:34,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:34,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:34,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:34,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:34,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:34,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:34,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:34,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:34,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:34,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:34,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:34,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:34,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:34,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:34,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:34,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:34,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:34,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:34,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:34,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:34,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:34,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:33:34,764 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-11-16 00:33:34,992 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2019-11-16 00:33:35,343 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-11-16 00:33:35,544 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:33:35,550 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:33:35,552 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-11-16 00:33:35,554 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:33:35,555 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:33:35,555 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:33:35,556 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:33:35,556 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:33:35,559 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:33:35,559 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:33:35,563 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:33:35,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-11-16 00:33:35,564 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:33:35,565 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:33:35,565 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:33:35,565 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:33:35,568 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:33:35,568 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:33:35,570 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:33:35,570 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-11-16 00:33:35,571 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:33:35,571 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:33:35,572 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:33:35,572 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:33:35,572 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:33:35,573 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:33:35,573 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:33:35,573 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:33:35,574 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-11-16 00:33:35,575 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:33:35,575 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:33:35,575 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:33:35,575 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:33:35,576 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:33:35,576 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:33:35,576 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:33:35,577 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:33:35,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-11-16 00:33:35,578 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:33:35,578 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:33:35,579 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:33:35,579 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:33:35,579 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:33:35,579 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:33:35,580 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:33:35,580 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:33:35,581 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-11-16 00:33:35,582 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:33:35,582 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:33:35,582 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:33:35,582 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:33:35,582 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:33:35,583 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:33:35,583 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:33:35,584 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:33:35,585 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-11-16 00:33:35,586 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:33:35,586 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:33:35,586 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:33:35,586 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:33:35,587 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:33:35,587 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:33:35,588 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:33:35,588 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:33:35,589 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-11-16 00:33:35,590 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:33:35,590 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:33:35,590 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:33:35,590 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:33:35,592 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:33:35,593 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:33:35,595 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:33:35,596 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-11-16 00:33:35,597 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:33:35,597 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:33:35,597 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:33:35,597 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:33:35,598 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:33:35,598 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:33:35,599 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:33:35,601 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:33:35,602 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-11-16 00:33:35,603 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:33:35,603 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:33:35,603 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:33:35,603 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:33:35,605 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:33:35,605 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:33:35,608 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:33:35,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-11-16 00:33:35,610 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:33:35,610 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:33:35,610 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:33:35,610 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:33:35,611 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:33:35,611 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:33:35,611 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:33:35,612 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:33:35,613 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-11-16 00:33:35,614 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:33:35,614 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:33:35,614 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:33:35,615 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:33:35,615 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:33:35,615 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:33:35,616 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:33:35,616 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:33:35,617 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-11-16 00:33:35,618 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:33:35,618 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:33:35,618 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:33:35,618 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:33:35,620 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:33:35,620 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:33:35,623 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:33:35,624 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-11-16 00:33:35,625 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:33:35,625 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:33:35,626 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:33:35,626 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:33:35,626 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:33:35,627 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:33:35,627 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:33:35,628 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:33:35,629 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-11-16 00:33:35,629 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:33:35,630 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:33:35,630 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:33:35,631 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:33:35,631 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:33:35,638 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:33:35,638 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:33:35,644 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:33:35,645 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-11-16 00:33:35,646 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:33:35,646 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:33:35,646 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:33:35,646 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:33:35,647 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:33:35,647 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:33:35,648 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:33:35,649 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:33:35,649 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-11-16 00:33:35,650 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:33:35,650 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:33:35,650 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:33:35,651 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:33:35,651 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:33:35,651 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:33:35,652 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:33:35,653 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:33:35,653 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-11-16 00:33:35,654 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:33:35,654 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:33:35,655 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:33:35,655 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:33:35,655 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:33:35,655 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:33:35,656 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:33:35,657 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:33:35,657 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-11-16 00:33:35,658 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:33:35,659 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:33:35,659 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:33:35,659 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:33:35,659 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:33:35,660 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:33:35,660 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:33:35,662 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:33:35,662 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-11-16 00:33:35,663 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:33:35,663 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:33:35,663 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:33:35,664 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:33:35,664 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:33:35,664 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:33:35,665 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:33:35,666 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:33:35,666 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-11-16 00:33:35,667 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:33:35,667 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:33:35,668 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:33:35,668 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:33:35,669 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:33:35,670 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:33:35,673 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:33:35,674 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-11-16 00:33:35,675 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:33:35,675 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:33:35,675 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:33:35,675 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:33:35,676 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:33:35,676 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:33:35,677 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:33:35,679 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:33:35,680 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-11-16 00:33:35,681 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:33:35,681 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:33:35,681 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:33:35,681 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:33:35,682 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:33:35,682 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:33:35,683 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:33:35,685 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:33:35,689 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:33:35,689 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-16 00:33:35,691 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:33:35,692 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:33:35,692 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:33:35,693 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 15 Supporting invariants [] [2019-11-16 00:33:35,695 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:33:35,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:33:35,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:35,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:33:35,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:33:35,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:33:35,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:33:35,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:33:35,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:33:35,976 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-16 00:33:35,977 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 380 states and 659 transitions. cyclomatic complexity: 280 Second operand 3 states. [2019-11-16 00:33:36,075 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 380 states and 659 transitions. cyclomatic complexity: 280. Second operand 3 states. Result 569 states and 966 transitions. Complement of second has 4 states. [2019-11-16 00:33:36,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-16 00:33:36,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:33:36,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 526 transitions. [2019-11-16 00:33:36,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 526 transitions. Stem has 53 letters. Loop has 35 letters. [2019-11-16 00:33:36,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:33:36,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 526 transitions. Stem has 88 letters. Loop has 35 letters. [2019-11-16 00:33:36,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:33:36,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 526 transitions. Stem has 53 letters. Loop has 70 letters. [2019-11-16 00:33:36,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:33:36,086 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 569 states and 966 transitions. [2019-11-16 00:33:36,097 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:33:36,098 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 569 states to 0 states and 0 transitions. [2019-11-16 00:33:36,098 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-16 00:33:36,098 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-16 00:33:36,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-16 00:33:36,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:33:36,099 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:33:36,099 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:33:36,099 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:33:36,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:33:36,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:33:36,100 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 4 states. [2019-11-16 00:33:36,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:33:36,101 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-11-16 00:33:36,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-16 00:33:36,101 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-11-16 00:33:36,102 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:33:36,102 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-11-16 00:33:36,102 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-16 00:33:36,102 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-16 00:33:36,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-16 00:33:36,103 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:33:36,103 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:33:36,103 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:33:36,103 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:33:36,103 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-16 00:33:36,103 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:33:36,104 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:33:36,104 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-16 00:33:36,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 16.11 12:33:36 BoogieIcfgContainer [2019-11-16 00:33:36,112 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-16 00:33:36,113 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:33:36,113 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:33:36,113 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:33:36,114 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:33:29" (3/4) ... [2019-11-16 00:33:36,118 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-16 00:33:36,118 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:33:36,120 INFO L168 Benchmark]: Toolchain (without parser) took 9263.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 194.0 MB). Free memory was 950.1 MB in the beginning and 1.2 GB in the end (delta: -205.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:33:36,121 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:33:36,123 INFO L168 Benchmark]: CACSL2BoogieTranslator took 767.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -172.6 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2019-11-16 00:33:36,124 INFO L168 Benchmark]: Boogie Procedure Inliner took 95.56 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:33:36,125 INFO L168 Benchmark]: Boogie Preprocessor took 107.18 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:33:36,133 INFO L168 Benchmark]: RCFGBuilder took 1552.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 997.4 MB in the end (delta: 109.3 MB). Peak memory consumption was 109.3 MB. Max. memory is 11.5 GB. [2019-11-16 00:33:36,134 INFO L168 Benchmark]: BuchiAutomizer took 6730.21 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 59.2 MB). Free memory was 997.4 MB in the beginning and 1.2 GB in the end (delta: -158.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:33:36,134 INFO L168 Benchmark]: Witness Printer took 5.43 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:33:36,144 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.29 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 767.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -172.6 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 95.56 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 107.18 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1552.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 997.4 MB in the end (delta: 109.3 MB). Peak memory consumption was 109.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6730.21 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 59.2 MB). Free memory was 997.4 MB in the beginning and 1.2 GB in the end (delta: -158.2 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 5.43 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 15 and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.6s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 5.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 380 states and ocurred in iteration 2. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1585 SDtfs, 815 SDslu, 2279 SDs, 0 SdLazy, 36 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI2 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital225 mio100 ax121 hnf104 lsp25 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq229 hnf85 smp100 dnf100 smp100 tf101 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...