./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/bubblesort-alloca-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_aa20117d-8c29-4e2a-ae69-af58e49e8f25/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_aa20117d-8c29-4e2a-ae69-af58e49e8f25/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_aa20117d-8c29-4e2a-ae69-af58e49e8f25/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_aa20117d-8c29-4e2a-ae69-af58e49e8f25/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/bubblesort-alloca-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_aa20117d-8c29-4e2a-ae69-af58e49e8f25/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_aa20117d-8c29-4e2a-ae69-af58e49e8f25/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash cb74f7a1bb788b2c5a3efb057591b3727e299c90 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 21:42:58,747 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:42:58,748 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:42:58,763 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:42:58,763 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:42:58,764 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:42:58,766 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:42:58,775 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:42:58,779 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:42:58,783 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:42:58,785 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:42:58,787 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:42:58,787 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:42:58,789 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:42:58,790 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:42:58,791 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:42:58,792 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:42:58,793 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:42:58,795 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:42:58,798 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:42:58,801 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:42:58,803 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:42:58,806 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:42:58,807 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:42:58,809 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:42:58,809 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:42:58,810 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:42:58,811 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:42:58,812 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:42:58,812 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:42:58,812 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:42:58,813 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:42:58,814 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:42:58,814 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:42:58,816 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:42:58,816 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:42:58,817 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:42:58,817 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:42:58,817 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:42:58,818 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:42:58,818 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:42:58,819 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_aa20117d-8c29-4e2a-ae69-af58e49e8f25/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 21:42:58,846 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:42:58,856 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:42:58,857 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:42:58,857 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:42:58,858 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:42:58,858 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 21:42:58,858 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 21:42:58,858 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 21:42:58,859 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 21:42:58,859 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 21:42:58,859 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 21:42:58,859 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:42:58,859 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 21:42:58,860 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:42:58,861 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:42:58,861 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 21:42:58,861 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 21:42:58,861 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 21:42:58,862 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:42:58,862 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 21:42:58,862 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:42:58,862 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 21:42:58,863 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:42:58,863 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:42:58,863 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 21:42:58,863 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:42:58,864 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:42:58,864 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 21:42:58,865 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 21:42:58,867 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_aa20117d-8c29-4e2a-ae69-af58e49e8f25/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cb74f7a1bb788b2c5a3efb057591b3727e299c90 [2019-11-15 21:42:58,900 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:42:58,914 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:42:58,918 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:42:58,919 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:42:58,921 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:42:58,922 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_aa20117d-8c29-4e2a-ae69-af58e49e8f25/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/bubblesort-alloca-1.i [2019-11-15 21:42:58,980 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_aa20117d-8c29-4e2a-ae69-af58e49e8f25/bin/uautomizer/data/e41c53ed7/6ffb9b0202084945a5c5b35e8c3a27fe/FLAG300f26042 [2019-11-15 21:42:59,438 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:42:59,442 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_aa20117d-8c29-4e2a-ae69-af58e49e8f25/sv-benchmarks/c/termination-memory-alloca/bubblesort-alloca-1.i [2019-11-15 21:42:59,462 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_aa20117d-8c29-4e2a-ae69-af58e49e8f25/bin/uautomizer/data/e41c53ed7/6ffb9b0202084945a5c5b35e8c3a27fe/FLAG300f26042 [2019-11-15 21:42:59,741 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_aa20117d-8c29-4e2a-ae69-af58e49e8f25/bin/uautomizer/data/e41c53ed7/6ffb9b0202084945a5c5b35e8c3a27fe [2019-11-15 21:42:59,744 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:42:59,745 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:42:59,749 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:42:59,749 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:42:59,754 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:42:59,755 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:42:59" (1/1) ... [2019-11-15 21:42:59,757 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2afdec8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:42:59, skipping insertion in model container [2019-11-15 21:42:59,757 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:42:59" (1/1) ... [2019-11-15 21:42:59,764 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:42:59,812 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:43:00,136 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:43:00,145 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:43:00,209 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:43:00,262 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:43:00,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:43:00 WrapperNode [2019-11-15 21:43:00,262 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:43:00,263 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:43:00,263 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:43:00,263 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:43:00,271 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:43:00" (1/1) ... [2019-11-15 21:43:00,283 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:43:00" (1/1) ... [2019-11-15 21:43:00,302 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:43:00,302 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:43:00,302 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:43:00,302 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:43:00,311 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:43:00" (1/1) ... [2019-11-15 21:43:00,312 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:43:00" (1/1) ... [2019-11-15 21:43:00,314 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:43:00" (1/1) ... [2019-11-15 21:43:00,315 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:43:00" (1/1) ... [2019-11-15 21:43:00,320 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:43:00" (1/1) ... [2019-11-15 21:43:00,324 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:43:00" (1/1) ... [2019-11-15 21:43:00,326 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:43:00" (1/1) ... [2019-11-15 21:43:00,328 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:43:00,328 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:43:00,329 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:43:00,329 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:43:00,330 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:43:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_aa20117d-8c29-4e2a-ae69-af58e49e8f25/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:43:00,391 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 21:43:00,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 21:43:00,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 21:43:00,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 21:43:00,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:43:00,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:43:00,655 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:43:00,655 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 21:43:00,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:43:00 BoogieIcfgContainer [2019-11-15 21:43:00,656 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:43:00,657 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 21:43:00,657 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 21:43:00,661 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 21:43:00,662 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:43:00,662 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 09:42:59" (1/3) ... [2019-11-15 21:43:00,663 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@28ab700f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 09:43:00, skipping insertion in model container [2019-11-15 21:43:00,664 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:43:00,664 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:43:00" (2/3) ... [2019-11-15 21:43:00,664 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@28ab700f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 09:43:00, skipping insertion in model container [2019-11-15 21:43:00,664 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:43:00,664 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:43:00" (3/3) ... [2019-11-15 21:43:00,666 INFO L371 chiAutomizerObserver]: Analyzing ICFG bubblesort-alloca-1.i [2019-11-15 21:43:00,710 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 21:43:00,711 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 21:43:00,711 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 21:43:00,711 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:43:00,711 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:43:00,711 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 21:43:00,711 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:43:00,711 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 21:43:00,725 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-11-15 21:43:00,751 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 21:43:00,751 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:43:00,751 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:43:00,758 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-15 21:43:00,758 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 21:43:00,758 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 21:43:00,758 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-11-15 21:43:00,762 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 21:43:00,763 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:43:00,763 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:43:00,763 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-15 21:43:00,763 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 21:43:00,771 INFO L791 eck$LassoCheckResult]: Stem: 9#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 11#L562true assume !(main_~array_size~0 < 1); 13#L562-2true call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset, bubbleSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc bubbleSort_#t~mem4, bubbleSort_#t~mem5, bubbleSort_#t~mem6, bubbleSort_#t~mem7, bubbleSort_#t~post3, bubbleSort_#t~post2, bubbleSort_~numbers.base, bubbleSort_~numbers.offset, bubbleSort_~array_size, bubbleSort_~i~0, bubbleSort_~j~0, bubbleSort_~temp~0;bubbleSort_~numbers.base, bubbleSort_~numbers.offset := bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset;bubbleSort_~array_size := bubbleSort_#in~array_size;havoc bubbleSort_~i~0;havoc bubbleSort_~j~0;havoc bubbleSort_~temp~0;bubbleSort_~i~0 := bubbleSort_~array_size - 1; 5#L550-3true [2019-11-15 21:43:00,771 INFO L793 eck$LassoCheckResult]: Loop: 5#L550-3true assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 3#L551-3true assume !true; 4#L550-2true bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 5#L550-3true [2019-11-15 21:43:00,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:43:00,777 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-11-15 21:43:00,785 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:43:00,785 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687079194] [2019-11-15 21:43:00,785 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:00,786 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:00,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:43:00,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:43:00,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:43:00,946 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:43:00,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:43:00,947 INFO L82 PathProgramCache]: Analyzing trace with hash 47218, now seen corresponding path program 1 times [2019-11-15 21:43:00,947 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:43:00,947 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358337896] [2019-11-15 21:43:00,948 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:00,948 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:00,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:43:00,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:43:00,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:43:00,984 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358337896] [2019-11-15 21:43:00,984 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:43:00,984 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:43:00,985 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451720029] [2019-11-15 21:43:00,989 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:43:00,990 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:43:01,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-15 21:43:01,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 21:43:01,006 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 2 states. [2019-11-15 21:43:01,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:43:01,011 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2019-11-15 21:43:01,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 21:43:01,013 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2019-11-15 21:43:01,014 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 21:43:01,017 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 9 states and 12 transitions. [2019-11-15 21:43:01,018 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-15 21:43:01,018 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-15 21:43:01,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 12 transitions. [2019-11-15 21:43:01,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:43:01,019 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2019-11-15 21:43:01,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 12 transitions. [2019-11-15 21:43:01,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-11-15 21:43:01,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-15 21:43:01,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2019-11-15 21:43:01,044 INFO L711 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2019-11-15 21:43:01,044 INFO L591 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2019-11-15 21:43:01,044 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 21:43:01,044 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 12 transitions. [2019-11-15 21:43:01,045 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 21:43:01,045 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:43:01,045 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:43:01,045 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-15 21:43:01,045 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 21:43:01,046 INFO L791 eck$LassoCheckResult]: Stem: 40#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 34#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 35#L562 assume !(main_~array_size~0 < 1); 42#L562-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset, bubbleSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc bubbleSort_#t~mem4, bubbleSort_#t~mem5, bubbleSort_#t~mem6, bubbleSort_#t~mem7, bubbleSort_#t~post3, bubbleSort_#t~post2, bubbleSort_~numbers.base, bubbleSort_~numbers.offset, bubbleSort_~array_size, bubbleSort_~i~0, bubbleSort_~j~0, bubbleSort_~temp~0;bubbleSort_~numbers.base, bubbleSort_~numbers.offset := bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset;bubbleSort_~array_size := bubbleSort_#in~array_size;havoc bubbleSort_~i~0;havoc bubbleSort_~j~0;havoc bubbleSort_~temp~0;bubbleSort_~i~0 := bubbleSort_~array_size - 1; 39#L550-3 [2019-11-15 21:43:01,046 INFO L793 eck$LassoCheckResult]: Loop: 39#L550-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 36#L551-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 37#L550-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 39#L550-3 [2019-11-15 21:43:01,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:43:01,046 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2019-11-15 21:43:01,047 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:43:01,047 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235676626] [2019-11-15 21:43:01,047 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:01,047 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:01,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:43:01,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:43:01,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:43:01,078 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:43:01,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:43:01,079 INFO L82 PathProgramCache]: Analyzing trace with hash 46877, now seen corresponding path program 1 times [2019-11-15 21:43:01,079 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:43:01,079 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245890513] [2019-11-15 21:43:01,079 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:01,080 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:01,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:43:01,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:43:01,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:43:01,087 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:43:01,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:43:01,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818489, now seen corresponding path program 1 times [2019-11-15 21:43:01,088 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:43:01,089 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099496260] [2019-11-15 21:43:01,089 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:01,089 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:01,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:43:01,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:43:01,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:43:01,116 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:43:01,173 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:43:01,174 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:43:01,174 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:43:01,174 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:43:01,174 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 21:43:01,174 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:43:01,175 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:43:01,175 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:43:01,175 INFO L131 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-1.i_Iteration2_Loop [2019-11-15 21:43:01,175 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:43:01,176 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:43:01,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:43:01,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:43:01,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:43:01,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:43:01,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:43:01,394 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:43:01,406 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_aa20117d-8c29-4e2a-ae69-af58e49e8f25/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 21:43:01,440 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:43:01,440 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:43:01,459 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 21:43:01,460 INFO L440 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/run_dir_aa20117d-8c29-4e2a-ae69-af58e49e8f25/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:43:01,465 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:43:01,466 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 21:43:01,475 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 21:43:01,475 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~P_PID_1=1} Honda state: {v_rep~unnamed0~0~P_PID_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_aa20117d-8c29-4e2a-ae69-af58e49e8f25/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:43:01,486 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:43:01,486 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 21:43:01,493 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 21:43:01,493 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~P_PGID_1=2} Honda state: {v_rep~unnamed0~0~P_PGID_1=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_aa20117d-8c29-4e2a-ae69-af58e49e8f25/bin/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:43:01,498 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:43:01,498 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_aa20117d-8c29-4e2a-ae69-af58e49e8f25/bin/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:43:01,510 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 21:43:01,510 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 21:43:01,524 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 21:43:01,526 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:43:01,526 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:43:01,526 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:43:01,526 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:43:01,526 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:43:01,526 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:43:01,526 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:43:01,526 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:43:01,527 INFO L131 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-1.i_Iteration2_Loop [2019-11-15 21:43:01,527 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:43:01,527 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:43:01,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:43:01,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:43:01,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:43:01,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:43:01,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:43:01,663 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:43:01,668 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:43:01,669 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:43:01,671 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:43:01,671 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:43:01,671 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:43:01,672 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:43:01,672 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:43:01,674 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:43:01,674 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:43:01,679 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:43:01,681 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:43:01,681 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:43:01,681 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:43:01,682 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:43:01,682 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:43:01,682 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:43:01,683 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:43:01,683 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:43:01,695 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:43:01,706 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 21:43:01,710 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-15 21:43:01,711 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:43:01,712 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 21:43:01,712 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:43:01,712 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_bubbleSort_~i~0) = 2*ULTIMATE.start_bubbleSort_~i~0 + 1 Supporting invariants [] [2019-11-15 21:43:01,715 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 21:43:01,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:43:01,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:43:01,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:43:01,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:43:01,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:43:01,770 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 21:43:01,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:43:01,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:43:01,793 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 21:43:01,794 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 12 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-11-15 21:43:01,841 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. [2019-11-15 21:43:01,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 21:43:01,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 21:43:01,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2019-11-15 21:43:01,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 4 letters. Loop has 3 letters. [2019-11-15 21:43:01,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:43:01,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 7 letters. Loop has 3 letters. [2019-11-15 21:43:01,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:43:01,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 4 letters. Loop has 6 letters. [2019-11-15 21:43:01,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:43:01,847 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 22 transitions. [2019-11-15 21:43:01,848 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 21:43:01,849 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 14 states and 20 transitions. [2019-11-15 21:43:01,849 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-15 21:43:01,849 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-15 21:43:01,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 20 transitions. [2019-11-15 21:43:01,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:43:01,852 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2019-11-15 21:43:01,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 20 transitions. [2019-11-15 21:43:01,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-11-15 21:43:01,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-15 21:43:01,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2019-11-15 21:43:01,859 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2019-11-15 21:43:01,859 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2019-11-15 21:43:01,859 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 21:43:01,860 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 19 transitions. [2019-11-15 21:43:01,861 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 21:43:01,862 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:43:01,862 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:43:01,862 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 21:43:01,863 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 21:43:01,863 INFO L791 eck$LassoCheckResult]: Stem: 107#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 104#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 105#L562 assume !(main_~array_size~0 < 1); 111#L562-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset, bubbleSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc bubbleSort_#t~mem4, bubbleSort_#t~mem5, bubbleSort_#t~mem6, bubbleSort_#t~mem7, bubbleSort_#t~post3, bubbleSort_#t~post2, bubbleSort_~numbers.base, bubbleSort_~numbers.offset, bubbleSort_~array_size, bubbleSort_~i~0, bubbleSort_~j~0, bubbleSort_~temp~0;bubbleSort_~numbers.base, bubbleSort_~numbers.offset := bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset;bubbleSort_~array_size := bubbleSort_#in~array_size;havoc bubbleSort_~i~0;havoc bubbleSort_~j~0;havoc bubbleSort_~temp~0;bubbleSort_~i~0 := bubbleSort_~array_size - 1; 108#L550-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 99#L551-3 [2019-11-15 21:43:01,864 INFO L793 eck$LassoCheckResult]: Loop: 99#L551-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 100#L552 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 109#L551-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 99#L551-3 [2019-11-15 21:43:01,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:43:01,864 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2019-11-15 21:43:01,864 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:43:01,865 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186235705] [2019-11-15 21:43:01,865 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:01,865 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:01,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:43:01,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:43:01,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:43:01,903 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:43:01,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:43:01,903 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 1 times [2019-11-15 21:43:01,904 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:43:01,904 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083828007] [2019-11-15 21:43:01,904 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:01,904 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:01,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:43:01,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:43:01,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:43:01,926 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:43:01,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:43:01,926 INFO L82 PathProgramCache]: Analyzing trace with hash 176800017, now seen corresponding path program 1 times [2019-11-15 21:43:01,927 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:43:01,927 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902238996] [2019-11-15 21:43:01,927 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:01,927 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:01,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:43:01,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:43:01,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:43:01,994 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:43:02,262 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-11-15 21:43:02,337 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:43:02,338 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:43:02,338 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:43:02,338 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:43:02,338 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:43:02,338 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:43:02,339 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:43:02,339 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:43:02,339 INFO L131 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-1.i_Iteration3_Lasso [2019-11-15 21:43:02,339 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:43:02,339 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:43:02,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:43:02,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:43:02,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:43:02,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:43:02,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:43:02,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:43:02,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:43:02,548 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-11-15 21:43:02,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:43:02,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:43:02,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:43:02,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:43:02,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:43:02,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:43:02,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:43:03,074 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:43:03,074 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:43:03,075 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:43:03,076 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:43:03,076 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:43:03,076 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:43:03,076 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:43:03,076 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:43:03,077 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:43:03,077 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:43:03,080 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:43:03,081 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:43:03,083 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:43:03,084 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:43:03,084 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:43:03,084 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:43:03,084 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:43:03,088 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:43:03,088 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:43:03,089 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:43:03,089 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:43:03,090 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:43:03,090 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:43:03,090 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:43:03,090 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:43:03,090 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:43:03,091 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:43:03,091 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:43:03,092 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:43:03,092 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:43:03,093 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:43:03,093 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:43:03,093 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:43:03,093 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:43:03,095 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:43:03,095 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:43:03,098 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:43:03,099 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:43:03,099 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:43:03,099 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:43:03,099 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:43:03,099 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:43:03,100 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:43:03,100 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:43:03,100 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:43:03,101 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:43:03,102 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:43:03,102 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:43:03,102 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:43:03,102 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:43:03,103 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:43:03,104 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:43:03,104 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:43:03,108 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:43:03,108 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:43:03,109 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:43:03,109 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 21:43:03,109 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:43:03,109 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:43:03,113 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 21:43:03,113 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:43:03,137 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:43:03,138 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:43:03,138 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:43:03,139 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:43:03,139 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:43:03,139 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:43:03,145 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:43:03,145 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:43:03,254 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:43:03,324 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-15 21:43:03,324 INFO L444 ModelExtractionUtils]: 30 out of 37 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-11-15 21:43:03,325 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:43:03,326 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 21:43:03,327 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:43:03,327 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_bubbleSort_~numbers.offset, ULTIMATE.start_bubbleSort_~j~0, v_rep(select #length ULTIMATE.start_main_#t~malloc9.base)_1) = -1*ULTIMATE.start_bubbleSort_~numbers.offset - 4*ULTIMATE.start_bubbleSort_~j~0 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc9.base)_1 Supporting invariants [] [2019-11-15 21:43:03,337 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2019-11-15 21:43:03,340 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 21:43:03,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:43:03,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:43:03,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 21:43:03,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:43:03,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:43:03,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 21:43:03,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:43:03,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:43:03,414 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-11-15 21:43:03,414 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 19 transitions. cyclomatic complexity: 8 Second operand 4 states. [2019-11-15 21:43:03,468 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 19 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 28 states and 41 transitions. Complement of second has 8 states. [2019-11-15 21:43:03,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 21:43:03,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 21:43:03,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2019-11-15 21:43:03,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 5 letters. Loop has 3 letters. [2019-11-15 21:43:03,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:43:03,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 8 letters. Loop has 3 letters. [2019-11-15 21:43:03,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:43:03,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 5 letters. Loop has 6 letters. [2019-11-15 21:43:03,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:43:03,473 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 41 transitions. [2019-11-15 21:43:03,475 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 21:43:03,476 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 18 states and 26 transitions. [2019-11-15 21:43:03,476 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-15 21:43:03,476 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-11-15 21:43:03,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 26 transitions. [2019-11-15 21:43:03,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:43:03,476 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2019-11-15 21:43:03,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 26 transitions. [2019-11-15 21:43:03,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 13. [2019-11-15 21:43:03,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-15 21:43:03,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2019-11-15 21:43:03,477 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2019-11-15 21:43:03,477 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2019-11-15 21:43:03,478 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 21:43:03,478 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2019-11-15 21:43:03,478 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 21:43:03,478 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:43:03,478 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:43:03,479 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2019-11-15 21:43:03,479 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 21:43:03,479 INFO L791 eck$LassoCheckResult]: Stem: 220#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 213#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; 214#L562 assume !(main_~array_size~0 < 1); 223#L562-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(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; 219#L550-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 217#L551-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 211#L550-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 212#L550-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 215#L551-3 [2019-11-15 21:43:03,479 INFO L793 eck$LassoCheckResult]: Loop: 215#L551-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 216#L552 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5;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); 221#L551-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 215#L551-3 [2019-11-15 21:43:03,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:43:03,480 INFO L82 PathProgramCache]: Analyzing trace with hash 176798328, now seen corresponding path program 2 times [2019-11-15 21:43:03,480 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:43:03,480 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426400901] [2019-11-15 21:43:03,480 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:03,480 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:03,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:43:03,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:43:03,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:43:03,530 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426400901] [2019-11-15 21:43:03,530 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:43:03,530 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:43:03,530 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900083694] [2019-11-15 21:43:03,531 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 21:43:03,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:43:03,531 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 2 times [2019-11-15 21:43:03,531 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:43:03,531 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721643504] [2019-11-15 21:43:03,531 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:03,532 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:03,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:43:03,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:43:03,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:43:03,542 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:43:03,635 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:43:03,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:43:03,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:43:03,636 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand 5 states. [2019-11-15 21:43:03,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:43:03,686 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions. [2019-11-15 21:43:03,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:43:03,686 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2019-11-15 21:43:03,688 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 21:43:03,688 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 19 states and 26 transitions. [2019-11-15 21:43:03,688 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-15 21:43:03,689 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-15 21:43:03,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 26 transitions. [2019-11-15 21:43:03,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:43:03,689 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-11-15 21:43:03,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 26 transitions. [2019-11-15 21:43:03,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 14. [2019-11-15 21:43:03,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-15 21:43:03,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2019-11-15 21:43:03,691 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-11-15 21:43:03,691 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-11-15 21:43:03,691 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 21:43:03,691 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2019-11-15 21:43:03,692 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 21:43:03,692 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:43:03,692 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:43:03,692 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:43:03,693 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 21:43:03,693 INFO L791 eck$LassoCheckResult]: Stem: 265#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 257#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; 258#L562 assume !(main_~array_size~0 < 1); 269#L562-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(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; 266#L550-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 261#L551-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 262#L552 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5; 268#L551-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 270#L551-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 263#L550-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 264#L550-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 259#L551-3 [2019-11-15 21:43:03,693 INFO L793 eck$LassoCheckResult]: Loop: 259#L551-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 260#L552 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5;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); 267#L551-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 259#L551-3 [2019-11-15 21:43:03,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:43:03,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1421271829, now seen corresponding path program 1 times [2019-11-15 21:43:03,693 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:43:03,694 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152742329] [2019-11-15 21:43:03,694 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:03,694 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:03,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:43:03,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:43:03,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:43:03,712 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:43:03,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:43:03,712 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 3 times [2019-11-15 21:43:03,713 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:43:03,713 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277507205] [2019-11-15 21:43:03,713 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:03,713 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:03,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:43:03,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:43:03,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:43:03,722 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:43:03,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:43:03,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1321478696, now seen corresponding path program 1 times [2019-11-15 21:43:03,722 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:43:03,723 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396159297] [2019-11-15 21:43:03,723 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:03,723 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:03,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:43:03,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:43:03,807 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:43:03,807 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396159297] [2019-11-15 21:43:03,807 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583127066] [2019-11-15 21:43:03,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_aa20117d-8c29-4e2a-ae69-af58e49e8f25/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:43:03,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:43:03,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 21:43:03,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:43:03,925 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:43:03,925 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:43:03,926 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-11-15 21:43:03,926 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210765030] [2019-11-15 21:43:04,019 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:43:04,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 21:43:04,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-15 21:43:04,020 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand 12 states. [2019-11-15 21:43:04,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:43:04,124 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2019-11-15 21:43:04,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:43:04,125 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 38 transitions. [2019-11-15 21:43:04,126 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 21:43:04,127 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 25 states and 34 transitions. [2019-11-15 21:43:04,127 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-15 21:43:04,127 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-15 21:43:04,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 34 transitions. [2019-11-15 21:43:04,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:43:04,128 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2019-11-15 21:43:04,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 34 transitions. [2019-11-15 21:43:04,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2019-11-15 21:43:04,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-15 21:43:04,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2019-11-15 21:43:04,130 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-11-15 21:43:04,130 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-11-15 21:43:04,130 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 21:43:04,130 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2019-11-15 21:43:04,131 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 21:43:04,131 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:43:04,131 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:43:04,131 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-15 21:43:04,132 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 21:43:04,132 INFO L791 eck$LassoCheckResult]: Stem: 370#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 362#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; 363#L562 assume !(main_~array_size~0 < 1); 376#L562-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(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; 371#L550-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 372#L551-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 374#L552 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5; 375#L551-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 366#L551-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 367#L552 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5; 378#L551-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 377#L551-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 368#L550-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 369#L550-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 364#L551-3 [2019-11-15 21:43:04,132 INFO L793 eck$LassoCheckResult]: Loop: 364#L551-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 365#L552 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5;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); 373#L551-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 364#L551-3 [2019-11-15 21:43:04,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:43:04,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1373641048, now seen corresponding path program 2 times [2019-11-15 21:43:04,132 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:43:04,132 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867463117] [2019-11-15 21:43:04,132 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:04,133 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:04,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:43:04,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:43:04,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:43:04,155 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:43:04,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:43:04,155 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 4 times [2019-11-15 21:43:04,156 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:43:04,156 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77498014] [2019-11-15 21:43:04,156 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:04,156 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:04,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:43:04,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:43:04,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:43:04,165 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:43:04,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:43:04,166 INFO L82 PathProgramCache]: Analyzing trace with hash -307910395, now seen corresponding path program 2 times [2019-11-15 21:43:04,166 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:43:04,166 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878073803] [2019-11-15 21:43:04,166 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:04,166 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:04,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:43:04,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:43:04,487 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:43:04,487 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878073803] [2019-11-15 21:43:04,488 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626932513] [2019-11-15 21:43:04,488 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_aa20117d-8c29-4e2a-ae69-af58e49e8f25/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:43:04,557 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 21:43:04,557 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:43:04,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-15 21:43:04,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:43:04,635 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:43:04,636 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 26 treesize of output 10 [2019-11-15 21:43:04,637 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:43:04,638 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:43:04,639 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:43:04,639 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-11-15 21:43:04,653 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 21:43:04,654 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:43:04,654 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 12 [2019-11-15 21:43:04,654 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920958033] [2019-11-15 21:43:04,728 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:43:04,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 21:43:04,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-11-15 21:43:04,729 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. cyclomatic complexity: 8 Second operand 12 states. [2019-11-15 21:43:04,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:43:04,850 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2019-11-15 21:43:04,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 21:43:04,851 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 50 transitions. [2019-11-15 21:43:04,852 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-15 21:43:04,854 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 50 transitions. [2019-11-15 21:43:04,854 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-11-15 21:43:04,854 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-11-15 21:43:04,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 50 transitions. [2019-11-15 21:43:04,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:43:04,854 INFO L688 BuchiCegarLoop]: Abstraction has 37 states and 50 transitions. [2019-11-15 21:43:04,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 50 transitions. [2019-11-15 21:43:04,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2019-11-15 21:43:04,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-15 21:43:04,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2019-11-15 21:43:04,858 INFO L711 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2019-11-15 21:43:04,858 INFO L591 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2019-11-15 21:43:04,858 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-15 21:43:04,858 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 35 transitions. [2019-11-15 21:43:04,859 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 21:43:04,859 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:43:04,859 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:43:04,859 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:43:04,859 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 21:43:04,860 INFO L791 eck$LassoCheckResult]: Stem: 495#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 489#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; 490#L562 assume !(main_~array_size~0 < 1); 499#L562-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(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; 491#L550-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 492#L551-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 505#L552 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5; 501#L551-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 485#L551-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 486#L552 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5;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); 497#L551-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 504#L551-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 487#L550-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 488#L550-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 500#L551-3 [2019-11-15 21:43:04,860 INFO L793 eck$LassoCheckResult]: Loop: 500#L551-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 508#L552 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5;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); 496#L551-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 500#L551-3 [2019-11-15 21:43:04,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:43:04,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1371794006, now seen corresponding path program 3 times [2019-11-15 21:43:04,860 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:43:04,860 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540835778] [2019-11-15 21:43:04,860 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:04,861 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:04,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:43:04,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:43:04,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:43:04,881 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:43:04,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:43:04,881 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 5 times [2019-11-15 21:43:04,882 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:43:04,882 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868369412] [2019-11-15 21:43:04,882 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:04,882 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:04,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:43:04,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:43:04,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:43:04,890 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:43:04,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:43:04,890 INFO L82 PathProgramCache]: Analyzing trace with hash 501436231, now seen corresponding path program 4 times [2019-11-15 21:43:04,890 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:43:04,890 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406546470] [2019-11-15 21:43:04,891 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:04,891 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:43:04,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:43:04,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:43:04,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:43:04,916 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:43:05,370 WARN L191 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 102 [2019-11-15 21:43:05,440 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:43:05,440 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:43:05,440 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:43:05,440 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:43:05,440 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:43:05,440 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:43:05,440 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:43:05,440 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:43:05,440 INFO L131 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-1.i_Iteration7_Lasso [2019-11-15 21:43:05,440 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:43:05,440 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:43:05,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:43:05,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:43:05,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:43:05,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:43:05,644 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-11-15 21:43:05,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:43:05,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:43:05,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:43:05,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:43:05,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:43:05,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:43:05,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:43:05,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:43:05,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:43:05,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:43:06,049 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:43:06,050 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:43:06,050 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:43:06,051 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:43:06,051 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:43:06,051 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:43:06,051 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:43:06,051 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:43:06,052 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:43:06,052 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:43:06,052 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:43:06,053 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:43:06,053 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:43:06,053 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:43:06,053 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:43:06,053 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:43:06,054 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:43:06,054 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:43:06,056 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:43:06,057 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:43:06,057 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:43:06,058 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:43:06,058 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:43:06,058 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:43:06,058 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:43:06,058 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:43:06,059 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:43:06,059 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:43:06,059 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:43:06,060 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:43:06,060 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:43:06,060 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:43:06,061 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:43:06,064 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:43:06,064 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:43:06,084 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:43:06,096 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 21:43:06,096 INFO L444 ModelExtractionUtils]: 30 out of 37 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-11-15 21:43:06,097 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:43:06,098 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 21:43:06,098 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:43:06,098 INFO L512 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 [] [2019-11-15 21:43:06,125 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2019-11-15 21:43:06,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:43:06,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:43:06,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:43:06,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:43:06,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:43:06,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 21:43:06,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:43:06,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:43:06,176 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 21:43:06,176 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-11-15 21:43:06,202 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. [2019-11-15 21:43:06,204 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 [2019-11-15 21:43:06,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 21:43:06,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-11-15 21:43:06,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 14 letters. Loop has 3 letters. [2019-11-15 21:43:06,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:43:06,205 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 21:43:06,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:43:06,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:43:06,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:43:06,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:43:06,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:43:06,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 21:43:06,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:43:06,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:43:06,244 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 [2019-11-15 21:43:06,244 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-11-15 21:43:06,261 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. [2019-11-15 21:43:06,262 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 [2019-11-15 21:43:06,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 21:43:06,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-11-15 21:43:06,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 14 letters. Loop has 3 letters. [2019-11-15 21:43:06,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:43:06,263 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 21:43:06,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:43:06,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:43:06,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:43:06,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:43:06,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:43:06,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 21:43:06,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:43:06,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:43:06,302 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 [2019-11-15 21:43:06,302 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-11-15 21:43:06,323 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. [2019-11-15 21:43:06,327 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 [2019-11-15 21:43:06,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 21:43:06,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2019-11-15 21:43:06,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 14 letters. Loop has 3 letters. [2019-11-15 21:43:06,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:43:06,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 17 letters. Loop has 3 letters. [2019-11-15 21:43:06,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:43:06,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 14 letters. Loop has 6 letters. [2019-11-15 21:43:06,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:43:06,330 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 58 transitions. [2019-11-15 21:43:06,331 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 21:43:06,331 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2019-11-15 21:43:06,331 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 21:43:06,331 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 21:43:06,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 21:43:06,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:43:06,331 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:43:06,332 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:43:06,332 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:43:06,332 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-15 21:43:06,332 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 21:43:06,332 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 21:43:06,332 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 21:43:06,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 09:43:06 BoogieIcfgContainer [2019-11-15 21:43:06,337 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 21:43:06,338 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 21:43:06,338 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 21:43:06,338 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 21:43:06,338 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:43:00" (3/4) ... [2019-11-15 21:43:06,341 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 21:43:06,342 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 21:43:06,343 INFO L168 Benchmark]: Toolchain (without parser) took 6597.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 189.3 MB). Free memory was 944.7 MB in the beginning and 951.9 MB in the end (delta: -7.1 MB). Peak memory consumption was 182.1 MB. Max. memory is 11.5 GB. [2019-11-15 21:43:06,344 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:43:06,344 INFO L168 Benchmark]: CACSL2BoogieTranslator took 513.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -167.3 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-11-15 21:43:06,345 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.77 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:43:06,345 INFO L168 Benchmark]: Boogie Preprocessor took 26.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 21:43:06,345 INFO L168 Benchmark]: RCFGBuilder took 327.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2019-11-15 21:43:06,346 INFO L168 Benchmark]: BuchiAutomizer took 5680.46 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 59.8 MB). Free memory was 1.1 GB in the beginning and 951.9 MB in the end (delta: 137.8 MB). Peak memory consumption was 197.6 MB. Max. memory is 11.5 GB. [2019-11-15 21:43:06,346 INFO L168 Benchmark]: Witness Printer took 4.18 ms. Allocated memory is still 1.2 GB. Free memory is still 951.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:43:06,349 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 513.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -167.3 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.77 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 327.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5680.46 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 59.8 MB). Free memory was 1.1 GB in the beginning and 951.9 MB in the end (delta: 137.8 MB). Peak memory consumption was 197.6 MB. Max. memory is 11.5 GB. * Witness Printer took 4.18 ms. Allocated memory is still 1.2 GB. Free memory is still 951.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function 2 * i + 1 and consists of 3 locations. One deterministic module has affine ranking function -1 * numbers + -4 * j + unknown-#length-unknown[__builtin_alloca (array_size * sizeof(int))] and consists of 5 locations. One nondeterministic module has affine ranking function 2 * i + -2 * j + 1 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 5.6s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 4.7s. Construction of modules took 0.2s. Büchi inclusion checks took 0.5s. 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: 85 SDtfs, 104 SDslu, 74 SDs, 0 SdLazy, 176 SolverSat, 37 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT1 conc2 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital111 mio100 ax157 hnf98 lsp68 ukn80 mio100 lsp80 div100 bol100 ite100 ukn100 eq171 hnf90 smp89 dnf100 smp100 tf104 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 29ms VariablesStem: 5 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 3 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...