./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.05-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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_7e64d7fc-8c06-45e8-ad59-2085af6b06b1/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_7e64d7fc-8c06-45e8-ad59-2085af6b06b1/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7e64d7fc-8c06-45e8-ad59-2085af6b06b1/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7e64d7fc-8c06-45e8-ad59-2085af6b06b1/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.05-alloca.i -s /tmp/vcloud-vcloud-master/worker/run_dir_7e64d7fc-8c06-45e8-ad59-2085af6b06b1/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7e64d7fc-8c06-45e8-ad59-2085af6b06b1/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 64bit --witnessprinter.graph.data.programhash f1e9ba7e316537618e1819aa49662575d0a5a8e7 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:15:20,654 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:15:20,655 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:15:20,666 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:15:20,667 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:15:20,667 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:15:20,669 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:15:20,671 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:15:20,672 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:15:20,673 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:15:20,674 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:15:20,675 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:15:20,675 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:15:20,676 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:15:20,677 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:15:20,682 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:15:20,683 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:15:20,684 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:15:20,686 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:15:20,688 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:15:20,689 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:15:20,690 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:15:20,691 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:15:20,692 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:15:20,694 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:15:20,695 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:15:20,695 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:15:20,696 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:15:20,696 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:15:20,697 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:15:20,697 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:15:20,698 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:15:20,699 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:15:20,699 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:15:20,700 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:15:20,700 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:15:20,701 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:15:20,701 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:15:20,701 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:15:20,702 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:15:20,703 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:15:20,704 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7e64d7fc-8c06-45e8-ad59-2085af6b06b1/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 20:15:20,722 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:15:20,722 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:15:20,723 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:15:20,723 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:15:20,723 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:15:20,724 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 20:15:20,724 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 20:15:20,724 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 20:15:20,724 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 20:15:20,725 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 20:15:20,725 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 20:15:20,725 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:15:20,725 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 20:15:20,725 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 20:15:20,726 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:15:20,726 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 20:15:20,726 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 20:15:20,726 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 20:15:20,726 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:15:20,727 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 20:15:20,727 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:15:20,727 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 20:15:20,727 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:15:20,728 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:15:20,728 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 20:15:20,728 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:15:20,728 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 20:15:20,729 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 20:15:20,729 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 20:15:20,730 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_7e64d7fc-8c06-45e8-ad59-2085af6b06b1/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f1e9ba7e316537618e1819aa49662575d0a5a8e7 [2019-11-15 20:15:20,773 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:15:20,782 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:15:20,785 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:15:20,786 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:15:20,786 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:15:20,787 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7e64d7fc-8c06-45e8-ad59-2085af6b06b1/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/b.05-alloca.i [2019-11-15 20:15:20,855 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7e64d7fc-8c06-45e8-ad59-2085af6b06b1/bin/uautomizer/data/81ca62bdb/fa066baca2bb496099c5142e9ee32d11/FLAG9c4865c47 [2019-11-15 20:15:21,270 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:15:21,271 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7e64d7fc-8c06-45e8-ad59-2085af6b06b1/sv-benchmarks/c/termination-memory-alloca/b.05-alloca.i [2019-11-15 20:15:21,282 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7e64d7fc-8c06-45e8-ad59-2085af6b06b1/bin/uautomizer/data/81ca62bdb/fa066baca2bb496099c5142e9ee32d11/FLAG9c4865c47 [2019-11-15 20:15:21,590 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7e64d7fc-8c06-45e8-ad59-2085af6b06b1/bin/uautomizer/data/81ca62bdb/fa066baca2bb496099c5142e9ee32d11 [2019-11-15 20:15:21,594 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:15:21,595 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:15:21,597 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:15:21,597 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:15:21,601 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:15:21,602 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:15:21" (1/1) ... [2019-11-15 20:15:21,605 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c77ca94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:15:21, skipping insertion in model container [2019-11-15 20:15:21,605 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:15:21" (1/1) ... [2019-11-15 20:15:21,613 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:15:21,660 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:15:22,013 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:15:22,023 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:15:22,060 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:15:22,104 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:15:22,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:15:22 WrapperNode [2019-11-15 20:15:22,105 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:15:22,105 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:15:22,105 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:15:22,106 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:15:22,113 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:15:22" (1/1) ... [2019-11-15 20:15:22,126 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:15:22" (1/1) ... [2019-11-15 20:15:22,147 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:15:22,148 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:15:22,148 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:15:22,148 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:15:22,157 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:15:22" (1/1) ... [2019-11-15 20:15:22,157 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:15:22" (1/1) ... [2019-11-15 20:15:22,160 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:15:22" (1/1) ... [2019-11-15 20:15:22,161 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:15:22" (1/1) ... [2019-11-15 20:15:22,166 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:15:22" (1/1) ... [2019-11-15 20:15:22,170 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:15:22" (1/1) ... [2019-11-15 20:15:22,172 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:15:22" (1/1) ... [2019-11-15 20:15:22,174 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:15:22,175 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:15:22,175 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:15:22,175 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:15:22,176 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:15:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7e64d7fc-8c06-45e8-ad59-2085af6b06b1/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:15:22,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 20:15:22,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 20:15:22,253 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 20:15:22,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 20:15:22,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:15:22,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:15:22,552 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:15:22,553 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 20:15:22,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:15:22 BoogieIcfgContainer [2019-11-15 20:15:22,554 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:15:22,555 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 20:15:22,555 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 20:15:22,558 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 20:15:22,560 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:15:22,560 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 08:15:21" (1/3) ... [2019-11-15 20:15:22,561 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@31a254c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 08:15:22, skipping insertion in model container [2019-11-15 20:15:22,561 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:15:22,561 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:15:22" (2/3) ... [2019-11-15 20:15:22,561 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@31a254c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 08:15:22, skipping insertion in model container [2019-11-15 20:15:22,562 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:15:22,562 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:15:22" (3/3) ... [2019-11-15 20:15:22,563 INFO L371 chiAutomizerObserver]: Analyzing ICFG b.05-alloca.i [2019-11-15 20:15:22,611 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 20:15:22,611 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 20:15:22,611 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 20:15:22,611 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:15:22,611 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:15:22,611 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 20:15:22,612 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:15:22,612 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 20:15:22,626 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-11-15 20:15:22,650 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-15 20:15:22,650 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:15:22,650 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:15:22,657 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 20:15:22,658 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:15:22,658 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 20:15:22,658 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-11-15 20:15:22,659 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-15 20:15:22,660 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:15:22,660 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:15:22,660 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 20:15:22,660 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:15:22,671 INFO L791 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true havoc main_#res;havoc main_#t~nondet15, main_#t~nondet16, main_#t~ret17;test_fun_#in~x, test_fun_#in~tmp := main_#t~nondet15, main_#t~nondet16;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~nondet4, test_fun_#t~mem12, test_fun_#t~nondet13, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem8, test_fun_#t~short9, test_fun_#t~mem10, test_fun_#t~short11, test_fun_#t~mem14, test_fun_~x, test_fun_~tmp, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~tmp := test_fun_#in~tmp;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~tmp, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);call write~int(test_fun_#t~nondet4, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);havoc test_fun_#t~nondet4; 6#L554-11true [2019-11-15 20:15:22,672 INFO L793 eck$LassoCheckResult]: Loop: 6#L554-11true call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 > 0; 8#L554-1true assume test_fun_#t~short7;call test_fun_#t~mem6 := read~int(test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem6 >= 0; 12#L554-3true test_fun_#t~short9 := test_fun_#t~short7; 14#L554-4true assume test_fun_#t~short9;call test_fun_#t~mem8 := read~int(test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 3#L554-6true test_fun_#t~short11 := test_fun_#t~short9; 4#L554-7true assume test_fun_#t~short11;call test_fun_#t~mem10 := read~int(test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);test_fun_#t~short11 := test_fun_~x == 2 * test_fun_#t~mem10; 5#L554-9true assume !!test_fun_#t~short11;havoc test_fun_#t~mem10;havoc test_fun_#t~mem5;havoc test_fun_#t~short7;havoc test_fun_#t~short9;havoc test_fun_#t~mem8;havoc test_fun_#t~short11;havoc test_fun_#t~mem6;call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12;call write~int(test_fun_#t~nondet13, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);havoc test_fun_#t~nondet13; 6#L554-11true [2019-11-15 20:15:22,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:15:22,679 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-15 20:15:22,688 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:15:22,689 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283180490] [2019-11-15 20:15:22,689 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:15:22,689 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:15:22,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:15:22,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:15:22,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:15:22,903 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:15:22,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:15:22,904 INFO L82 PathProgramCache]: Analyzing trace with hash -334850282, now seen corresponding path program 1 times [2019-11-15 20:15:22,905 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:15:22,905 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643076344] [2019-11-15 20:15:22,905 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:15:22,905 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:15:22,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:15:22,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:15:22,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:15:22,956 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:15:22,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:15:22,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1211446548, now seen corresponding path program 1 times [2019-11-15 20:15:22,958 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:15:22,959 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472536337] [2019-11-15 20:15:22,959 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:15:22,959 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:15:22,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:15:23,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:15:23,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:15:23,060 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:15:23,410 WARN L191 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 59 [2019-11-15 20:15:23,786 WARN L191 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2019-11-15 20:15:23,913 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-11-15 20:15:23,925 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:15:23,926 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:15:23,926 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:15:23,926 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:15:23,927 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:15:23,927 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:15:23,927 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:15:23,927 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:15:23,928 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.05-alloca.i_Iteration1_Lasso [2019-11-15 20:15:23,928 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:15:23,928 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:15:23,952 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:15:23,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:15:23,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:15:23,966 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:15:23,969 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:15:23,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:15:23,977 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:15:23,980 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:15:23,982 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:15:23,985 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:15:23,989 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:15:23,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:15:23,997 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:15:24,005 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:15:24,008 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:15:24,254 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-11-15 20:15:24,376 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-11-15 20:15:24,377 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:15:24,382 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:15:24,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:15:24,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:15:24,391 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:15:25,000 WARN L191 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-11-15 20:15:25,173 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:15:25,180 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:15:25,183 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:15:25,186 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:15:25,187 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:15:25,187 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:15:25,188 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:15:25,188 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:15:25,190 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:15:25,191 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:15:25,193 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:15:25,195 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:15:25,197 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:15:25,200 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:15:25,200 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:15:25,201 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:15:25,201 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:15:25,201 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:15:25,202 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:15:25,202 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:15:25,203 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:15:25,204 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:15:25,204 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:15:25,205 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:15:25,205 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:15:25,213 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:15:25,214 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:15:25,214 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:15:25,216 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:15:25,216 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:15:25,218 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:15:25,218 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:15:25,219 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:15:25,219 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:15:25,219 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:15:25,220 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:15:25,220 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:15:25,223 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:15:25,224 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:15:25,225 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:15:25,226 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:15:25,226 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:15:25,227 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:15:25,230 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:15:25,230 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:15:25,241 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:15:25,244 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:15:25,246 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:15:25,247 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:15:25,247 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:15:25,247 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:15:25,247 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:15:25,248 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:15:25,248 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:15:25,250 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:15:25,250 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:15:25,251 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:15:25,251 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:15:25,252 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:15:25,252 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:15:25,252 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:15:25,253 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:15:25,253 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:15:25,255 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:15:25,256 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:15:25,258 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:15:25,258 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:15:25,259 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:15:25,259 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:15:25,259 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:15:25,262 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:15:25,263 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:15:25,265 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:15:25,266 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:15:25,268 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:15:25,268 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:15:25,268 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:15:25,269 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:15:25,269 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:15:25,270 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:15:25,270 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:15:25,271 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:15:25,273 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:15:25,274 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:15:25,274 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:15:25,274 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:15:25,274 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:15:25,279 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:15:25,280 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:15:25,291 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:15:25,293 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:15:25,294 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:15:25,294 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:15:25,294 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:15:25,294 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:15:25,300 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:15:25,301 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:15:25,304 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:15:25,306 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:15:25,307 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:15:25,307 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:15:25,308 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:15:25,308 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:15:25,308 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:15:25,309 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:15:25,309 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:15:25,310 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:15:25,310 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:15:25,311 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:15:25,312 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:15:25,312 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:15:25,312 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:15:25,315 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:15:25,315 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:15:25,328 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:15:25,329 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:15:25,330 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:15:25,331 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:15:25,331 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:15:25,331 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:15:25,331 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:15:25,332 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:15:25,332 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:15:25,333 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:15:25,333 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:15:25,335 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:15:25,335 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-15 20:15:25,335 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:15:25,336 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:15:25,341 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 20:15:25,341 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:15:25,395 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:15:25,396 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:15:25,397 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:15:25,397 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:15:25,397 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:15:25,397 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:15:25,399 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:15:25,399 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:15:25,417 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:15:25,422 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:15:25,422 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:15:25,423 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:15:25,423 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:15:25,423 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:15:25,425 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:15:25,425 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:15:25,439 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:15:25,440 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:15:25,440 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:15:25,440 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:15:25,441 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:15:25,442 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:15:25,444 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:15:25,445 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:15:25,447 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:15:25,448 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:15:25,450 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:15:25,450 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:15:25,451 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:15:25,451 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:15:25,456 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:15:25,456 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:15:25,458 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:15:25,458 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:15:25,460 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:15:25,460 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:15:25,460 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:15:25,461 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:15:25,463 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:15:25,463 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:15:25,507 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:15:25,542 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 20:15:25,542 INFO L444 ModelExtractionUtils]: 19 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 20:15:25,549 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:15:25,551 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 20:15:25,552 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:15:25,553 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 Supporting invariants [] [2019-11-15 20:15:25,592 INFO L297 tatePredicateManager]: 9 out of 11 supporting invariants were superfluous and have been removed [2019-11-15 20:15:25,603 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:15:25,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:15:25,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:15:25,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 20:15:25,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:15:25,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:15:25,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-15 20:15:25,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:15:25,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:15:25,755 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:15:25,772 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-15 20:15:25,773 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states. Second operand 4 states. [2019-11-15 20:15:25,899 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states.. Second operand 4 states. Result 42 states and 57 transitions. Complement of second has 10 states. [2019-11-15 20:15:25,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-15 20:15:25,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 20:15:25,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2019-11-15 20:15:25,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 28 transitions. Stem has 2 letters. Loop has 7 letters. [2019-11-15 20:15:25,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:15:25,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 28 transitions. Stem has 9 letters. Loop has 7 letters. [2019-11-15 20:15:25,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:15:25,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 28 transitions. Stem has 2 letters. Loop has 14 letters. [2019-11-15 20:15:25,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:15:25,906 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 57 transitions. [2019-11-15 20:15:25,909 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-15 20:15:25,913 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 24 states and 33 transitions. [2019-11-15 20:15:25,914 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-15 20:15:25,915 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-15 20:15:25,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 33 transitions. [2019-11-15 20:15:25,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:15:25,916 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-11-15 20:15:25,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 33 transitions. [2019-11-15 20:15:25,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-11-15 20:15:25,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-15 20:15:25,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 32 transitions. [2019-11-15 20:15:25,945 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 32 transitions. [2019-11-15 20:15:25,945 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 32 transitions. [2019-11-15 20:15:25,945 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 20:15:25,945 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 32 transitions. [2019-11-15 20:15:25,946 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-15 20:15:25,947 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:15:25,947 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:15:25,947 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-15 20:15:25,947 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:15:25,948 INFO L791 eck$LassoCheckResult]: Stem: 175#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 168#L-1 havoc main_#res;havoc main_#t~nondet15, main_#t~nondet16, main_#t~ret17;test_fun_#in~x, test_fun_#in~tmp := main_#t~nondet15, main_#t~nondet16;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~nondet4, test_fun_#t~mem12, test_fun_#t~nondet13, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem8, test_fun_#t~short9, test_fun_#t~mem10, test_fun_#t~short11, test_fun_#t~mem14, test_fun_~x, test_fun_~tmp, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~tmp := test_fun_#in~tmp;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~tmp, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);call write~int(test_fun_#t~nondet4, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);havoc test_fun_#t~nondet4; 169#L554-11 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 > 0; 170#L554-1 [2019-11-15 20:15:25,948 INFO L793 eck$LassoCheckResult]: Loop: 170#L554-1 assume !test_fun_#t~short7; 171#L554-3 test_fun_#t~short9 := test_fun_#t~short7; 178#L554-4 assume test_fun_#t~short9;call test_fun_#t~mem8 := read~int(test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 164#L554-6 test_fun_#t~short11 := test_fun_#t~short9; 165#L554-7 assume test_fun_#t~short11;call test_fun_#t~mem10 := read~int(test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);test_fun_#t~short11 := test_fun_~x == 2 * test_fun_#t~mem10; 176#L554-9 assume !!test_fun_#t~short11;havoc test_fun_#t~mem10;havoc test_fun_#t~mem5;havoc test_fun_#t~short7;havoc test_fun_#t~short9;havoc test_fun_#t~mem8;havoc test_fun_#t~short11;havoc test_fun_#t~mem6;call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12;call write~int(test_fun_#t~nondet13, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);havoc test_fun_#t~nondet13; 180#L554-11 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 > 0; 170#L554-1 [2019-11-15 20:15:25,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:15:25,948 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2019-11-15 20:15:25,948 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:15:25,948 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552045531] [2019-11-15 20:15:25,949 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:15:25,949 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:15:25,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:15:25,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:15:25,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:15:25,975 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:15:25,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:15:25,975 INFO L82 PathProgramCache]: Analyzing trace with hash -74889736, now seen corresponding path program 1 times [2019-11-15 20:15:25,975 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:15:25,976 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962720978] [2019-11-15 20:15:25,976 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:15:25,976 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:15:25,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:15:25,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:15:26,013 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:15:26,013 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962720978] [2019-11-15 20:15:26,014 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:15:26,014 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:15:26,015 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906620630] [2019-11-15 20:15:26,017 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 20:15:26,017 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:15:26,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:15:26,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:15:26,021 INFO L87 Difference]: Start difference. First operand 23 states and 32 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-11-15 20:15:26,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:15:26,058 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2019-11-15 20:15:26,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:15:26,059 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 34 transitions. [2019-11-15 20:15:26,060 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-15 20:15:26,061 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 34 transitions. [2019-11-15 20:15:26,061 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-15 20:15:26,061 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-15 20:15:26,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 34 transitions. [2019-11-15 20:15:26,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:15:26,062 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2019-11-15 20:15:26,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 34 transitions. [2019-11-15 20:15:26,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2019-11-15 20:15:26,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-15 20:15:26,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2019-11-15 20:15:26,065 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2019-11-15 20:15:26,065 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2019-11-15 20:15:26,065 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 20:15:26,065 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 30 transitions. [2019-11-15 20:15:26,066 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-15 20:15:26,066 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:15:26,066 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:15:26,066 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-15 20:15:26,066 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:15:26,067 INFO L791 eck$LassoCheckResult]: Stem: 233#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 222#L-1 havoc main_#res;havoc main_#t~nondet15, main_#t~nondet16, main_#t~ret17;test_fun_#in~x, test_fun_#in~tmp := main_#t~nondet15, main_#t~nondet16;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~nondet4, test_fun_#t~mem12, test_fun_#t~nondet13, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem8, test_fun_#t~short9, test_fun_#t~mem10, test_fun_#t~short11, test_fun_#t~mem14, test_fun_~x, test_fun_~tmp, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~tmp := test_fun_#in~tmp;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~tmp, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);call write~int(test_fun_#t~nondet4, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);havoc test_fun_#t~nondet4; 223#L554-11 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 > 0; 228#L554-1 [2019-11-15 20:15:26,067 INFO L793 eck$LassoCheckResult]: Loop: 228#L554-1 assume !test_fun_#t~short7; 229#L554-3 test_fun_#t~short9 := test_fun_#t~short7; 236#L554-4 assume !test_fun_#t~short9; 224#L554-6 test_fun_#t~short11 := test_fun_#t~short9; 225#L554-7 assume test_fun_#t~short11;call test_fun_#t~mem10 := read~int(test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);test_fun_#t~short11 := test_fun_~x == 2 * test_fun_#t~mem10; 234#L554-9 assume !!test_fun_#t~short11;havoc test_fun_#t~mem10;havoc test_fun_#t~mem5;havoc test_fun_#t~short7;havoc test_fun_#t~short9;havoc test_fun_#t~mem8;havoc test_fun_#t~short11;havoc test_fun_#t~mem6;call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12;call write~int(test_fun_#t~nondet13, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);havoc test_fun_#t~nondet13; 238#L554-11 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 > 0; 228#L554-1 [2019-11-15 20:15:26,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:15:26,067 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 2 times [2019-11-15 20:15:26,067 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:15:26,068 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639140979] [2019-11-15 20:15:26,068 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:15:26,068 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:15:26,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:15:26,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:15:26,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:15:26,092 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:15:26,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:15:26,098 INFO L82 PathProgramCache]: Analyzing trace with hash -73042694, now seen corresponding path program 1 times [2019-11-15 20:15:26,098 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:15:26,098 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315423198] [2019-11-15 20:15:26,098 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:15:26,098 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:15:26,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:15:26,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:15:26,129 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:15:26,129 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315423198] [2019-11-15 20:15:26,129 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:15:26,130 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:15:26,130 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467406535] [2019-11-15 20:15:26,130 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 20:15:26,130 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:15:26,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:15:26,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:15:26,131 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. cyclomatic complexity: 9 Second operand 5 states. [2019-11-15 20:15:26,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:15:26,195 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2019-11-15 20:15:26,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 20:15:26,196 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 26 transitions. [2019-11-15 20:15:26,197 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 20:15:26,197 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 0 states and 0 transitions. [2019-11-15 20:15:26,197 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 20:15:26,197 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 20:15:26,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 20:15:26,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:15:26,198 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:15:26,198 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:15:26,198 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:15:26,198 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 20:15:26,198 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 20:15:26,198 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 20:15:26,198 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 20:15:26,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 08:15:26 BoogieIcfgContainer [2019-11-15 20:15:26,205 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 20:15:26,205 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 20:15:26,205 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 20:15:26,205 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 20:15:26,206 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:15:22" (3/4) ... [2019-11-15 20:15:26,209 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 20:15:26,210 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 20:15:26,211 INFO L168 Benchmark]: Toolchain (without parser) took 4616.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 940.6 MB in the beginning and 1.0 GB in the end (delta: -69.7 MB). Peak memory consumption was 67.2 MB. Max. memory is 11.5 GB. [2019-11-15 20:15:26,212 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 964.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:15:26,213 INFO L168 Benchmark]: CACSL2BoogieTranslator took 508.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -181.4 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. [2019-11-15 20:15:26,213 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-11-15 20:15:26,214 INFO L168 Benchmark]: Boogie Preprocessor took 26.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-11-15 20:15:26,214 INFO L168 Benchmark]: RCFGBuilder took 379.49 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: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. [2019-11-15 20:15:26,215 INFO L168 Benchmark]: BuchiAutomizer took 3649.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 86.6 MB). Peak memory consumption was 86.6 MB. Max. memory is 11.5 GB. [2019-11-15 20:15:26,215 INFO L168 Benchmark]: Witness Printer took 4.55 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:15:26,219 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 964.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 508.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -181.4 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 379.49 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: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3649.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 86.6 MB). Peak memory consumption was 86.6 MB. Max. memory is 11.5 GB. * Witness Printer took 4.55 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (2 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 6 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.6s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 3.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 23 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 24 SDtfs, 44 SDslu, 39 SDs, 0 SdLazy, 59 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital225 mio100 ax108 hnf100 lsp87 ukn65 mio100 lsp35 div100 bol100 ite100 ukn100 eq172 hnf89 smp92 dnf171 smp95 tf100 neg93 sie125 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 61ms VariablesStem: 5 VariablesLoop: 4 DisjunctsStem: 4 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 12 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...