./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/bubblesort-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d84375b9-50b7-4632-bdc8-696aa86e9ad6/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d84375b9-50b7-4632-bdc8-696aa86e9ad6/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d84375b9-50b7-4632-bdc8-696aa86e9ad6/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d84375b9-50b7-4632-bdc8-696aa86e9ad6/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/bubblesort-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_d84375b9-50b7-4632-bdc8-696aa86e9ad6/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d84375b9-50b7-4632-bdc8-696aa86e9ad6/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash cb74f7a1bb788b2c5a3efb057591b3727e299c90 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 20:12:32,850 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 20:12:32,851 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 20:12:32,857 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 20:12:32,857 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 20:12:32,857 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 20:12:32,858 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 20:12:32,859 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 20:12:32,860 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 20:12:32,860 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 20:12:32,861 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 20:12:32,861 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 20:12:32,861 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 20:12:32,862 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 20:12:32,862 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 20:12:32,863 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 20:12:32,863 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 20:12:32,864 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 20:12:32,865 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 20:12:32,866 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 20:12:32,867 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 20:12:32,867 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 20:12:32,868 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 20:12:32,869 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 20:12:32,869 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 20:12:32,869 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 20:12:32,870 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 20:12:32,870 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 20:12:32,871 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 20:12:32,871 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 20:12:32,871 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 20:12:32,872 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 20:12:32,872 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 20:12:32,872 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 20:12:32,873 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 20:12:32,873 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 20:12:32,873 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d84375b9-50b7-4632-bdc8-696aa86e9ad6/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-08 20:12:32,881 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 20:12:32,881 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 20:12:32,882 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 20:12:32,882 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 20:12:32,882 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 20:12:32,882 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-08 20:12:32,882 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-08 20:12:32,882 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-08 20:12:32,883 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-08 20:12:32,883 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-08 20:12:32,883 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-08 20:12:32,883 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 20:12:32,883 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 20:12:32,883 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 20:12:32,883 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 20:12:32,883 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-08 20:12:32,883 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-08 20:12:32,884 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-08 20:12:32,884 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 20:12:32,884 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-08 20:12:32,884 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 20:12:32,884 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-08 20:12:32,884 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 20:12:32,884 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 20:12:32,885 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-08 20:12:32,885 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 20:12:32,885 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 20:12:32,885 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-08 20:12:32,886 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-08 20:12:32,886 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_d84375b9-50b7-4632-bdc8-696aa86e9ad6/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cb74f7a1bb788b2c5a3efb057591b3727e299c90 [2018-12-08 20:12:32,903 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 20:12:32,909 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 20:12:32,911 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 20:12:32,912 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 20:12:32,912 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 20:12:32,913 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d84375b9-50b7-4632-bdc8-696aa86e9ad6/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/bubblesort-alloca_true-termination.c.i [2018-12-08 20:12:32,946 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d84375b9-50b7-4632-bdc8-696aa86e9ad6/bin-2019/uautomizer/data/d9590e787/de1773f06d2c4e0187b2050db12b6f67/FLAGc54420d53 [2018-12-08 20:12:33,386 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 20:12:33,386 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d84375b9-50b7-4632-bdc8-696aa86e9ad6/sv-benchmarks/c/termination-memory-alloca/bubblesort-alloca_true-termination.c.i [2018-12-08 20:12:33,392 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d84375b9-50b7-4632-bdc8-696aa86e9ad6/bin-2019/uautomizer/data/d9590e787/de1773f06d2c4e0187b2050db12b6f67/FLAGc54420d53 [2018-12-08 20:12:33,400 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d84375b9-50b7-4632-bdc8-696aa86e9ad6/bin-2019/uautomizer/data/d9590e787/de1773f06d2c4e0187b2050db12b6f67 [2018-12-08 20:12:33,402 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 20:12:33,402 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 20:12:33,403 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 20:12:33,403 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 20:12:33,405 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 20:12:33,405 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 08:12:33" (1/1) ... [2018-12-08 20:12:33,407 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58dfd927 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:12:33, skipping insertion in model container [2018-12-08 20:12:33,407 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 08:12:33" (1/1) ... [2018-12-08 20:12:33,411 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 20:12:33,428 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 20:12:33,565 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 20:12:33,572 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 20:12:33,628 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 20:12:33,652 INFO L195 MainTranslator]: Completed translation [2018-12-08 20:12:33,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:12:33 WrapperNode [2018-12-08 20:12:33,653 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 20:12:33,653 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 20:12:33,653 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 20:12:33,653 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 20:12:33,658 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:12:33" (1/1) ... [2018-12-08 20:12:33,667 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:12:33" (1/1) ... [2018-12-08 20:12:33,679 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 20:12:33,679 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 20:12:33,680 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 20:12:33,680 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 20:12:33,685 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:12:33" (1/1) ... [2018-12-08 20:12:33,685 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:12:33" (1/1) ... [2018-12-08 20:12:33,687 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:12:33" (1/1) ... [2018-12-08 20:12:33,687 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:12:33" (1/1) ... [2018-12-08 20:12:33,690 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:12:33" (1/1) ... [2018-12-08 20:12:33,692 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:12:33" (1/1) ... [2018-12-08 20:12:33,693 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:12:33" (1/1) ... [2018-12-08 20:12:33,694 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 20:12:33,694 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 20:12:33,695 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 20:12:33,695 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 20:12:33,695 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:12:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d84375b9-50b7-4632-bdc8-696aa86e9ad6/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 20:12:33,726 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 20:12:33,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 20:12:33,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 20:12:33,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 20:12:33,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 20:12:33,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 20:12:33,838 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 20:12:33,838 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-08 20:12:33,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 08:12:33 BoogieIcfgContainer [2018-12-08 20:12:33,838 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 20:12:33,838 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-08 20:12:33,838 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-08 20:12:33,841 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-08 20:12:33,841 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 20:12:33,841 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.12 08:12:33" (1/3) ... [2018-12-08 20:12:33,842 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6d520c93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 08:12:33, skipping insertion in model container [2018-12-08 20:12:33,842 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 20:12:33,842 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:12:33" (2/3) ... [2018-12-08 20:12:33,842 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6d520c93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 08:12:33, skipping insertion in model container [2018-12-08 20:12:33,842 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 20:12:33,842 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 08:12:33" (3/3) ... [2018-12-08 20:12:33,843 INFO L375 chiAutomizerObserver]: Analyzing ICFG bubblesort-alloca_true-termination.c.i [2018-12-08 20:12:33,877 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 20:12:33,877 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-08 20:12:33,877 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-08 20:12:33,878 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-08 20:12:33,878 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 20:12:33,878 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 20:12:33,878 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-08 20:12:33,878 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 20:12:33,878 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-08 20:12:33,886 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-12-08 20:12:33,899 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-08 20:12:33,899 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 20:12:33,899 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 20:12:33,903 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-08 20:12:33,904 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 20:12:33,904 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-08 20:12:33,904 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-12-08 20:12:33,904 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-08 20:12:33,904 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 20:12:33,905 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 20:12:33,905 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-08 20:12:33,905 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 20:12:33,910 INFO L794 eck$LassoCheckResult]: Stem: 9#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 11#L562true assume !(main_~array_size~0 < 1); 13#L562-2true call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset, bubbleSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc bubbleSort_#t~mem4, bubbleSort_#t~mem5, bubbleSort_#t~mem6, bubbleSort_#t~mem7, bubbleSort_#t~post3, bubbleSort_#t~post2, bubbleSort_~numbers.base, bubbleSort_~numbers.offset, bubbleSort_~array_size, bubbleSort_~i~0, bubbleSort_~j~0, bubbleSort_~temp~0;bubbleSort_~numbers.base, bubbleSort_~numbers.offset := bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset;bubbleSort_~array_size := bubbleSort_#in~array_size;havoc bubbleSort_~i~0;havoc bubbleSort_~j~0;havoc bubbleSort_~temp~0;bubbleSort_~i~0 := bubbleSort_~array_size - 1; 5#L550-3true [2018-12-08 20:12:33,910 INFO L796 eck$LassoCheckResult]: Loop: 5#L550-3true assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 3#L551-3true assume !true; 4#L550-2true bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 5#L550-3true [2018-12-08 20:12:33,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:12:33,914 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2018-12-08 20:12:33,915 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:12:33,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:12:33,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:12:33,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:12:33,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:12:33,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:12:33,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:12:33,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:12:33,985 INFO L82 PathProgramCache]: Analyzing trace with hash 47218, now seen corresponding path program 1 times [2018-12-08 20:12:33,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:12:33,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:12:33,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:12:33,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:12:33,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:12:33,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:12:34,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:12:34,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:12:34,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 20:12:34,006 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-08 20:12:34,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-08 20:12:34,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-08 20:12:34,016 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 2 states. [2018-12-08 20:12:34,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:12:34,020 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2018-12-08 20:12:34,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-08 20:12:34,021 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2018-12-08 20:12:34,022 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-08 20:12:34,024 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 9 states and 12 transitions. [2018-12-08 20:12:34,025 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-12-08 20:12:34,025 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-12-08 20:12:34,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 12 transitions. [2018-12-08 20:12:34,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 20:12:34,025 INFO L705 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2018-12-08 20:12:34,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 12 transitions. [2018-12-08 20:12:34,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-08 20:12:34,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-08 20:12:34,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2018-12-08 20:12:34,041 INFO L728 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2018-12-08 20:12:34,042 INFO L608 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2018-12-08 20:12:34,042 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-08 20:12:34,042 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 12 transitions. [2018-12-08 20:12:34,042 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-08 20:12:34,042 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 20:12:34,042 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 20:12:34,043 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-08 20:12:34,043 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 20:12:34,043 INFO L794 eck$LassoCheckResult]: Stem: 40#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 34#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 35#L562 assume !(main_~array_size~0 < 1); 42#L562-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset, bubbleSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc bubbleSort_#t~mem4, bubbleSort_#t~mem5, bubbleSort_#t~mem6, bubbleSort_#t~mem7, bubbleSort_#t~post3, bubbleSort_#t~post2, bubbleSort_~numbers.base, bubbleSort_~numbers.offset, bubbleSort_~array_size, bubbleSort_~i~0, bubbleSort_~j~0, bubbleSort_~temp~0;bubbleSort_~numbers.base, bubbleSort_~numbers.offset := bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset;bubbleSort_~array_size := bubbleSort_#in~array_size;havoc bubbleSort_~i~0;havoc bubbleSort_~j~0;havoc bubbleSort_~temp~0;bubbleSort_~i~0 := bubbleSort_~array_size - 1; 39#L550-3 [2018-12-08 20:12:34,043 INFO L796 eck$LassoCheckResult]: Loop: 39#L550-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 36#L551-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 37#L550-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 39#L550-3 [2018-12-08 20:12:34,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:12:34,043 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2018-12-08 20:12:34,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:12:34,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:12:34,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:12:34,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:12:34,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:12:34,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:12:34,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:12:34,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:12:34,055 INFO L82 PathProgramCache]: Analyzing trace with hash 46877, now seen corresponding path program 1 times [2018-12-08 20:12:34,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:12:34,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:12:34,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:12:34,056 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 20:12:34,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:12:34,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:12:34,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:12:34,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:12:34,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818489, now seen corresponding path program 1 times [2018-12-08 20:12:34,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:12:34,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:12:34,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:12:34,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:12:34,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:12:34,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:12:34,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:12:34,096 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 20:12:34,097 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 20:12:34,097 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 20:12:34,097 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 20:12:34,097 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-08 20:12:34,097 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 20:12:34,097 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 20:12:34,097 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 20:12:34,097 INFO L131 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca_true-termination.c.i_Iteration2_Loop [2018-12-08 20:12:34,097 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 20:12:34,097 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 20:12:34,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:12:34,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:12:34,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:12:34,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:12:34,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:12:34,191 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 20:12:34,192 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d84375b9-50b7-4632-bdc8-696aa86e9ad6/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 20:12:34,196 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 20:12:34,196 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 20:12:34,202 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 20:12:34,202 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_bubbleSort_#t~post2=0} Honda state: {ULTIMATE.start_bubbleSort_#t~post2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d84375b9-50b7-4632-bdc8-696aa86e9ad6/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 20:12:34,217 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 20:12:34,218 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 20:12:34,233 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 20:12:34,233 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~P_PID_1=1} Honda state: {v_rep~unnamed0~0~P_PID_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d84375b9-50b7-4632-bdc8-696aa86e9ad6/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 20:12:34,235 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 20:12:34,236 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 20:12:34,251 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 20:12:34,251 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~P_PGID_1=2} Honda state: {v_rep~unnamed0~0~P_PGID_1=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d84375b9-50b7-4632-bdc8-696aa86e9ad6/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 20:12:34,254 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 20:12:34,254 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d84375b9-50b7-4632-bdc8-696aa86e9ad6/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 20:12:34,270 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-08 20:12:34,270 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 20:12:34,290 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-08 20:12:34,291 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 20:12:34,291 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 20:12:34,291 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 20:12:34,291 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 20:12:34,291 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 20:12:34,291 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 20:12:34,291 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 20:12:34,291 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 20:12:34,291 INFO L131 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca_true-termination.c.i_Iteration2_Loop [2018-12-08 20:12:34,291 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 20:12:34,291 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 20:12:34,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:12:34,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:12:34,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:12:34,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:12:34,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:12:34,342 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 20:12:34,345 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 20:12:34,346 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 20:12:34,347 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:12:34,347 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:12:34,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:12:34,348 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:12:34,348 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:12:34,349 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:12:34,349 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:12:34,351 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:12:34,351 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 20:12:34,351 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:12:34,352 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:12:34,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:12:34,352 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:12:34,352 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:12:34,352 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:12:34,352 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:12:34,355 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 20:12:34,358 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-08 20:12:34,358 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-08 20:12:34,359 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 20:12:34,359 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-08 20:12:34,360 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 20:12:34,360 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_bubbleSort_~i~0) = 2*ULTIMATE.start_bubbleSort_~i~0 + 1 Supporting invariants [] [2018-12-08 20:12:34,361 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-08 20:12:34,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:12:34,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:12:34,388 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:12:34,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:12:34,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:12:34,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:12:34,406 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 [2018-12-08 20:12:34,406 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 12 transitions. cyclomatic complexity: 4 Second operand 3 states. [2018-12-08 20:12:34,430 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 12 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 15 states and 22 transitions. Complement of second has 4 states. [2018-12-08 20:12:34,431 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 [2018-12-08 20:12:34,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 20:12:34,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2018-12-08 20:12:34,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 4 letters. Loop has 3 letters. [2018-12-08 20:12:34,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 20:12:34,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 7 letters. Loop has 3 letters. [2018-12-08 20:12:34,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 20:12:34,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 4 letters. Loop has 6 letters. [2018-12-08 20:12:34,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 20:12:34,434 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 22 transitions. [2018-12-08 20:12:34,434 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 20:12:34,435 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 14 states and 20 transitions. [2018-12-08 20:12:34,435 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-12-08 20:12:34,435 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-12-08 20:12:34,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 20 transitions. [2018-12-08 20:12:34,435 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 20:12:34,435 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2018-12-08 20:12:34,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 20 transitions. [2018-12-08 20:12:34,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-12-08 20:12:34,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-08 20:12:34,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2018-12-08 20:12:34,436 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2018-12-08 20:12:34,436 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2018-12-08 20:12:34,436 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-08 20:12:34,436 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 19 transitions. [2018-12-08 20:12:34,437 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 20:12:34,437 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 20:12:34,437 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 20:12:34,437 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-08 20:12:34,437 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 20:12:34,437 INFO L794 eck$LassoCheckResult]: Stem: 107#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 104#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 105#L562 assume !(main_~array_size~0 < 1); 111#L562-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset, bubbleSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc bubbleSort_#t~mem4, bubbleSort_#t~mem5, bubbleSort_#t~mem6, bubbleSort_#t~mem7, bubbleSort_#t~post3, bubbleSort_#t~post2, bubbleSort_~numbers.base, bubbleSort_~numbers.offset, bubbleSort_~array_size, bubbleSort_~i~0, bubbleSort_~j~0, bubbleSort_~temp~0;bubbleSort_~numbers.base, bubbleSort_~numbers.offset := bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset;bubbleSort_~array_size := bubbleSort_#in~array_size;havoc bubbleSort_~i~0;havoc bubbleSort_~j~0;havoc bubbleSort_~temp~0;bubbleSort_~i~0 := bubbleSort_~array_size - 1; 108#L550-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 99#L551-3 [2018-12-08 20:12:34,437 INFO L796 eck$LassoCheckResult]: Loop: 99#L551-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 100#L552 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 109#L551-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 99#L551-3 [2018-12-08 20:12:34,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:12:34,438 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2018-12-08 20:12:34,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:12:34,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:12:34,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:12:34,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:12:34,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:12:34,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:12:34,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:12:34,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:12:34,448 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 1 times [2018-12-08 20:12:34,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:12:34,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:12:34,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:12:34,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:12:34,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:12:34,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:12:34,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:12:34,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:12:34,456 INFO L82 PathProgramCache]: Analyzing trace with hash 176800017, now seen corresponding path program 1 times [2018-12-08 20:12:34,457 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:12:34,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:12:34,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:12:34,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:12:34,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:12:34,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:12:34,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:12:34,631 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 20:12:34,631 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 20:12:34,631 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 20:12:34,631 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 20:12:34,632 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 20:12:34,632 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 20:12:34,632 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 20:12:34,632 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 20:12:34,632 INFO L131 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca_true-termination.c.i_Iteration3_Lasso [2018-12-08 20:12:34,632 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 20:12:34,632 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 20:12:34,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:12:34,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:12:34,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:12:34,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:12:34,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:12:34,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:12:34,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:12:34,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:12:34,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:12:34,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:12:34,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:12:34,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:12:34,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:12:34,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:12:34,917 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 20:12:34,917 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 20:12:34,918 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 20:12:34,918 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:12:34,918 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:12:34,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:12:34,918 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:12:34,918 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:12:34,919 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:12:34,919 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:12:34,919 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:12:34,920 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 20:12:34,920 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:12:34,920 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:12:34,920 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:12:34,920 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:12:34,923 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 20:12:34,923 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 20:12:34,967 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 20:12:34,981 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-08 20:12:34,981 INFO L444 ModelExtractionUtils]: 33 out of 37 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-08 20:12:34,982 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 20:12:34,983 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 20:12:34,983 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 20:12:34,983 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_bubbleSort_~i~0, ULTIMATE.start_bubbleSort_~j~0) = 2*ULTIMATE.start_bubbleSort_~i~0 - 2*ULTIMATE.start_bubbleSort_~j~0 + 1 Supporting invariants [] [2018-12-08 20:12:34,990 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-12-08 20:12:35,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:12:35,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:12:35,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:12:35,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:12:35,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:12:35,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:12:35,028 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 [2018-12-08 20:12:35,028 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 19 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-12-08 20:12:35,047 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 19 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 28 states and 41 transitions. Complement of second has 7 states. [2018-12-08 20:12:35,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-08 20:12:35,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 20:12:35,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-12-08 20:12:35,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 5 letters. Loop has 3 letters. [2018-12-08 20:12:35,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 20:12:35,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 3 letters. [2018-12-08 20:12:35,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 20:12:35,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 5 letters. Loop has 6 letters. [2018-12-08 20:12:35,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 20:12:35,048 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 41 transitions. [2018-12-08 20:12:35,050 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 20:12:35,050 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 18 states and 26 transitions. [2018-12-08 20:12:35,050 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-12-08 20:12:35,051 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-12-08 20:12:35,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 26 transitions. [2018-12-08 20:12:35,051 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 20:12:35,051 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2018-12-08 20:12:35,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 26 transitions. [2018-12-08 20:12:35,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 13. [2018-12-08 20:12:35,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-08 20:12:35,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2018-12-08 20:12:35,052 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2018-12-08 20:12:35,052 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2018-12-08 20:12:35,052 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-08 20:12:35,053 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2018-12-08 20:12:35,053 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 20:12:35,053 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 20:12:35,053 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 20:12:35,053 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2018-12-08 20:12:35,054 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 20:12:35,054 INFO L794 eck$LassoCheckResult]: Stem: 212#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 209#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 210#L562 assume !(main_~array_size~0 < 1); 216#L562-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset, bubbleSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc bubbleSort_#t~mem4, bubbleSort_#t~mem5, bubbleSort_#t~mem6, bubbleSort_#t~mem7, bubbleSort_#t~post3, bubbleSort_#t~post2, bubbleSort_~numbers.base, bubbleSort_~numbers.offset, bubbleSort_~array_size, bubbleSort_~i~0, bubbleSort_~j~0, bubbleSort_~temp~0;bubbleSort_~numbers.base, bubbleSort_~numbers.offset := bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset;bubbleSort_~array_size := bubbleSort_#in~array_size;havoc bubbleSort_~i~0;havoc bubbleSort_~j~0;havoc bubbleSort_~temp~0;bubbleSort_~i~0 := bubbleSort_~array_size - 1; 213#L550-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 206#L551-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 207#L550-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 211#L550-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 204#L551-3 [2018-12-08 20:12:35,054 INFO L796 eck$LassoCheckResult]: Loop: 204#L551-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 205#L552 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 214#L551-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 204#L551-3 [2018-12-08 20:12:35,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:12:35,054 INFO L82 PathProgramCache]: Analyzing trace with hash 176798328, now seen corresponding path program 2 times [2018-12-08 20:12:35,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:12:35,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:12:35,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:12:35,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:12:35,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:12:35,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:12:35,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:12:35,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:12:35,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 20:12:35,073 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 20:12:35,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:12:35,073 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 2 times [2018-12-08 20:12:35,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:12:35,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:12:35,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:12:35,075 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 20:12:35,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:12:35,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:12:35,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:12:35,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 20:12:35,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-08 20:12:35,133 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand 5 states. [2018-12-08 20:12:35,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:12:35,155 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions. [2018-12-08 20:12:35,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 20:12:35,155 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2018-12-08 20:12:35,156 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 20:12:35,156 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 19 states and 26 transitions. [2018-12-08 20:12:35,156 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-12-08 20:12:35,156 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-08 20:12:35,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 26 transitions. [2018-12-08 20:12:35,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 20:12:35,157 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2018-12-08 20:12:35,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 26 transitions. [2018-12-08 20:12:35,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 14. [2018-12-08 20:12:35,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-08 20:12:35,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2018-12-08 20:12:35,158 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-12-08 20:12:35,158 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-12-08 20:12:35,158 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-08 20:12:35,158 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2018-12-08 20:12:35,158 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 20:12:35,158 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 20:12:35,158 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 20:12:35,159 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:12:35,159 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 20:12:35,159 INFO L794 eck$LassoCheckResult]: Stem: 258#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 250#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 251#L562 assume !(main_~array_size~0 < 1); 262#L562-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset, bubbleSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc bubbleSort_#t~mem4, bubbleSort_#t~mem5, bubbleSort_#t~mem6, bubbleSort_#t~mem7, bubbleSort_#t~post3, bubbleSort_#t~post2, bubbleSort_~numbers.base, bubbleSort_~numbers.offset, bubbleSort_~array_size, bubbleSort_~i~0, bubbleSort_~j~0, bubbleSort_~temp~0;bubbleSort_~numbers.base, bubbleSort_~numbers.offset := bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset;bubbleSort_~array_size := bubbleSort_#in~array_size;havoc bubbleSort_~i~0;havoc bubbleSort_~j~0;havoc bubbleSort_~temp~0;bubbleSort_~i~0 := bubbleSort_~array_size - 1; 259#L550-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 254#L551-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 255#L552 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4; 261#L551-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 263#L551-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 256#L550-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 257#L550-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 252#L551-3 [2018-12-08 20:12:35,159 INFO L796 eck$LassoCheckResult]: Loop: 252#L551-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 253#L552 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 260#L551-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 252#L551-3 [2018-12-08 20:12:35,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:12:35,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1421271829, now seen corresponding path program 1 times [2018-12-08 20:12:35,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:12:35,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:12:35,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:12:35,160 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 20:12:35,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:12:35,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:12:35,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:12:35,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:12:35,171 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 3 times [2018-12-08 20:12:35,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:12:35,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:12:35,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:12:35,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:12:35,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:12:35,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:12:35,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:12:35,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:12:35,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1321478696, now seen corresponding path program 1 times [2018-12-08 20:12:35,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:12:35,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:12:35,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:12:35,181 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 20:12:35,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:12:35,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:12:35,235 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:12:35,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:12:35,235 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d84375b9-50b7-4632-bdc8-696aa86e9ad6/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 20:12:35,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:12:35,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:12:35,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:12:35,299 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:12:35,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 20:12:35,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-12-08 20:12:35,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 20:12:35,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-08 20:12:35,375 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand 12 states. [2018-12-08 20:12:35,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:12:35,415 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2018-12-08 20:12:35,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 20:12:35,416 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 38 transitions. [2018-12-08 20:12:35,416 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 20:12:35,416 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 25 states and 34 transitions. [2018-12-08 20:12:35,416 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-12-08 20:12:35,416 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-12-08 20:12:35,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 34 transitions. [2018-12-08 20:12:35,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 20:12:35,417 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2018-12-08 20:12:35,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 34 transitions. [2018-12-08 20:12:35,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2018-12-08 20:12:35,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-08 20:12:35,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2018-12-08 20:12:35,418 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2018-12-08 20:12:35,418 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2018-12-08 20:12:35,418 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-08 20:12:35,418 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2018-12-08 20:12:35,418 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 20:12:35,418 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 20:12:35,419 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 20:12:35,419 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-08 20:12:35,419 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 20:12:35,419 INFO L794 eck$LassoCheckResult]: Stem: 363#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 355#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 356#L562 assume !(main_~array_size~0 < 1); 369#L562-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset, bubbleSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc bubbleSort_#t~mem4, bubbleSort_#t~mem5, bubbleSort_#t~mem6, bubbleSort_#t~mem7, bubbleSort_#t~post3, bubbleSort_#t~post2, bubbleSort_~numbers.base, bubbleSort_~numbers.offset, bubbleSort_~array_size, bubbleSort_~i~0, bubbleSort_~j~0, bubbleSort_~temp~0;bubbleSort_~numbers.base, bubbleSort_~numbers.offset := bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset;bubbleSort_~array_size := bubbleSort_#in~array_size;havoc bubbleSort_~i~0;havoc bubbleSort_~j~0;havoc bubbleSort_~temp~0;bubbleSort_~i~0 := bubbleSort_~array_size - 1; 364#L550-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 365#L551-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 367#L552 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4; 368#L551-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 359#L551-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 360#L552 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4; 371#L551-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 370#L551-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 361#L550-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 362#L550-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 357#L551-3 [2018-12-08 20:12:35,419 INFO L796 eck$LassoCheckResult]: Loop: 357#L551-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 358#L552 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 366#L551-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 357#L551-3 [2018-12-08 20:12:35,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:12:35,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1373641048, now seen corresponding path program 2 times [2018-12-08 20:12:35,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:12:35,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:12:35,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:12:35,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:12:35,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:12:35,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:12:35,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:12:35,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:12:35,432 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 4 times [2018-12-08 20:12:35,432 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:12:35,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:12:35,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:12:35,433 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 20:12:35,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:12:35,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:12:35,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:12:35,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:12:35,439 INFO L82 PathProgramCache]: Analyzing trace with hash -307910395, now seen corresponding path program 2 times [2018-12-08 20:12:35,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:12:35,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:12:35,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:12:35,439 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 20:12:35,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:12:35,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:12:35,630 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:12:35,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:12:35,630 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d84375b9-50b7-4632-bdc8-696aa86e9ad6/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 20:12:35,637 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-08 20:12:35,653 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-08 20:12:35,653 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 20:12:35,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:12:35,691 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-12-08 20:12:35,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-12-08 20:12:35,695 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 20:12:35,696 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:12:35,697 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:12:35,697 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-12-08 20:12:35,703 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-08 20:12:35,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 20:12:35,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 12 [2018-12-08 20:12:35,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 20:12:35,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-12-08 20:12:35,760 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. cyclomatic complexity: 8 Second operand 12 states. [2018-12-08 20:12:35,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:12:35,815 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2018-12-08 20:12:35,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-08 20:12:35,816 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 50 transitions. [2018-12-08 20:12:35,816 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-12-08 20:12:35,818 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 50 transitions. [2018-12-08 20:12:35,818 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-12-08 20:12:35,818 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-12-08 20:12:35,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 50 transitions. [2018-12-08 20:12:35,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 20:12:35,818 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 50 transitions. [2018-12-08 20:12:35,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 50 transitions. [2018-12-08 20:12:35,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2018-12-08 20:12:35,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-08 20:12:35,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2018-12-08 20:12:35,820 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2018-12-08 20:12:35,820 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2018-12-08 20:12:35,820 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-08 20:12:35,820 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 35 transitions. [2018-12-08 20:12:35,820 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 20:12:35,820 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 20:12:35,820 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 20:12:35,821 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:12:35,821 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 20:12:35,821 INFO L794 eck$LassoCheckResult]: Stem: 488#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 482#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 483#L562 assume !(main_~array_size~0 < 1); 492#L562-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset, bubbleSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc bubbleSort_#t~mem4, bubbleSort_#t~mem5, bubbleSort_#t~mem6, bubbleSort_#t~mem7, bubbleSort_#t~post3, bubbleSort_#t~post2, bubbleSort_~numbers.base, bubbleSort_~numbers.offset, bubbleSort_~array_size, bubbleSort_~i~0, bubbleSort_~j~0, bubbleSort_~temp~0;bubbleSort_~numbers.base, bubbleSort_~numbers.offset := bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset;bubbleSort_~array_size := bubbleSort_#in~array_size;havoc bubbleSort_~i~0;havoc bubbleSort_~j~0;havoc bubbleSort_~temp~0;bubbleSort_~i~0 := bubbleSort_~array_size - 1; 484#L550-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 485#L551-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 498#L552 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4; 494#L551-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 478#L551-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 479#L552 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 490#L551-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 497#L551-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 480#L550-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 481#L550-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 493#L551-3 [2018-12-08 20:12:35,821 INFO L796 eck$LassoCheckResult]: Loop: 493#L551-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 501#L552 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 489#L551-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 493#L551-3 [2018-12-08 20:12:35,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:12:35,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1371794006, now seen corresponding path program 3 times [2018-12-08 20:12:35,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:12:35,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:12:35,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:12:35,822 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 20:12:35,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:12:35,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:12:35,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:12:35,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:12:35,830 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 5 times [2018-12-08 20:12:35,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:12:35,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:12:35,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:12:35,830 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 20:12:35,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:12:35,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:12:35,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:12:35,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:12:35,834 INFO L82 PathProgramCache]: Analyzing trace with hash 501436231, now seen corresponding path program 4 times [2018-12-08 20:12:35,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:12:35,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:12:35,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:12:35,835 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 20:12:35,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:12:35,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:12:35,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:12:36,066 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 99 [2018-12-08 20:12:36,105 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 20:12:36,105 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 20:12:36,105 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 20:12:36,105 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 20:12:36,105 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 20:12:36,105 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 20:12:36,105 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 20:12:36,105 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 20:12:36,105 INFO L131 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca_true-termination.c.i_Iteration7_Lasso [2018-12-08 20:12:36,106 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 20:12:36,106 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 20:12:36,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:12:36,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:12:36,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:12:36,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:12:36,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:12:36,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:12:36,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:12:36,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:12:36,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:12:36,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:12:36,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:12:36,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:12:36,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:12:36,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 20:12:36,415 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 20:12:36,415 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 20:12:36,415 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 20:12:36,416 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:12:36,416 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:12:36,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:12:36,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:12:36,416 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:12:36,416 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:12:36,416 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:12:36,417 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:12:36,417 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 20:12:36,417 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:12:36,417 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:12:36,417 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:12:36,417 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:12:36,418 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 20:12:36,418 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 20:12:36,419 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:12:36,419 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 20:12:36,420 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:12:36,420 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:12:36,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:12:36,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:12:36,420 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:12:36,420 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:12:36,420 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:12:36,421 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:12:36,421 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 20:12:36,421 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:12:36,422 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:12:36,422 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:12:36,422 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:12:36,422 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 20:12:36,422 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 20:12:36,423 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:12:36,423 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 20:12:36,424 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:12:36,424 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:12:36,424 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:12:36,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:12:36,424 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:12:36,424 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:12:36,424 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:12:36,424 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:12:36,425 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 20:12:36,425 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:12:36,425 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:12:36,425 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:12:36,425 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:12:36,426 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 20:12:36,426 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 20:12:36,427 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:12:36,427 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 20:12:36,427 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:12:36,427 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 20:12:36,427 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:12:36,428 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:12:36,428 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:12:36,428 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 20:12:36,428 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 20:12:36,428 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:12:36,428 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 20:12:36,428 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:12:36,429 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:12:36,429 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:12:36,429 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:12:36,429 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 20:12:36,430 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 20:12:36,430 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 20:12:36,431 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 20:12:36,431 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 20:12:36,431 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 20:12:36,431 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 20:12:36,431 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 20:12:36,432 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 20:12:36,433 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 20:12:36,440 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 20:12:36,451 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-08 20:12:36,451 INFO L444 ModelExtractionUtils]: 32 out of 37 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-08 20:12:36,451 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 20:12:36,452 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 20:12:36,452 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 20:12:36,452 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_bubbleSort_~numbers.offset, ULTIMATE.start_bubbleSort_~j~0, v_rep(select #length ULTIMATE.start_bubbleSort_~numbers.base)_2) = -1*ULTIMATE.start_bubbleSort_~numbers.offset - 4*ULTIMATE.start_bubbleSort_~j~0 + 1*v_rep(select #length ULTIMATE.start_bubbleSort_~numbers.base)_2 Supporting invariants [] [2018-12-08 20:12:36,470 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2018-12-08 20:12:36,471 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-08 20:12:36,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:12:36,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:12:36,489 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:12:36,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:12:36,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:12:36,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:12:36,501 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 [2018-12-08 20:12:36,501 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11 Second operand 3 states. [2018-12-08 20:12:36,512 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 50 states and 70 transitions. Complement of second has 7 states. [2018-12-08 20:12:36,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-08 20:12:36,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 20:12:36,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-12-08 20:12:36,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 14 letters. Loop has 3 letters. [2018-12-08 20:12:36,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 20:12:36,513 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 20:12:36,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:12:36,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:12:36,530 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:12:36,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:12:36,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:12:36,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:12:36,541 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-08 20:12:36,541 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11 Second operand 3 states. [2018-12-08 20:12:36,551 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 50 states and 70 transitions. Complement of second has 7 states. [2018-12-08 20:12:36,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-08 20:12:36,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 20:12:36,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-12-08 20:12:36,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 14 letters. Loop has 3 letters. [2018-12-08 20:12:36,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 20:12:36,551 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 20:12:36,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:12:36,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:12:36,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:12:36,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:12:36,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:12:36,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:12:36,586 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-08 20:12:36,587 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11 Second operand 3 states. [2018-12-08 20:12:36,597 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 41 states and 58 transitions. Complement of second has 6 states. [2018-12-08 20:12:36,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-08 20:12:36,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 20:12:36,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2018-12-08 20:12:36,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 14 letters. Loop has 3 letters. [2018-12-08 20:12:36,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 20:12:36,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 17 letters. Loop has 3 letters. [2018-12-08 20:12:36,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 20:12:36,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 14 letters. Loop has 6 letters. [2018-12-08 20:12:36,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 20:12:36,598 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 58 transitions. [2018-12-08 20:12:36,599 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 20:12:36,599 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2018-12-08 20:12:36,599 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-08 20:12:36,599 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-08 20:12:36,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-08 20:12:36,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 20:12:36,599 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 20:12:36,599 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 20:12:36,599 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 20:12:36,599 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-08 20:12:36,599 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-08 20:12:36,599 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 20:12:36,599 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-08 20:12:36,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.12 08:12:36 BoogieIcfgContainer [2018-12-08 20:12:36,603 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-08 20:12:36,604 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 20:12:36,604 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 20:12:36,604 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 20:12:36,604 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 08:12:33" (3/4) ... [2018-12-08 20:12:36,606 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-08 20:12:36,606 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 20:12:36,607 INFO L168 Benchmark]: Toolchain (without parser) took 3204.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 209.7 MB). Free memory was 956.0 MB in the beginning and 821.4 MB in the end (delta: 134.6 MB). Peak memory consumption was 344.3 MB. Max. memory is 11.5 GB. [2018-12-08 20:12:36,607 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 20:12:36,607 INFO L168 Benchmark]: CACSL2BoogieTranslator took 249.84 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.8 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -142.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2018-12-08 20:12:36,608 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.40 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 20:12:36,608 INFO L168 Benchmark]: Boogie Preprocessor took 14.79 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 20:12:36,608 INFO L168 Benchmark]: RCFGBuilder took 143.67 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2018-12-08 20:12:36,608 INFO L168 Benchmark]: BuchiAutomizer took 2764.92 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 94.9 MB). Free memory was 1.1 GB in the beginning and 821.4 MB in the end (delta: 258.7 MB). Peak memory consumption was 353.6 MB. Max. memory is 11.5 GB. [2018-12-08 20:12:36,609 INFO L168 Benchmark]: Witness Printer took 2.65 ms. Allocated memory is still 1.2 GB. Free memory is still 821.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 20:12:36,610 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 249.84 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.8 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -142.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 26.40 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.79 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 143.67 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2764.92 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 94.9 MB). Free memory was 1.1 GB in the beginning and 821.4 MB in the end (delta: 258.7 MB). Peak memory consumption was 353.6 MB. Max. memory is 11.5 GB. * Witness Printer took 2.65 ms. Allocated memory is still 1.2 GB. Free memory is still 821.4 MB. 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 #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function 2 * i + 1 and consists of 3 locations. One deterministic module has affine ranking function 2 * i + -2 * j + 1 and consists of 4 locations. One nondeterministic module has affine ranking function -1 * numbers + -4 * j + unknown-#length-unknown[numbers] and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 12 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.7s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 2.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 30 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 26 states and ocurred in iteration 6. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 89 SDtfs, 99 SDslu, 96 SDs, 0 SdLazy, 166 SolverSat, 30 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT1 conc2 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital109 mio100 ax157 hnf98 lsp67 ukn80 mio100 lsp81 div100 bol100 ite100 ukn100 eq171 hnf90 smp88 dnf100 smp100 tf104 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 63ms VariablesStem: 11 VariablesLoop: 6 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 3 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 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...