./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.2.ufo.BOUNDED-6.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_8a4bbc4d-37b9-48d9-a4b3-12eac1c5f796/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_8a4bbc4d-37b9-48d9-a4b3-12eac1c5f796/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8a4bbc4d-37b9-48d9-a4b3-12eac1c5f796/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8a4bbc4d-37b9-48d9-a4b3-12eac1c5f796/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c -s /tmp/vcloud-vcloud-master/worker/run_dir_8a4bbc4d-37b9-48d9-a4b3-12eac1c5f796/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8a4bbc4d-37b9-48d9-a4b3-12eac1c5f796/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 4e7975b17d935115e9ca07f323e5eabfbd25e139 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 20:46:50,697 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:46:50,698 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:46:50,711 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:46:50,712 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:46:50,712 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:46:50,714 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:46:50,716 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:46:50,718 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:46:50,726 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:46:50,727 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:46:50,728 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:46:50,728 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:46:50,729 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:46:50,730 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:46:50,731 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:46:50,731 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:46:50,732 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:46:50,733 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:46:50,735 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:46:50,736 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:46:50,737 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:46:50,743 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:46:50,743 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:46:50,749 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:46:50,751 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:46:50,752 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:46:50,753 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:46:50,754 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:46:50,755 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:46:50,756 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:46:50,756 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:46:50,757 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:46:50,758 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:46:50,761 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:46:50,761 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:46:50,762 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:46:50,762 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:46:50,763 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:46:50,765 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:46:50,765 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:46:50,766 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8a4bbc4d-37b9-48d9-a4b3-12eac1c5f796/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-15 20:46:50,795 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:46:50,795 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:46:50,798 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:46:50,798 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:46:50,799 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:46:50,799 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 20:46:50,799 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 20:46:50,799 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 20:46:50,800 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 20:46:50,800 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 20:46:50,800 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 20:46:50,800 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:46:50,800 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 20:46:50,801 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 20:46:50,801 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 20:46:50,801 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 20:46:50,801 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:46:50,801 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 20:46:50,801 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 20:46:50,802 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 20:46:50,802 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 20:46:50,802 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:46:50,802 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 20:46:50,802 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:46:50,803 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 20:46:50,803 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:46:50,803 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:46:50,803 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 20:46:50,804 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:46:50,804 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 20:46:50,804 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 20:46:50,805 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 20:46:50,805 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_8a4bbc4d-37b9-48d9-a4b3-12eac1c5f796/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 -> 4e7975b17d935115e9ca07f323e5eabfbd25e139 [2019-11-15 20:46:50,843 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:46:50,856 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:46:50,859 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:46:50,861 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:46:50,861 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:46:50,861 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8a4bbc4d-37b9-48d9-a4b3-12eac1c5f796/bin/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c [2019-11-15 20:46:50,917 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8a4bbc4d-37b9-48d9-a4b3-12eac1c5f796/bin/uautomizer/data/43e3b5dbd/18f8282b4f1e4dd3a67382a8c20da107/FLAGf193d11de [2019-11-15 20:46:51,357 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:46:51,357 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8a4bbc4d-37b9-48d9-a4b3-12eac1c5f796/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c [2019-11-15 20:46:51,373 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8a4bbc4d-37b9-48d9-a4b3-12eac1c5f796/bin/uautomizer/data/43e3b5dbd/18f8282b4f1e4dd3a67382a8c20da107/FLAGf193d11de [2019-11-15 20:46:51,756 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8a4bbc4d-37b9-48d9-a4b3-12eac1c5f796/bin/uautomizer/data/43e3b5dbd/18f8282b4f1e4dd3a67382a8c20da107 [2019-11-15 20:46:51,759 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:46:51,760 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:46:51,766 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:46:51,767 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:46:51,770 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:46:51,771 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:46:51" (1/1) ... [2019-11-15 20:46:51,779 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79338882 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:46:51, skipping insertion in model container [2019-11-15 20:46:51,779 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:46:51" (1/1) ... [2019-11-15 20:46:51,784 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:46:51,816 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:46:52,089 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:46:52,098 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:46:52,153 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:46:52,170 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:46:52,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:46:52 WrapperNode [2019-11-15 20:46:52,171 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:46:52,171 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:46:52,172 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:46:52,172 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:46:52,180 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:46:52" (1/1) ... [2019-11-15 20:46:52,191 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:46:52" (1/1) ... [2019-11-15 20:46:52,224 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:46:52,225 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:46:52,225 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:46:52,225 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:46:52,239 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:46:52" (1/1) ... [2019-11-15 20:46:52,239 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:46:52" (1/1) ... [2019-11-15 20:46:52,244 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:46:52" (1/1) ... [2019-11-15 20:46:52,244 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:46:52" (1/1) ... [2019-11-15 20:46:52,266 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:46:52" (1/1) ... [2019-11-15 20:46:52,288 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:46:52" (1/1) ... [2019-11-15 20:46:52,291 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:46:52" (1/1) ... [2019-11-15 20:46:52,296 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:46:52,296 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:46:52,296 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:46:52,297 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:46:52,297 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:46:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8a4bbc4d-37b9-48d9-a4b3-12eac1c5f796/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-15 20:46:52,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:46:52,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:46:53,218 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:46:53,218 INFO L284 CfgBuilder]: Removed 17 assume(true) statements. [2019-11-15 20:46:53,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:46:53 BoogieIcfgContainer [2019-11-15 20:46:53,219 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:46:53,220 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 20:46:53,220 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 20:46:53,223 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 20:46:53,224 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:46:53,224 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 08:46:51" (1/3) ... [2019-11-15 20:46:53,225 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3397a7df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 08:46:53, skipping insertion in model container [2019-11-15 20:46:53,225 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:46:53,226 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:46:52" (2/3) ... [2019-11-15 20:46:53,226 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3397a7df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 08:46:53, skipping insertion in model container [2019-11-15 20:46:53,226 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:46:53,226 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:46:53" (3/3) ... [2019-11-15 20:46:53,228 INFO L371 chiAutomizerObserver]: Analyzing ICFG pals_floodmax.3.2.ufo.BOUNDED-6.pals.c [2019-11-15 20:46:53,267 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 20:46:53,268 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 20:46:53,268 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 20:46:53,268 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:46:53,268 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:46:53,268 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 20:46:53,268 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:46:53,268 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 20:46:53,288 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 128 states. [2019-11-15 20:46:53,315 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2019-11-15 20:46:53,315 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:46:53,315 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:46:53,323 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:46:53,324 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:46:53,324 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 20:46:53,324 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 128 states. [2019-11-15 20:46:53,333 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2019-11-15 20:46:53,333 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:46:53,333 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:46:53,335 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:46:53,335 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:46:53,343 INFO L791 eck$LassoCheckResult]: Stem: 89#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;~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;~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;~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;~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]; 13#L-1true havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, 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~ret33, main_#t~ret34, main_#t~post35, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet6;havoc main_#t~nondet6;~ep13~0 := main_#t~nondet7;havoc main_#t~nondet7;~ep21~0 := main_#t~nondet8;havoc main_#t~nondet8;~ep23~0 := main_#t~nondet9;havoc main_#t~nondet9;~ep31~0 := main_#t~nondet10;havoc main_#t~nondet10;~ep32~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~r1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~nl1~0 := main_#t~nondet15;havoc main_#t~nondet15;~m1~0 := main_#t~nondet16;havoc main_#t~nondet16;~max1~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode1~0 := main_#t~nondet18;havoc main_#t~nondet18;~id2~0 := main_#t~nondet19;havoc main_#t~nondet19;~r2~0 := main_#t~nondet20;havoc main_#t~nondet20;~st2~0 := main_#t~nondet21;havoc main_#t~nondet21;~nl2~0 := main_#t~nondet22;havoc main_#t~nondet22;~m2~0 := main_#t~nondet23;havoc main_#t~nondet23;~max2~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode2~0 := main_#t~nondet25;havoc main_#t~nondet25;~id3~0 := main_#t~nondet26;havoc main_#t~nondet26;~r3~0 := main_#t~nondet27;havoc main_#t~nondet27;~st3~0 := main_#t~nondet28;havoc main_#t~nondet28;~nl3~0 := main_#t~nondet29;havoc main_#t~nondet29;~m3~0 := main_#t~nondet30;havoc main_#t~nondet30;~max3~0 := main_#t~nondet31;havoc main_#t~nondet31;~mode3~0 := main_#t~nondet32;havoc main_#t~nondet32;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r211~0, init_~r231~0, init_~r311~0, init_~r321~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r212~0, init_~tmp___1~0, init_~r232~0, init_~tmp___2~0, init_~r312~0, init_~tmp___3~0, init_~r322~0, init_~tmp___4~0, init_~tmp___5~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r212~0;havoc init_~tmp___1~0;havoc init_~r232~0;havoc init_~tmp___2~0;havoc init_~r312~0;havoc init_~tmp___3~0;havoc init_~r322~0;havoc init_~tmp___4~0;havoc init_~tmp___5~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0; 11#L274true assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; 125#L277-1true init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); 57#L287true assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; 46#L290-1true init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); 91#L300true assume 0 != init_~r211~0 % 256;init_~tmp___1~0 := 1; 81#L303-1true init_~r212~0 := (if 0 == init_~tmp___1~0 then 0 else 1); 112#L313true assume 0 != init_~r231~0 % 256;init_~tmp___2~0 := 1; 109#L316-1true init_~r232~0 := (if 0 == init_~tmp___2~0 then 0 else 1); 34#L326true assume 0 != init_~r311~0 % 256;init_~tmp___3~0 := 1; 16#L329-1true init_~r312~0 := (if 0 == init_~tmp___3~0 then 0 else 1); 60#L339true assume 0 != init_~r321~0 % 256;init_~tmp___4~0 := 1; 56#L342-1true init_~r322~0 := (if 0 == init_~tmp___4~0 then 0 else 1); 99#L352true assume !(~id1~0 != ~id2~0);init_~tmp___5~0 := 0; 102#L352-1true init_#res := init_~tmp___5~0; 21#L461true main_#t~ret33 := init_#res;main_~i2~0 := main_#t~ret33;havoc main_#t~ret33;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;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0 := 0; 116#L569-2true [2019-11-15 20:46:53,344 INFO L793 eck$LassoCheckResult]: Loop: 116#L569-2true assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_#t~ite1; 19#L120true assume !(0 != ~mode1~0 % 256); 115#L145true assume !(~r1~0 < 2); 113#L145-1true ~mode1~0 := 1; 17#L120-2true havoc node2_#t~ite2, node2_#t~ite3; 63#L163true assume !(0 != ~mode2~0 % 256); 41#L188true assume !(~r2~0 < 2); 39#L188-1true ~mode2~0 := 1; 62#L163-2true havoc node3_#t~ite4, node3_#t~ite5; 110#L206true assume !(0 != ~mode3~0 % 256); 87#L231true assume !(~r3~0 < 2); 86#L231-1true ~mode3~0 := 1; 107#L206-2true ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_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;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 44#L469true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 29#L469-1true check_#res := check_~tmp~1; 111#L517true main_#t~ret34 := check_#res;main_~c1~0 := main_#t~ret34;havoc main_#t~ret34;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 10#L599true assume !(0 == assert_~arg % 256); 106#L594true main_#t~post35 := main_~i2~0;main_~i2~0 := 1 + main_#t~post35;havoc main_#t~post35; 116#L569-2true [2019-11-15 20:46:53,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:53,348 INFO L82 PathProgramCache]: Analyzing trace with hash -2018311820, now seen corresponding path program 1 times [2019-11-15 20:46:53,354 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:46:53,354 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028036724] [2019-11-15 20:46:53,355 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:53,355 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:53,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:46:53,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:53,562 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-15 20:46:53,563 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028036724] [2019-11-15 20:46:53,563 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:46:53,563 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:46:53,564 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980800295] [2019-11-15 20:46:53,567 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 20:46:53,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:53,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1684923087, now seen corresponding path program 1 times [2019-11-15 20:46:53,567 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:46:53,567 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281727679] [2019-11-15 20:46:53,568 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:53,568 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:53,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:46:53,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:53,685 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-15 20:46:53,685 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281727679] [2019-11-15 20:46:53,686 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:46:53,686 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:46:53,686 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552396930] [2019-11-15 20:46:53,687 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 20:46:53,688 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:46:53,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:46:53,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:46:53,703 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 4 states. [2019-11-15 20:46:53,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:46:53,797 INFO L93 Difference]: Finished difference Result 130 states and 222 transitions. [2019-11-15 20:46:53,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:46:53,799 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 130 states and 222 transitions. [2019-11-15 20:46:53,805 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2019-11-15 20:46:53,811 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 130 states to 123 states and 189 transitions. [2019-11-15 20:46:53,813 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 123 [2019-11-15 20:46:53,814 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 123 [2019-11-15 20:46:53,814 INFO L73 IsDeterministic]: Start isDeterministic. Operand 123 states and 189 transitions. [2019-11-15 20:46:53,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:46:53,815 INFO L688 BuchiCegarLoop]: Abstraction has 123 states and 189 transitions. [2019-11-15 20:46:53,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states and 189 transitions. [2019-11-15 20:46:53,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2019-11-15 20:46:53,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-11-15 20:46:53,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 189 transitions. [2019-11-15 20:46:53,849 INFO L711 BuchiCegarLoop]: Abstraction has 123 states and 189 transitions. [2019-11-15 20:46:53,849 INFO L591 BuchiCegarLoop]: Abstraction has 123 states and 189 transitions. [2019-11-15 20:46:53,849 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 20:46:53,849 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 123 states and 189 transitions. [2019-11-15 20:46:53,852 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2019-11-15 20:46:53,852 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:46:53,852 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:46:53,854 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] [2019-11-15 20:46:53,854 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:46:53,855 INFO L791 eck$LassoCheckResult]: Stem: 390#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;~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;~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;~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;~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]; 295#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, 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~ret33, main_#t~ret34, main_#t~post35, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet6;havoc main_#t~nondet6;~ep13~0 := main_#t~nondet7;havoc main_#t~nondet7;~ep21~0 := main_#t~nondet8;havoc main_#t~nondet8;~ep23~0 := main_#t~nondet9;havoc main_#t~nondet9;~ep31~0 := main_#t~nondet10;havoc main_#t~nondet10;~ep32~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~r1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~nl1~0 := main_#t~nondet15;havoc main_#t~nondet15;~m1~0 := main_#t~nondet16;havoc main_#t~nondet16;~max1~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode1~0 := main_#t~nondet18;havoc main_#t~nondet18;~id2~0 := main_#t~nondet19;havoc main_#t~nondet19;~r2~0 := main_#t~nondet20;havoc main_#t~nondet20;~st2~0 := main_#t~nondet21;havoc main_#t~nondet21;~nl2~0 := main_#t~nondet22;havoc main_#t~nondet22;~m2~0 := main_#t~nondet23;havoc main_#t~nondet23;~max2~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode2~0 := main_#t~nondet25;havoc main_#t~nondet25;~id3~0 := main_#t~nondet26;havoc main_#t~nondet26;~r3~0 := main_#t~nondet27;havoc main_#t~nondet27;~st3~0 := main_#t~nondet28;havoc main_#t~nondet28;~nl3~0 := main_#t~nondet29;havoc main_#t~nondet29;~m3~0 := main_#t~nondet30;havoc main_#t~nondet30;~max3~0 := main_#t~nondet31;havoc main_#t~nondet31;~mode3~0 := main_#t~nondet32;havoc main_#t~nondet32;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r211~0, init_~r231~0, init_~r311~0, init_~r321~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r212~0, init_~tmp___1~0, init_~r232~0, init_~tmp___2~0, init_~r312~0, init_~tmp___3~0, init_~r322~0, init_~tmp___4~0, init_~tmp___5~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r212~0;havoc init_~tmp___1~0;havoc init_~r232~0;havoc init_~tmp___2~0;havoc init_~r312~0;havoc init_~tmp___3~0;havoc init_~r322~0;havoc init_~tmp___4~0;havoc init_~tmp___5~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0; 290#L274 assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; 291#L277-1 init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); 366#L287 assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; 351#L290-1 init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); 352#L300 assume 0 != init_~r211~0 % 256;init_~tmp___1~0 := 1; 333#L303-1 init_~r212~0 := (if 0 == init_~tmp___1~0 then 0 else 1); 387#L313 assume 0 != init_~r231~0 % 256;init_~tmp___2~0 := 1; 370#L316-1 init_~r232~0 := (if 0 == init_~tmp___2~0 then 0 else 1); 331#L326 assume 0 != init_~r311~0 % 256;init_~tmp___3~0 := 1; 298#L329-1 init_~r312~0 := (if 0 == init_~tmp___3~0 then 0 else 1); 300#L339 assume 0 != init_~r321~0 % 256;init_~tmp___4~0 := 1; 289#L342-1 init_~r322~0 := (if 0 == init_~tmp___4~0 then 0 else 1); 365#L352 assume ~id1~0 != ~id2~0; 363#L353 assume ~id1~0 != ~id3~0; 284#L354 assume ~id2~0 != ~id3~0; 285#L355 assume ~id1~0 >= 0; 334#L356 assume ~id2~0 >= 0; 335#L357 assume ~id3~0 >= 0; 386#L358 assume 0 == ~r1~0; 329#L359 assume 0 == ~r2~0; 330#L360 assume 0 == ~r3~0; 368#L361 assume 0 != init_~r122~0 % 256; 321#L362 assume 0 != init_~r132~0 % 256; 322#L363 assume 0 != init_~r212~0 % 256; 362#L364 assume 0 != init_~r232~0 % 256; 282#L365 assume 0 != init_~r312~0 % 256; 283#L366 assume 0 != init_~r322~0 % 256; 359#L367 assume ~max1~0 == ~id1~0; 360#L368 assume ~max2~0 == ~id2~0; 385#L369 assume ~max3~0 == ~id3~0; 327#L370 assume 0 == ~st1~0; 328#L371 assume 0 == ~st2~0; 367#L372 assume 0 == ~st3~0; 319#L373 assume 0 == ~nl1~0; 320#L374 assume 0 == ~nl2~0; 361#L375 assume 0 == ~nl3~0; 280#L376 assume 0 == ~mode1~0 % 256; 281#L377 assume 0 == ~mode2~0 % 256; 355#L378 assume 0 == ~mode3~0 % 256;init_~tmp___5~0 := 1; 356#L352-1 init_#res := init_~tmp___5~0; 311#L461 main_#t~ret33 := init_#res;main_~i2~0 := main_#t~ret33;havoc main_#t~ret33;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;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0 := 0; 312#L569-2 [2019-11-15 20:46:53,855 INFO L793 eck$LassoCheckResult]: Loop: 312#L569-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_#t~ite1; 306#L120 assume !(0 != ~mode1~0 % 256); 307#L145 assume !(~r1~0 < 2); 294#L145-1 ~mode1~0 := 1; 301#L120-2 havoc node2_#t~ite2, node2_#t~ite3; 302#L163 assume !(0 != ~mode2~0 % 256); 341#L188 assume !(~r2~0 < 2); 336#L188-1 ~mode2~0 := 1; 337#L163-2 havoc node3_#t~ite4, node3_#t~ite5; 371#L206 assume !(0 != ~mode3~0 % 256); 389#L231 assume !(~r3~0 < 2); 340#L231-1 ~mode3~0 := 1; 388#L206-2 ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_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;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 346#L469 assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 304#L469-1 check_#res := check_~tmp~1; 325#L517 main_#t~ret34 := check_#res;main_~c1~0 := main_#t~ret34;havoc main_#t~ret34;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 286#L599 assume !(0 == assert_~arg % 256); 287#L594 main_#t~post35 := main_~i2~0;main_~i2~0 := 1 + main_#t~post35;havoc main_#t~post35; 312#L569-2 [2019-11-15 20:46:53,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:53,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1251496387, now seen corresponding path program 1 times [2019-11-15 20:46:53,856 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:46:53,856 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414150367] [2019-11-15 20:46:53,856 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:53,856 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:53,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:46:53,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:46:53,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:46:54,030 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:46:54,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:54,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1684923087, now seen corresponding path program 2 times [2019-11-15 20:46:54,031 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:46:54,031 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601539722] [2019-11-15 20:46:54,032 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:54,032 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:54,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:46:54,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:54,109 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-15 20:46:54,109 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601539722] [2019-11-15 20:46:54,109 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:46:54,110 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:46:54,110 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134681938] [2019-11-15 20:46:54,110 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 20:46:54,110 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:46:54,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:46:54,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:46:54,111 INFO L87 Difference]: Start difference. First operand 123 states and 189 transitions. cyclomatic complexity: 67 Second operand 5 states. [2019-11-15 20:46:54,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:46:54,192 INFO L93 Difference]: Finished difference Result 126 states and 191 transitions. [2019-11-15 20:46:54,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:46:54,193 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 126 states and 191 transitions. [2019-11-15 20:46:54,195 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2019-11-15 20:46:54,197 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 126 states to 123 states and 181 transitions. [2019-11-15 20:46:54,198 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 123 [2019-11-15 20:46:54,198 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 123 [2019-11-15 20:46:54,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 123 states and 181 transitions. [2019-11-15 20:46:54,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:46:54,199 INFO L688 BuchiCegarLoop]: Abstraction has 123 states and 181 transitions. [2019-11-15 20:46:54,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states and 181 transitions. [2019-11-15 20:46:54,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2019-11-15 20:46:54,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-11-15 20:46:54,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 181 transitions. [2019-11-15 20:46:54,208 INFO L711 BuchiCegarLoop]: Abstraction has 123 states and 181 transitions. [2019-11-15 20:46:54,208 INFO L591 BuchiCegarLoop]: Abstraction has 123 states and 181 transitions. [2019-11-15 20:46:54,208 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 20:46:54,208 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 123 states and 181 transitions. [2019-11-15 20:46:54,209 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2019-11-15 20:46:54,210 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:46:54,210 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:46:54,212 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] [2019-11-15 20:46:54,212 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] [2019-11-15 20:46:54,212 INFO L791 eck$LassoCheckResult]: Stem: 651#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;~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;~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;~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;~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]; 556#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, 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~ret33, main_#t~ret34, main_#t~post35, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet6;havoc main_#t~nondet6;~ep13~0 := main_#t~nondet7;havoc main_#t~nondet7;~ep21~0 := main_#t~nondet8;havoc main_#t~nondet8;~ep23~0 := main_#t~nondet9;havoc main_#t~nondet9;~ep31~0 := main_#t~nondet10;havoc main_#t~nondet10;~ep32~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~r1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~nl1~0 := main_#t~nondet15;havoc main_#t~nondet15;~m1~0 := main_#t~nondet16;havoc main_#t~nondet16;~max1~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode1~0 := main_#t~nondet18;havoc main_#t~nondet18;~id2~0 := main_#t~nondet19;havoc main_#t~nondet19;~r2~0 := main_#t~nondet20;havoc main_#t~nondet20;~st2~0 := main_#t~nondet21;havoc main_#t~nondet21;~nl2~0 := main_#t~nondet22;havoc main_#t~nondet22;~m2~0 := main_#t~nondet23;havoc main_#t~nondet23;~max2~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode2~0 := main_#t~nondet25;havoc main_#t~nondet25;~id3~0 := main_#t~nondet26;havoc main_#t~nondet26;~r3~0 := main_#t~nondet27;havoc main_#t~nondet27;~st3~0 := main_#t~nondet28;havoc main_#t~nondet28;~nl3~0 := main_#t~nondet29;havoc main_#t~nondet29;~m3~0 := main_#t~nondet30;havoc main_#t~nondet30;~max3~0 := main_#t~nondet31;havoc main_#t~nondet31;~mode3~0 := main_#t~nondet32;havoc main_#t~nondet32;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r211~0, init_~r231~0, init_~r311~0, init_~r321~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r212~0, init_~tmp___1~0, init_~r232~0, init_~tmp___2~0, init_~r312~0, init_~tmp___3~0, init_~r322~0, init_~tmp___4~0, init_~tmp___5~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r212~0;havoc init_~tmp___1~0;havoc init_~r232~0;havoc init_~tmp___2~0;havoc init_~r312~0;havoc init_~tmp___3~0;havoc init_~r322~0;havoc init_~tmp___4~0;havoc init_~tmp___5~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0; 551#L274 assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; 552#L277-1 init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); 627#L287 assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; 612#L290-1 init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); 613#L300 assume 0 != init_~r211~0 % 256;init_~tmp___1~0 := 1; 594#L303-1 init_~r212~0 := (if 0 == init_~tmp___1~0 then 0 else 1); 648#L313 assume 0 != init_~r231~0 % 256;init_~tmp___2~0 := 1; 631#L316-1 init_~r232~0 := (if 0 == init_~tmp___2~0 then 0 else 1); 592#L326 assume 0 != init_~r311~0 % 256;init_~tmp___3~0 := 1; 559#L329-1 init_~r312~0 := (if 0 == init_~tmp___3~0 then 0 else 1); 561#L339 assume 0 != init_~r321~0 % 256;init_~tmp___4~0 := 1; 550#L342-1 init_~r322~0 := (if 0 == init_~tmp___4~0 then 0 else 1); 626#L352 assume ~id1~0 != ~id2~0; 624#L353 assume ~id1~0 != ~id3~0; 545#L354 assume ~id2~0 != ~id3~0; 546#L355 assume ~id1~0 >= 0; 595#L356 assume ~id2~0 >= 0; 596#L357 assume ~id3~0 >= 0; 647#L358 assume 0 == ~r1~0; 590#L359 assume 0 == ~r2~0; 591#L360 assume 0 == ~r3~0; 629#L361 assume 0 != init_~r122~0 % 256; 581#L362 assume 0 != init_~r132~0 % 256; 582#L363 assume 0 != init_~r212~0 % 256; 623#L364 assume 0 != init_~r232~0 % 256; 543#L365 assume 0 != init_~r312~0 % 256; 544#L366 assume 0 != init_~r322~0 % 256; 620#L367 assume ~max1~0 == ~id1~0; 621#L368 assume ~max2~0 == ~id2~0; 646#L369 assume ~max3~0 == ~id3~0; 588#L370 assume 0 == ~st1~0; 589#L371 assume 0 == ~st2~0; 628#L372 assume 0 == ~st3~0; 579#L373 assume 0 == ~nl1~0; 580#L374 assume 0 == ~nl2~0; 622#L375 assume 0 == ~nl3~0; 541#L376 assume 0 == ~mode1~0 % 256; 542#L377 assume 0 == ~mode2~0 % 256; 616#L378 assume 0 == ~mode3~0 % 256;init_~tmp___5~0 := 1; 617#L352-1 init_#res := init_~tmp___5~0; 571#L461 main_#t~ret33 := init_#res;main_~i2~0 := main_#t~ret33;havoc main_#t~ret33;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;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0 := 0; 572#L569-2 [2019-11-15 20:46:54,212 INFO L793 eck$LassoCheckResult]: Loop: 572#L569-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_#t~ite1; 566#L120 assume !(0 != ~mode1~0 % 256); 567#L145 assume !(~r1~0 < 2); 555#L145-1 ~mode1~0 := 1; 562#L120-2 havoc node2_#t~ite2, node2_#t~ite3; 563#L163 assume !(0 != ~mode2~0 % 256); 602#L188 assume !(~r2~0 < 2); 597#L188-1 ~mode2~0 := 1; 598#L163-2 havoc node3_#t~ite4, node3_#t~ite5; 632#L206 assume !(0 != ~mode3~0 % 256); 650#L231 assume !(~r3~0 < 2); 601#L231-1 ~mode3~0 := 1; 649#L206-2 ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_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;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 607#L469 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 608#L470 assume ~st1~0 + ~nl1~0 <= 1; 635#L471 assume ~st2~0 + ~nl2~0 <= 1; 569#L472 assume ~st3~0 + ~nl3~0 <= 1; 570#L473 assume ~r1~0 >= 2; 609#L477 assume ~r1~0 < 2; 611#L482 assume ~r1~0 >= 2; 565#L487 assume ~r1~0 < 2;check_~tmp~1 := 1; 585#L469-1 check_#res := check_~tmp~1; 586#L517 main_#t~ret34 := check_#res;main_~c1~0 := main_#t~ret34;havoc main_#t~ret34;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 547#L599 assume !(0 == assert_~arg % 256); 548#L594 main_#t~post35 := main_~i2~0;main_~i2~0 := 1 + main_#t~post35;havoc main_#t~post35; 572#L569-2 [2019-11-15 20:46:54,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:54,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1251496387, now seen corresponding path program 2 times [2019-11-15 20:46:54,213 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:46:54,213 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142192841] [2019-11-15 20:46:54,213 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:54,213 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:54,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:46:54,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:46:54,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:46:54,302 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:46:54,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:54,303 INFO L82 PathProgramCache]: Analyzing trace with hash -807435907, now seen corresponding path program 1 times [2019-11-15 20:46:54,303 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:46:54,303 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506659964] [2019-11-15 20:46:54,304 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:54,304 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:54,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:46:54,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:54,341 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-15 20:46:54,342 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506659964] [2019-11-15 20:46:54,342 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:46:54,342 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:46:54,342 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018187559] [2019-11-15 20:46:54,343 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 20:46:54,343 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:46:54,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:46:54,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:46:54,344 INFO L87 Difference]: Start difference. First operand 123 states and 181 transitions. cyclomatic complexity: 59 Second operand 3 states. [2019-11-15 20:46:54,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:46:54,403 INFO L93 Difference]: Finished difference Result 174 states and 257 transitions. [2019-11-15 20:46:54,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:46:54,404 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 174 states and 257 transitions. [2019-11-15 20:46:54,406 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 119 [2019-11-15 20:46:54,408 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 174 states to 174 states and 257 transitions. [2019-11-15 20:46:54,408 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 174 [2019-11-15 20:46:54,409 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 174 [2019-11-15 20:46:54,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 174 states and 257 transitions. [2019-11-15 20:46:54,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:46:54,410 INFO L688 BuchiCegarLoop]: Abstraction has 174 states and 257 transitions. [2019-11-15 20:46:54,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states and 257 transitions. [2019-11-15 20:46:54,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2019-11-15 20:46:54,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-11-15 20:46:54,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 257 transitions. [2019-11-15 20:46:54,420 INFO L711 BuchiCegarLoop]: Abstraction has 174 states and 257 transitions. [2019-11-15 20:46:54,420 INFO L591 BuchiCegarLoop]: Abstraction has 174 states and 257 transitions. [2019-11-15 20:46:54,420 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 20:46:54,420 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 174 states and 257 transitions. [2019-11-15 20:46:54,422 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 119 [2019-11-15 20:46:54,422 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:46:54,422 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:46:54,424 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] [2019-11-15 20:46:54,424 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] [2019-11-15 20:46:54,424 INFO L791 eck$LassoCheckResult]: Stem: 956#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;~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;~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;~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;~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]; 859#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, 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~ret33, main_#t~ret34, main_#t~post35, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet6;havoc main_#t~nondet6;~ep13~0 := main_#t~nondet7;havoc main_#t~nondet7;~ep21~0 := main_#t~nondet8;havoc main_#t~nondet8;~ep23~0 := main_#t~nondet9;havoc main_#t~nondet9;~ep31~0 := main_#t~nondet10;havoc main_#t~nondet10;~ep32~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~r1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~nl1~0 := main_#t~nondet15;havoc main_#t~nondet15;~m1~0 := main_#t~nondet16;havoc main_#t~nondet16;~max1~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode1~0 := main_#t~nondet18;havoc main_#t~nondet18;~id2~0 := main_#t~nondet19;havoc main_#t~nondet19;~r2~0 := main_#t~nondet20;havoc main_#t~nondet20;~st2~0 := main_#t~nondet21;havoc main_#t~nondet21;~nl2~0 := main_#t~nondet22;havoc main_#t~nondet22;~m2~0 := main_#t~nondet23;havoc main_#t~nondet23;~max2~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode2~0 := main_#t~nondet25;havoc main_#t~nondet25;~id3~0 := main_#t~nondet26;havoc main_#t~nondet26;~r3~0 := main_#t~nondet27;havoc main_#t~nondet27;~st3~0 := main_#t~nondet28;havoc main_#t~nondet28;~nl3~0 := main_#t~nondet29;havoc main_#t~nondet29;~m3~0 := main_#t~nondet30;havoc main_#t~nondet30;~max3~0 := main_#t~nondet31;havoc main_#t~nondet31;~mode3~0 := main_#t~nondet32;havoc main_#t~nondet32;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r211~0, init_~r231~0, init_~r311~0, init_~r321~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r212~0, init_~tmp___1~0, init_~r232~0, init_~tmp___2~0, init_~r312~0, init_~tmp___3~0, init_~r322~0, init_~tmp___4~0, init_~tmp___5~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r212~0;havoc init_~tmp___1~0;havoc init_~r232~0;havoc init_~tmp___2~0;havoc init_~r312~0;havoc init_~tmp___3~0;havoc init_~r322~0;havoc init_~tmp___4~0;havoc init_~tmp___5~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0; 854#L274 assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; 855#L277-1 init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); 930#L287 assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; 915#L290-1 init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); 916#L300 assume 0 != init_~r211~0 % 256;init_~tmp___1~0 := 1; 898#L303-1 init_~r212~0 := (if 0 == init_~tmp___1~0 then 0 else 1); 953#L313 assume 0 != init_~r231~0 % 256;init_~tmp___2~0 := 1; 934#L316-1 init_~r232~0 := (if 0 == init_~tmp___2~0 then 0 else 1); 896#L326 assume 0 != init_~r311~0 % 256;init_~tmp___3~0 := 1; 862#L329-1 init_~r312~0 := (if 0 == init_~tmp___3~0 then 0 else 1); 864#L339 assume 0 != init_~r321~0 % 256;init_~tmp___4~0 := 1; 853#L342-1 init_~r322~0 := (if 0 == init_~tmp___4~0 then 0 else 1); 929#L352 assume ~id1~0 != ~id2~0; 927#L353 assume ~id1~0 != ~id3~0; 848#L354 assume ~id2~0 != ~id3~0; 849#L355 assume ~id1~0 >= 0; 899#L356 assume ~id2~0 >= 0; 900#L357 assume ~id3~0 >= 0; 952#L358 assume 0 == ~r1~0; 894#L359 assume 0 == ~r2~0; 895#L360 assume 0 == ~r3~0; 932#L361 assume 0 != init_~r122~0 % 256; 885#L362 assume 0 != init_~r132~0 % 256; 886#L363 assume 0 != init_~r212~0 % 256; 926#L364 assume 0 != init_~r232~0 % 256; 846#L365 assume 0 != init_~r312~0 % 256; 847#L366 assume 0 != init_~r322~0 % 256; 923#L367 assume ~max1~0 == ~id1~0; 924#L368 assume ~max2~0 == ~id2~0; 951#L369 assume ~max3~0 == ~id3~0; 892#L370 assume 0 == ~st1~0; 893#L371 assume 0 == ~st2~0; 931#L372 assume 0 == ~st3~0; 883#L373 assume 0 == ~nl1~0; 884#L374 assume 0 == ~nl2~0; 925#L375 assume 0 == ~nl3~0; 844#L376 assume 0 == ~mode1~0 % 256; 845#L377 assume 0 == ~mode2~0 % 256; 919#L378 assume 0 == ~mode3~0 % 256;init_~tmp___5~0 := 1; 920#L352-1 init_#res := init_~tmp___5~0; 874#L461 main_#t~ret33 := init_#res;main_~i2~0 := main_#t~ret33;havoc main_#t~ret33;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;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0 := 0; 875#L569-2 [2019-11-15 20:46:54,424 INFO L793 eck$LassoCheckResult]: Loop: 875#L569-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_#t~ite1; 967#L120 assume !(0 != ~mode1~0 % 256); 966#L145 assume ~r1~0 < 2; 943#L146 assume !(0 != ~ep12~0 % 256); 877#L146-2 assume !(0 != ~ep13~0 % 256); 858#L145-1 ~mode1~0 := 1; 881#L120-2 havoc node2_#t~ite2, node2_#t~ite3; 1006#L163 assume !(0 != ~mode2~0 % 256); 999#L188 assume !(~r2~0 < 2); 996#L188-1 ~mode2~0 := 1; 994#L163-2 havoc node3_#t~ite4, node3_#t~ite5; 993#L206 assume !(0 != ~mode3~0 % 256); 982#L231 assume !(~r3~0 < 2); 979#L231-1 ~mode3~0 := 1; 977#L206-2 ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_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;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 976#L469 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 975#L470 assume ~st1~0 + ~nl1~0 <= 1; 974#L471 assume ~st2~0 + ~nl2~0 <= 1; 973#L472 assume ~st3~0 + ~nl3~0 <= 1; 972#L473 assume !(~r1~0 >= 2); 957#L476 assume 0 == ~st1~0 + ~st2~0 + ~st3~0; 958#L477 assume ~r1~0 < 2; 965#L482 assume !(~r1~0 >= 2); 867#L486 assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; 868#L487 assume ~r1~0 < 2;check_~tmp~1 := 1; 971#L469-1 check_#res := check_~tmp~1; 970#L517 main_#t~ret34 := check_#res;main_~c1~0 := main_#t~ret34;havoc main_#t~ret34;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 969#L599 assume !(0 == assert_~arg % 256); 968#L594 main_#t~post35 := main_~i2~0;main_~i2~0 := 1 + main_#t~post35;havoc main_#t~post35; 875#L569-2 [2019-11-15 20:46:54,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:54,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1251496387, now seen corresponding path program 3 times [2019-11-15 20:46:54,425 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:46:54,425 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712021588] [2019-11-15 20:46:54,425 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:54,425 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:54,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:46:54,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:46:54,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:46:54,526 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:46:54,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:54,526 INFO L82 PathProgramCache]: Analyzing trace with hash -912533906, now seen corresponding path program 1 times [2019-11-15 20:46:54,526 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:46:54,527 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888835022] [2019-11-15 20:46:54,527 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:54,527 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:54,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:46:54,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:46:54,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:46:54,571 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:46:54,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:54,571 INFO L82 PathProgramCache]: Analyzing trace with hash -961338958, now seen corresponding path program 1 times [2019-11-15 20:46:54,572 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:46:54,572 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63702941] [2019-11-15 20:46:54,572 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:54,572 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:54,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:46:54,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:54,669 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-15 20:46:54,670 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63702941] [2019-11-15 20:46:54,671 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:46:54,671 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:46:54,671 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788171579] [2019-11-15 20:46:55,049 WARN L191 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 100 [2019-11-15 20:46:55,241 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-11-15 20:46:55,252 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:46:55,252 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:46:55,252 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:46:55,253 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:46:55,253 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 20:46:55,253 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:46:55,253 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:46:55,253 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:46:55,253 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_floodmax.3.2.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2019-11-15 20:46:55,253 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:46:55,254 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:46:55,278 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-15 20:46:55,285 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-15 20:46:55,291 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-15 20:46:55,295 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-15 20:46:55,312 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-15 20:46:55,314 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-15 20:46:55,318 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-15 20:46:55,320 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-15 20:46:55,326 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-15 20:46:55,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-15 20:46:55,332 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-15 20:46:55,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-15 20:46:55,337 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-15 20:46:55,339 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-15 20:46:55,341 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-15 20:46:55,347 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-15 20:46:55,353 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-15 20:46:55,356 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-15 20:46:55,385 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-15 20:46:55,387 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-15 20:46:55,390 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-15 20:46:55,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-15 20:46:55,394 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-15 20:46:55,397 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-15 20:46:55,400 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-15 20:46:55,412 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-15 20:46:56,004 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:46:56,005 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8a4bbc4d-37b9-48d9-a4b3-12eac1c5f796/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-15 20:46:56,021 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:46:56,021 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:46:56,033 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 20:46:56,033 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~ep12~0=-256} Honda state: {~ep12~0=-256} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8a4bbc4d-37b9-48d9-a4b3-12eac1c5f796/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 20:46:56,041 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:46:56,042 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8a4bbc4d-37b9-48d9-a4b3-12eac1c5f796/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:46:56,059 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 20:46:56,059 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 20:46:56,212 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 20:46:56,214 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:46:56,214 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:46:56,214 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:46:56,214 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:46:56,214 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:46:56,214 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:46:56,214 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:46:56,214 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:46:56,214 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_floodmax.3.2.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2019-11-15 20:46:56,215 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:46:56,215 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:46:56,218 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-15 20:46:56,248 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-15 20:46:56,272 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-15 20:46:56,275 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-15 20:46:56,296 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-15 20:46:56,300 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-15 20:46:56,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-15 20:46:56,358 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-15 20:46:56,363 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-15 20:46:56,372 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-15 20:46:56,374 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-15 20:46:56,376 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-15 20:46:56,379 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-15 20:46:56,381 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-15 20:46:56,383 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-15 20:46:56,390 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-15 20:46:56,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-15 20:46:56,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-15 20:46:56,401 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-15 20:46:56,403 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-15 20:46:56,406 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-15 20:46:56,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-15 20:46:56,419 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-15 20:46:56,421 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-15 20:46:56,424 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-15 20:46:56,448 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-15 20:46:56,978 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:46:56,983 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:46:56,984 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-15 20:46:56,985 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:56,985 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:56,986 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:56,986 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:56,986 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:56,988 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:46:56,988 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:56,990 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:56,990 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-15 20:46:56,991 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:56,991 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:56,991 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:56,991 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:56,992 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:56,992 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:46:56,992 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:56,994 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:56,995 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-15 20:46:56,995 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:56,995 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:56,996 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:56,996 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:56,998 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:46:56,998 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:46:57,001 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:57,002 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-15 20:46:57,004 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:57,004 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:57,004 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:57,004 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:57,004 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:57,006 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:46:57,006 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:57,009 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:57,010 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-15 20:46:57,011 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:57,011 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:57,011 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:57,011 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:57,013 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:57,014 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:46:57,014 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:57,015 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:57,016 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-15 20:46:57,016 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:57,016 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:57,017 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:57,017 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:57,017 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:57,017 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:46:57,017 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:57,018 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:57,018 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-15 20:46:57,019 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:57,019 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:57,020 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:57,020 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:57,020 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:57,020 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:46:57,021 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:57,023 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:57,026 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-15 20:46:57,027 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:57,027 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:57,027 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:57,028 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:57,035 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:46:57,035 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:46:57,039 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:57,040 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-15 20:46:57,040 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:57,041 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:57,041 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:57,041 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:57,041 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:57,042 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:46:57,042 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:57,047 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:57,047 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-15 20:46:57,048 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:57,048 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:57,048 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:57,048 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:57,048 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:57,049 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:46:57,049 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:57,050 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:57,050 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-15 20:46:57,051 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:57,051 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:57,052 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:57,052 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:57,052 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:57,052 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:46:57,052 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:57,053 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:57,054 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-15 20:46:57,055 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:57,055 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:57,055 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:57,055 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:57,056 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:57,057 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:46:57,057 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:57,057 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:57,058 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-15 20:46:57,059 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:57,059 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:57,060 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:57,060 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:57,060 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:57,060 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:46:57,060 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:57,061 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:57,062 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-15 20:46:57,062 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:57,063 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:57,063 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:57,063 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:57,065 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:46:57,065 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:46:57,067 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:57,067 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:57,068 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:57,068 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:57,068 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:57,068 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:57,068 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:57,069 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:46:57,069 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:57,072 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:57,072 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-15 20:46:57,073 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:57,073 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:57,073 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:57,073 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:57,074 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:57,074 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:46:57,074 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:57,077 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:46:57,080 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 20:46:57,080 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-15 20:46:57,082 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:46:57,082 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 20:46:57,082 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:46:57,083 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 11 Supporting invariants [] [2019-11-15 20:46:57,085 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 20:46:57,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:57,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:57,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:46:57,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:46:57,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:57,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 20:46:57,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:46:57,274 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-15 20:46:57,279 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-15 20:46:57,280 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 174 states and 257 transitions. cyclomatic complexity: 84 Second operand 3 states. [2019-11-15 20:46:57,331 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 174 states and 257 transitions. cyclomatic complexity: 84. Second operand 3 states. Result 292 states and 441 transitions. Complement of second has 4 states. [2019-11-15 20:46:57,332 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-15 20:46:57,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 20:46:57,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 181 transitions. [2019-11-15 20:46:57,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 181 transitions. Stem has 43 letters. Loop has 29 letters. [2019-11-15 20:46:57,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:46:57,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 181 transitions. Stem has 72 letters. Loop has 29 letters. [2019-11-15 20:46:57,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:46:57,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 181 transitions. Stem has 43 letters. Loop has 58 letters. [2019-11-15 20:46:57,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:46:57,339 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 292 states and 441 transitions. [2019-11-15 20:46:57,342 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 20:46:57,342 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 292 states to 0 states and 0 transitions. [2019-11-15 20:46:57,342 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 20:46:57,342 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 20:46:57,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 20:46:57,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:46:57,343 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:46:57,343 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:46:57,343 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:46:57,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:46:57,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:46:57,344 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2019-11-15 20:46:57,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:46:57,344 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-11-15 20:46:57,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 20:46:57,344 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-11-15 20:46:57,345 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 20:46:57,345 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 20:46:57,345 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 20:46:57,345 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 20:46:57,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 20:46:57,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:46:57,346 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:46:57,346 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:46:57,346 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:46:57,346 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 20:46:57,346 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 20:46:57,346 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 20:46:57,346 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 20:46:57,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 08:46:57 BoogieIcfgContainer [2019-11-15 20:46:57,352 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 20:46:57,353 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 20:46:57,353 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 20:46:57,353 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 20:46:57,354 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:46:53" (3/4) ... [2019-11-15 20:46:57,359 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 20:46:57,359 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 20:46:57,360 INFO L168 Benchmark]: Toolchain (without parser) took 5599.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 190.3 MB). Free memory was 950.1 MB in the beginning and 1.2 GB in the end (delta: -224.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:46:57,361 INFO L168 Benchmark]: CDTParser took 0.19 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-15 20:46:57,362 INFO L168 Benchmark]: CACSL2BoogieTranslator took 404.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -181.2 MB). Peak memory consumption was 17.3 MB. Max. memory is 11.5 GB. [2019-11-15 20:46:57,363 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.93 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-15 20:46:57,363 INFO L168 Benchmark]: Boogie Preprocessor took 71.38 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:46:57,368 INFO L168 Benchmark]: RCFGBuilder took 923.10 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: 56.0 MB). Peak memory consumption was 56.0 MB. Max. memory is 11.5 GB. [2019-11-15 20:46:57,368 INFO L168 Benchmark]: BuchiAutomizer took 4132.72 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 54.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -110.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:46:57,369 INFO L168 Benchmark]: Witness Printer took 6.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2019-11-15 20:46:57,371 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.19 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 404.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -181.2 MB). Peak memory consumption was 17.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.93 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 71.38 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 923.10 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: 56.0 MB). Peak memory consumption was 56.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4132.72 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 54.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -110.3 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 6.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 24 B). Peak memory consumption was 24 B. 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 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 11 and consists of 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.0s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 3.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 174 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 765 SDtfs, 243 SDslu, 1227 SDs, 0 SdLazy, 40 SolverSat, 43 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital139 mio100 ax125 hnf105 lsp20 ukn100 mio100 lsp100 div123 bol100 ite100 ukn100 eq182 hnf86 smp100 dnf100 smp100 tf102 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 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...