./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/bubblesort-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_74c20694-4f1a-4580-8022-66165419f596/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_74c20694-4f1a-4580-8022-66165419f596/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_74c20694-4f1a-4580-8022-66165419f596/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_74c20694-4f1a-4580-8022-66165419f596/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/bubblesort-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_74c20694-4f1a-4580-8022-66165419f596/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_74c20694-4f1a-4580-8022-66165419f596/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 32bit --witnessprinter.graph.data.programhash c685955ff6c809f32f6abe44f773ce6a6ae39f94 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 15:52:09,651 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 15:52:09,652 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 15:52:09,658 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 15:52:09,658 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 15:52:09,659 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 15:52:09,660 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 15:52:09,661 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 15:52:09,661 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 15:52:09,662 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 15:52:09,662 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 15:52:09,662 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 15:52:09,663 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 15:52:09,663 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 15:52:09,664 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 15:52:09,664 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 15:52:09,665 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 15:52:09,666 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 15:52:09,667 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 15:52:09,668 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 15:52:09,668 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 15:52:09,669 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 15:52:09,670 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 15:52:09,670 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 15:52:09,670 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 15:52:09,671 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 15:52:09,671 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 15:52:09,672 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 15:52:09,672 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 15:52:09,673 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 15:52:09,673 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 15:52:09,674 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 15:52:09,674 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 15:52:09,674 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 15:52:09,674 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 15:52:09,675 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 15:52:09,675 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_74c20694-4f1a-4580-8022-66165419f596/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-09 15:52:09,683 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 15:52:09,683 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 15:52:09,684 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 15:52:09,684 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 15:52:09,684 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 15:52:09,684 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-09 15:52:09,684 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-09 15:52:09,685 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-09 15:52:09,685 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-09 15:52:09,685 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-09 15:52:09,685 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-09 15:52:09,685 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 15:52:09,685 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 15:52:09,685 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 15:52:09,685 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 15:52:09,686 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 15:52:09,686 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 15:52:09,686 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-09 15:52:09,686 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-09 15:52:09,686 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-09 15:52:09,686 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 15:52:09,686 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 15:52:09,686 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-09 15:52:09,687 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 15:52:09,687 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-09 15:52:09,687 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 15:52:09,687 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 15:52:09,687 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-09 15:52:09,687 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 15:52:09,687 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 15:52:09,687 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-09 15:52:09,688 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-09 15:52:09,688 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_74c20694-4f1a-4580-8022-66165419f596/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c685955ff6c809f32f6abe44f773ce6a6ae39f94 [2018-12-09 15:52:09,706 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 15:52:09,714 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 15:52:09,717 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 15:52:09,718 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 15:52:09,718 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 15:52:09,719 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_74c20694-4f1a-4580-8022-66165419f596/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/bubblesort-alloca_true-valid-memsafety_true-termination.i [2018-12-09 15:52:09,763 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_74c20694-4f1a-4580-8022-66165419f596/bin-2019/uautomizer/data/e76a1c487/e0fb3f3148534aec8091ea77635fd9f9/FLAGa3c7270da [2018-12-09 15:52:10,125 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 15:52:10,125 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_74c20694-4f1a-4580-8022-66165419f596/sv-benchmarks/c/array-memsafety/bubblesort-alloca_true-valid-memsafety_true-termination.i [2018-12-09 15:52:10,130 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_74c20694-4f1a-4580-8022-66165419f596/bin-2019/uautomizer/data/e76a1c487/e0fb3f3148534aec8091ea77635fd9f9/FLAGa3c7270da [2018-12-09 15:52:10,512 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_74c20694-4f1a-4580-8022-66165419f596/bin-2019/uautomizer/data/e76a1c487/e0fb3f3148534aec8091ea77635fd9f9 [2018-12-09 15:52:10,518 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 15:52:10,521 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 15:52:10,522 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 15:52:10,522 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 15:52:10,527 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 15:52:10,528 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:52:10" (1/1) ... [2018-12-09 15:52:10,530 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f5a650c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:52:10, skipping insertion in model container [2018-12-09 15:52:10,531 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:52:10" (1/1) ... [2018-12-09 15:52:10,537 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 15:52:10,556 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 15:52:10,695 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 15:52:10,702 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 15:52:10,764 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 15:52:10,790 INFO L195 MainTranslator]: Completed translation [2018-12-09 15:52:10,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:52:10 WrapperNode [2018-12-09 15:52:10,791 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 15:52:10,791 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 15:52:10,791 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 15:52:10,791 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 15:52:10,798 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:52:10" (1/1) ... [2018-12-09 15:52:10,809 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:52:10" (1/1) ... [2018-12-09 15:52:10,824 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 15:52:10,825 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 15:52:10,825 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 15:52:10,825 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 15:52:10,830 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:52:10" (1/1) ... [2018-12-09 15:52:10,830 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:52:10" (1/1) ... [2018-12-09 15:52:10,831 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:52:10" (1/1) ... [2018-12-09 15:52:10,832 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:52:10" (1/1) ... [2018-12-09 15:52:10,835 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:52:10" (1/1) ... [2018-12-09 15:52:10,837 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:52:10" (1/1) ... [2018-12-09 15:52:10,838 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:52:10" (1/1) ... [2018-12-09 15:52:10,839 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 15:52:10,839 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 15:52:10,839 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 15:52:10,839 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 15:52:10,840 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:52:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_74c20694-4f1a-4580-8022-66165419f596/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-09 15:52:10,872 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 15:52:10,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 15:52:10,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 15:52:10,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 15:52:10,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 15:52:10,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 15:52:10,986 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 15:52:10,986 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 15:52:10,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:52:10 BoogieIcfgContainer [2018-12-09 15:52:10,987 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 15:52:10,987 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-09 15:52:10,987 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-09 15:52:10,989 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-09 15:52:10,990 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 15:52:10,990 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.12 03:52:10" (1/3) ... [2018-12-09 15:52:10,991 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@73486567 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 03:52:10, skipping insertion in model container [2018-12-09 15:52:10,991 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 15:52:10,991 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:52:10" (2/3) ... [2018-12-09 15:52:10,991 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@73486567 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 03:52:10, skipping insertion in model container [2018-12-09 15:52:10,991 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 15:52:10,991 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:52:10" (3/3) ... [2018-12-09 15:52:10,992 INFO L375 chiAutomizerObserver]: Analyzing ICFG bubblesort-alloca_true-valid-memsafety_true-termination.i [2018-12-09 15:52:11,026 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 15:52:11,026 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-09 15:52:11,026 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-09 15:52:11,026 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-09 15:52:11,026 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 15:52:11,027 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 15:52:11,027 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-09 15:52:11,027 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 15:52:11,027 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-09 15:52:11,035 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-12-09 15:52:11,047 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 15:52:11,048 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 15:52:11,048 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 15:52:11,051 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-09 15:52:11,051 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-09 15:52:11,052 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-09 15:52:11,052 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-12-09 15:52:11,052 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 15:52:11,052 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 15:52:11,052 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 15:52:11,053 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-09 15:52:11,053 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-09 15:52:11,057 INFO L794 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5#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; 4#L555true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 6#L555-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; 11#L543-3true [2018-12-09 15:52:11,057 INFO L796 eck$LassoCheckResult]: Loop: 11#L543-3true assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 9#L544-3true assume !true; 10#L543-2true bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 11#L543-3true [2018-12-09 15:52:11,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:52:11,061 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2018-12-09 15:52:11,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:52:11,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:52:11,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:52:11,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:52:11,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:52:11,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:52:11,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:52:11,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:52:11,131 INFO L82 PathProgramCache]: Analyzing trace with hash 47218, now seen corresponding path program 1 times [2018-12-09 15:52:11,131 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:52:11,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:52:11,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:52:11,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:52:11,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:52:11,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:52:11,147 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-09 15:52:11,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:52:11,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 15:52:11,150 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 15:52:11,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-09 15:52:11,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-09 15:52:11,160 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 2 states. [2018-12-09 15:52:11,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:52:11,164 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2018-12-09 15:52:11,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-09 15:52:11,165 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2018-12-09 15:52:11,166 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 15:52:11,168 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 9 states and 12 transitions. [2018-12-09 15:52:11,169 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-12-09 15:52:11,169 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-12-09 15:52:11,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 12 transitions. [2018-12-09 15:52:11,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 15:52:11,170 INFO L705 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2018-12-09 15:52:11,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 12 transitions. [2018-12-09 15:52:11,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-09 15:52:11,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-09 15:52:11,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2018-12-09 15:52:11,186 INFO L728 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2018-12-09 15:52:11,186 INFO L608 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2018-12-09 15:52:11,186 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-09 15:52:11,186 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 12 transitions. [2018-12-09 15:52:11,186 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-09 15:52:11,186 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 15:52:11,187 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 15:52:11,187 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-09 15:52:11,187 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-09 15:52:11,187 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#L555 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 36#L555-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; 37#L543-3 [2018-12-09 15:52:11,187 INFO L796 eck$LassoCheckResult]: Loop: 37#L543-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 39#L544-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 41#L543-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 37#L543-3 [2018-12-09 15:52:11,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:52:11,187 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2018-12-09 15:52:11,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:52:11,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:52:11,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:52:11,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:52:11,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:52:11,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:52:11,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:52:11,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:52:11,199 INFO L82 PathProgramCache]: Analyzing trace with hash 46877, now seen corresponding path program 1 times [2018-12-09 15:52:11,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:52:11,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:52:11,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:52:11,199 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 15:52:11,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:52:11,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:52:11,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:52:11,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:52:11,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818489, now seen corresponding path program 1 times [2018-12-09 15:52:11,203 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:52:11,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:52:11,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:52:11,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:52:11,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:52:11,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:52:11,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:52:11,245 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 15:52:11,245 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 15:52:11,245 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 15:52:11,245 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 15:52:11,246 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-09 15:52:11,246 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 15:52:11,246 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 15:52:11,246 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 15:52:11,246 INFO L131 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca_true-valid-memsafety_true-termination.i_Iteration2_Loop [2018-12-09 15:52:11,246 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 15:52:11,246 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 15:52:11,258 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-09 15:52:11,262 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-09 15:52:11,300 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 15:52:11,300 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_74c20694-4f1a-4580-8022-66165419f596/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-09 15:52:11,303 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 15:52:11,304 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 15:52:11,313 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 15:52:11,313 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_74c20694-4f1a-4580-8022-66165419f596/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-09 15:52:11,338 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 15:52:11,338 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_74c20694-4f1a-4580-8022-66165419f596/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-09 15:52:11,355 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-09 15:52:11,355 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 15:52:11,375 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-09 15:52:11,376 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 15:52:11,376 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 15:52:11,376 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 15:52:11,376 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 15:52:11,376 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 15:52:11,376 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 15:52:11,376 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 15:52:11,376 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 15:52:11,376 INFO L131 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca_true-valid-memsafety_true-termination.i_Iteration2_Loop [2018-12-09 15:52:11,376 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 15:52:11,377 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 15:52:11,377 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-09 15:52:11,379 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-09 15:52:11,420 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 15:52:11,423 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 15:52:11,424 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-09 15:52:11,425 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:52:11,426 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:52:11,426 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:52:11,426 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:52:11,426 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:52:11,427 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:52:11,427 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:52:11,430 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:52:11,430 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-09 15:52:11,431 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:52:11,431 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:52:11,431 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:52:11,431 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:52:11,431 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:52:11,432 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:52:11,432 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:52:11,435 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 15:52:11,438 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 15:52:11,438 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-09 15:52:11,439 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 15:52:11,439 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-09 15:52:11,439 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 15:52:11,439 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-09 15:52:11,440 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-09 15:52:11,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:52:11,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:52:11,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:52:11,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:52:11,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:52:11,478 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-09 15:52:11,480 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-09 15:52:11,480 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 12 transitions. cyclomatic complexity: 4 Second operand 3 states. [2018-12-09 15:52:11,503 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-09 15:52:11,503 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-09 15:52:11,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 15:52:11,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2018-12-09 15:52:11,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 4 letters. Loop has 3 letters. [2018-12-09 15:52:11,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 15:52:11,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 7 letters. Loop has 3 letters. [2018-12-09 15:52:11,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 15:52:11,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 4 letters. Loop has 6 letters. [2018-12-09 15:52:11,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 15:52:11,507 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 22 transitions. [2018-12-09 15:52:11,507 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-09 15:52:11,508 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 14 states and 20 transitions. [2018-12-09 15:52:11,508 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-12-09 15:52:11,508 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-12-09 15:52:11,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 20 transitions. [2018-12-09 15:52:11,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 15:52:11,508 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2018-12-09 15:52:11,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 20 transitions. [2018-12-09 15:52:11,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-12-09 15:52:11,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-09 15:52:11,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2018-12-09 15:52:11,509 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2018-12-09 15:52:11,510 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2018-12-09 15:52:11,510 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-09 15:52:11,510 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 19 transitions. [2018-12-09 15:52:11,510 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-09 15:52:11,510 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 15:52:11,510 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 15:52:11,510 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-09 15:52:11,511 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-09 15:52:11,511 INFO L794 eck$LassoCheckResult]: Stem: 107#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 99#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; 100#L555 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 101#L555-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; 102#L543-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 104#L544-3 [2018-12-09 15:52:11,511 INFO L796 eck$LassoCheckResult]: Loop: 104#L544-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); 108#L545 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); 103#L544-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 104#L544-3 [2018-12-09 15:52:11,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:52:11,511 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2018-12-09 15:52:11,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:52:11,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:52:11,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:52:11,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:52:11,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:52:11,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:52:11,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:52:11,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:52:11,521 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 1 times [2018-12-09 15:52:11,521 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:52:11,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:52:11,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:52:11,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:52:11,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:52:11,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:52:11,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:52:11,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:52:11,530 INFO L82 PathProgramCache]: Analyzing trace with hash 176800017, now seen corresponding path program 1 times [2018-12-09 15:52:11,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:52:11,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:52:11,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:52:11,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:52:11,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:52:11,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:52:11,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:52:11,715 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 15:52:11,715 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 15:52:11,715 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 15:52:11,715 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 15:52:11,715 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 15:52:11,715 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 15:52:11,715 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 15:52:11,715 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 15:52:11,715 INFO L131 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2018-12-09 15:52:11,715 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 15:52:11,715 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 15:52:11,719 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-09 15:52:11,721 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-09 15:52:11,821 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-09 15:52:11,822 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-09 15:52:11,824 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-09 15:52:11,826 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-09 15:52:11,827 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-09 15:52:11,829 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-09 15:52:11,830 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-09 15:52:11,832 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-09 15:52:11,833 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-09 15:52:12,007 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 15:52:12,007 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 15:52:12,008 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-09 15:52:12,008 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:52:12,008 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:52:12,008 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:52:12,008 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:52:12,008 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:52:12,009 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:52:12,009 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:52:12,009 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:52:12,009 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-09 15:52:12,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:52:12,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:52:12,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:52:12,010 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:52:12,013 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:52:12,013 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 15:52:12,037 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 15:52:12,049 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 15:52:12,049 INFO L444 ModelExtractionUtils]: 33 out of 37 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-09 15:52:12,050 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 15:52:12,051 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 15:52:12,051 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 15:52:12,051 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-09 15:52:12,059 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-12-09 15:52:12,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:52:12,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:52:12,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:52:12,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:52:12,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:52:12,095 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-09 15:52:12,095 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-09 15:52:12,095 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 19 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-12-09 15:52:12,107 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-09 15:52:12,108 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-09 15:52:12,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 15:52:12,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-12-09 15:52:12,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 5 letters. Loop has 3 letters. [2018-12-09 15:52:12,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 15:52:12,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 3 letters. [2018-12-09 15:52:12,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 15:52:12,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 5 letters. Loop has 6 letters. [2018-12-09 15:52:12,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 15:52:12,109 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 41 transitions. [2018-12-09 15:52:12,110 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-09 15:52:12,110 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 18 states and 26 transitions. [2018-12-09 15:52:12,110 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-12-09 15:52:12,110 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-12-09 15:52:12,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 26 transitions. [2018-12-09 15:52:12,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 15:52:12,110 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2018-12-09 15:52:12,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 26 transitions. [2018-12-09 15:52:12,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 13. [2018-12-09 15:52:12,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-09 15:52:12,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2018-12-09 15:52:12,111 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2018-12-09 15:52:12,111 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2018-12-09 15:52:12,111 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-09 15:52:12,111 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2018-12-09 15:52:12,112 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-09 15:52:12,112 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 15:52:12,112 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 15:52:12,112 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2018-12-09 15:52:12,112 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-09 15:52:12,112 INFO L794 eck$LassoCheckResult]: Stem: 212#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 204#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; 205#L555 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 206#L555-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; 207#L543-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 211#L544-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 214#L543-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 216#L543-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 209#L544-3 [2018-12-09 15:52:12,112 INFO L796 eck$LassoCheckResult]: Loop: 209#L544-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); 213#L545 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); 208#L544-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 209#L544-3 [2018-12-09 15:52:12,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:52:12,112 INFO L82 PathProgramCache]: Analyzing trace with hash 176798328, now seen corresponding path program 2 times [2018-12-09 15:52:12,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:52:12,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:52:12,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:52:12,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:52:12,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:52:12,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:52:12,135 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-09 15:52:12,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:52:12,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 15:52:12,135 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 15:52:12,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:52:12,135 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 2 times [2018-12-09 15:52:12,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:52:12,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:52:12,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:52:12,136 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 15:52:12,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:52:12,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:52:12,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:52:12,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 15:52:12,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 15:52:12,188 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand 5 states. [2018-12-09 15:52:12,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:52:12,208 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions. [2018-12-09 15:52:12,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 15:52:12,209 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2018-12-09 15:52:12,209 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-09 15:52:12,210 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 19 states and 26 transitions. [2018-12-09 15:52:12,210 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-12-09 15:52:12,210 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-09 15:52:12,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 26 transitions. [2018-12-09 15:52:12,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 15:52:12,210 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2018-12-09 15:52:12,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 26 transitions. [2018-12-09 15:52:12,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 14. [2018-12-09 15:52:12,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-09 15:52:12,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2018-12-09 15:52:12,212 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-12-09 15:52:12,212 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-12-09 15:52:12,212 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-09 15:52:12,212 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2018-12-09 15:52:12,213 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-09 15:52:12,213 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 15:52:12,213 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 15:52:12,213 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:52:12,214 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-09 15:52:12,214 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#L555 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 252#L555-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; 253#L543-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 260#L544-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); 261#L545 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4; 256#L544-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 257#L544-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 262#L543-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 263#L543-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 255#L544-3 [2018-12-09 15:52:12,214 INFO L796 eck$LassoCheckResult]: Loop: 255#L544-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); 259#L545 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); 254#L544-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 255#L544-3 [2018-12-09 15:52:12,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:52:12,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1421271829, now seen corresponding path program 1 times [2018-12-09 15:52:12,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:52:12,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:52:12,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:52:12,215 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 15:52:12,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:52:12,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:52:12,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:52:12,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:52:12,229 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 3 times [2018-12-09 15:52:12,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:52:12,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:52:12,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:52:12,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:52:12,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:52:12,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:52:12,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:52:12,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:52:12,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1321478696, now seen corresponding path program 1 times [2018-12-09 15:52:12,238 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:52:12,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:52:12,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:52:12,239 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 15:52:12,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:52:12,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:52:12,291 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-09 15:52:12,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 15:52:12,291 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_74c20694-4f1a-4580-8022-66165419f596/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 15:52:12,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:52:12,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:52:12,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:52:12,335 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-09 15:52:12,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 15:52:12,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-12-09 15:52:12,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 15:52:12,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-09 15:52:12,399 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand 12 states. [2018-12-09 15:52:12,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:52:12,445 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2018-12-09 15:52:12,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 15:52:12,446 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 38 transitions. [2018-12-09 15:52:12,446 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-09 15:52:12,447 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 25 states and 34 transitions. [2018-12-09 15:52:12,447 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-12-09 15:52:12,447 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-12-09 15:52:12,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 34 transitions. [2018-12-09 15:52:12,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 15:52:12,448 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2018-12-09 15:52:12,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 34 transitions. [2018-12-09 15:52:12,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2018-12-09 15:52:12,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-09 15:52:12,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2018-12-09 15:52:12,450 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2018-12-09 15:52:12,450 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2018-12-09 15:52:12,450 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-09 15:52:12,450 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2018-12-09 15:52:12,450 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-09 15:52:12,451 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 15:52:12,451 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 15:52:12,451 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-09 15:52:12,451 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-09 15:52:12,451 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#L555 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 357#L555-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; 358#L543-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 368#L544-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); 371#L545 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4; 361#L544-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 362#L544-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); 365#L545 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4; 369#L544-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 370#L544-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 366#L543-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 367#L543-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 360#L544-3 [2018-12-09 15:52:12,452 INFO L796 eck$LassoCheckResult]: Loop: 360#L544-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); 364#L545 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); 359#L544-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 360#L544-3 [2018-12-09 15:52:12,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:52:12,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1373641048, now seen corresponding path program 2 times [2018-12-09 15:52:12,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:52:12,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:52:12,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:52:12,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:52:12,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:52:12,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:52:12,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:52:12,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:52:12,469 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 4 times [2018-12-09 15:52:12,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:52:12,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:52:12,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:52:12,470 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 15:52:12,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:52:12,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:52:12,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:52:12,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:52:12,476 INFO L82 PathProgramCache]: Analyzing trace with hash -307910395, now seen corresponding path program 2 times [2018-12-09 15:52:12,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:52:12,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:52:12,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:52:12,477 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 15:52:12,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:52:12,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:52:12,690 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-09 15:52:12,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 15:52:12,690 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_74c20694-4f1a-4580-8022-66165419f596/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 15:52:12,698 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 15:52:12,710 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 15:52:12,710 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 15:52:12,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:52:12,766 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-09 15:52:12,769 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-09 15:52:12,769 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:12,770 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:12,771 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-09 15:52:12,771 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-12-09 15:52:12,781 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-09 15:52:12,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 15:52:12,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 12 [2018-12-09 15:52:12,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 15:52:12,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-12-09 15:52:12,840 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. cyclomatic complexity: 8 Second operand 12 states. [2018-12-09 15:52:12,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:52:12,899 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2018-12-09 15:52:12,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 15:52:12,900 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 50 transitions. [2018-12-09 15:52:12,900 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-12-09 15:52:12,901 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 50 transitions. [2018-12-09 15:52:12,902 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-12-09 15:52:12,902 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-12-09 15:52:12,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 50 transitions. [2018-12-09 15:52:12,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 15:52:12,902 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 50 transitions. [2018-12-09 15:52:12,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 50 transitions. [2018-12-09 15:52:12,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2018-12-09 15:52:12,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-09 15:52:12,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2018-12-09 15:52:12,904 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2018-12-09 15:52:12,904 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2018-12-09 15:52:12,904 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-09 15:52:12,904 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 35 transitions. [2018-12-09 15:52:12,904 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-09 15:52:12,904 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 15:52:12,904 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 15:52:12,905 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:52:12,905 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-09 15:52:12,905 INFO L794 eck$LassoCheckResult]: Stem: 484#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 476#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; 477#L555 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 478#L555-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; 479#L543-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 490#L544-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#L545 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4; 482#L544-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 483#L544-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); 487#L545 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); 493#L544-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 497#L544-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 488#L543-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 489#L543-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 481#L544-3 [2018-12-09 15:52:12,905 INFO L796 eck$LassoCheckResult]: Loop: 481#L544-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#L545 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); 480#L544-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 481#L544-3 [2018-12-09 15:52:12,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:52:12,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1371794006, now seen corresponding path program 3 times [2018-12-09 15:52:12,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:52:12,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:52:12,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:52:12,906 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 15:52:12,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:52:12,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:52:12,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:52:12,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:52:12,917 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 5 times [2018-12-09 15:52:12,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:52:12,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:52:12,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:52:12,918 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 15:52:12,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:52:12,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:52:12,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:52:12,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:52:12,923 INFO L82 PathProgramCache]: Analyzing trace with hash 501436231, now seen corresponding path program 4 times [2018-12-09 15:52:12,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:52:12,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:52:12,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:52:12,924 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 15:52:12,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:52:12,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:52:12,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:52:13,171 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 99 [2018-12-09 15:52:13,215 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 15:52:13,215 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 15:52:13,215 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 15:52:13,215 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 15:52:13,215 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 15:52:13,215 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 15:52:13,215 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 15:52:13,215 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 15:52:13,215 INFO L131 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca_true-valid-memsafety_true-termination.i_Iteration7_Lasso [2018-12-09 15:52:13,215 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 15:52:13,215 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 15:52:13,217 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-09 15:52:13,218 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-09 15:52:13,219 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-09 15:52:13,222 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-09 15:52:13,223 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-09 15:52:13,352 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-09 15:52:13,353 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-09 15:52:13,354 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-09 15:52:13,355 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-09 15:52:13,356 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-09 15:52:13,357 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-09 15:52:13,501 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 15:52:13,501 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 15:52:13,501 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-09 15:52:13,501 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:52:13,501 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:52:13,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:52:13,502 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:52:13,502 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:52:13,502 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:52:13,502 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:52:13,502 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:52:13,503 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-09 15:52:13,503 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:52:13,503 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:52:13,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:52:13,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:52:13,503 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:52:13,503 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:52:13,503 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:52:13,504 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:52:13,504 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-09 15:52:13,504 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:52:13,504 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:52:13,504 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:52:13,504 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:52:13,505 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:52:13,505 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 15:52:13,506 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:52:13,506 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-09 15:52:13,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:52:13,506 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 15:52:13,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:52:13,506 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:52:13,506 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:52:13,506 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 15:52:13,506 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 15:52:13,507 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 15:52:13,507 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-09 15:52:13,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 15:52:13,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 15:52:13,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 15:52:13,507 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 15:52:13,508 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 15:52:13,509 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 15:52:13,523 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 15:52:13,540 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-12-09 15:52:13,540 INFO L444 ModelExtractionUtils]: 27 out of 37 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-12-09 15:52:13,540 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 15:52:13,541 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-12-09 15:52:13,541 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 15:52:13,541 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_bubbleSort_~i~0, ULTIMATE.start_bubbleSort_~j~0) = 3*ULTIMATE.start_bubbleSort_~i~0 - 1*ULTIMATE.start_bubbleSort_~j~0 Supporting invariants [4*ULTIMATE.start_bubbleSort_~j~0 - 1 >= 0] [2018-12-09 15:52:13,554 INFO L297 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2018-12-09 15:52:13,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:52:13,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:52:13,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:52:13,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:52:13,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:52:13,599 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-09 15:52:13,599 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-09 15:52:13,600 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11 Second operand 3 states. [2018-12-09 15:52:13,620 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-09 15:52:13,620 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-09 15:52:13,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 15:52:13,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-12-09 15:52:13,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 14 letters. Loop has 3 letters. [2018-12-09 15:52:13,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 15:52:13,621 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 15:52:13,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:52:13,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:52:13,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:52:13,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:52:13,647 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:52:13,656 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-09 15:52:13,656 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-09 15:52:13,656 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11 Second operand 3 states. [2018-12-09 15:52:13,676 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-09 15:52:13,676 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-09 15:52:13,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 15:52:13,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-12-09 15:52:13,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 14 letters. Loop has 3 letters. [2018-12-09 15:52:13,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 15:52:13,676 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 15:52:13,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:52:13,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:52:13,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:52:13,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:52:13,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:52:13,706 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-09 15:52:13,706 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-09 15:52:13,706 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11 Second operand 3 states. [2018-12-09 15:52:13,725 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-09 15:52:13,725 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-09 15:52:13,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 15:52:13,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2018-12-09 15:52:13,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 14 letters. Loop has 3 letters. [2018-12-09 15:52:13,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 15:52:13,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 17 letters. Loop has 3 letters. [2018-12-09 15:52:13,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 15:52:13,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 14 letters. Loop has 6 letters. [2018-12-09 15:52:13,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 15:52:13,726 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 58 transitions. [2018-12-09 15:52:13,727 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 15:52:13,727 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2018-12-09 15:52:13,727 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-09 15:52:13,727 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-09 15:52:13,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-09 15:52:13,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 15:52:13,727 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 15:52:13,727 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 15:52:13,727 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 15:52:13,727 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-09 15:52:13,728 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-09 15:52:13,728 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 15:52:13,728 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-09 15:52:13,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.12 03:52:13 BoogieIcfgContainer [2018-12-09 15:52:13,732 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-09 15:52:13,732 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 15:52:13,732 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 15:52:13,732 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 15:52:13,732 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:52:10" (3/4) ... [2018-12-09 15:52:13,734 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 15:52:13,734 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 15:52:13,735 INFO L168 Benchmark]: Toolchain (without parser) took 3216.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 175.1 MB). Free memory was 956.7 MB in the beginning and 815.2 MB in the end (delta: 141.5 MB). Peak memory consumption was 316.6 MB. Max. memory is 11.5 GB. [2018-12-09 15:52:13,735 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 15:52:13,736 INFO L168 Benchmark]: CACSL2BoogieTranslator took 268.66 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 61.3 MB). Free memory was 956.7 MB in the beginning and 1.0 GB in the end (delta: -86.1 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2018-12-09 15:52:13,736 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.38 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 15:52:13,736 INFO L168 Benchmark]: Boogie Preprocessor took 14.56 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 15:52:13,736 INFO L168 Benchmark]: RCFGBuilder took 147.48 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. [2018-12-09 15:52:13,737 INFO L168 Benchmark]: BuchiAutomizer took 2744.67 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 113.8 MB). Free memory was 1.0 GB in the beginning and 815.2 MB in the end (delta: 208.5 MB). Peak memory consumption was 322.2 MB. Max. memory is 11.5 GB. [2018-12-09 15:52:13,737 INFO L168 Benchmark]: Witness Printer took 2.63 ms. Allocated memory is still 1.2 GB. Free memory is still 815.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 15:52:13,738 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 268.66 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 61.3 MB). Free memory was 956.7 MB in the beginning and 1.0 GB in the end (delta: -86.1 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.38 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.56 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 147.48 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2744.67 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 113.8 MB). Free memory was 1.0 GB in the beginning and 815.2 MB in the end (delta: 208.5 MB). Peak memory consumption was 322.2 MB. Max. memory is 11.5 GB. * Witness Printer took 2.63 ms. Allocated memory is still 1.2 GB. Free memory is still 815.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 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 3 * i + -1 * j 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.1s. Büchi inclusion checks took 0.3s. 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: 83 SDtfs, 87 SDslu, 91 SDs, 0 SdLazy, 180 SolverSat, 39 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT1 conc2 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital110 mio100 ax100 hnf96 lsp98 ukn80 mio100 lsp81 div100 bol100 ite100 ukn100 eq171 hnf90 smp88 dnf100 smp100 tf104 neg100 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 41ms VariablesStem: 11 VariablesLoop: 6 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 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...