./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/bubblesort-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/array-memsafety/bubblesort-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a2eb39e0d0d0fa911fcf8a16c5f9511be1d37325 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 17:37:00,487 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 17:37:00,489 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 17:37:00,519 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 17:37:00,519 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 17:37:00,522 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 17:37:00,523 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 17:37:00,527 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 17:37:00,529 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 17:37:00,532 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 17:37:00,533 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 17:37:00,534 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 17:37:00,534 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 17:37:00,536 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 17:37:00,537 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 17:37:00,541 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 17:37:00,542 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 17:37:00,542 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 17:37:00,544 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 17:37:00,548 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 17:37:00,549 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 17:37:00,550 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 17:37:00,551 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 17:37:00,552 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 17:37:00,557 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 17:37:00,557 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 17:37:00,557 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 17:37:00,559 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 17:37:00,559 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 17:37:00,559 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 17:37:00,560 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 17:37:00,560 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 17:37:00,561 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 17:37:00,562 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 17:37:00,563 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 17:37:00,563 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 17:37:00,564 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 17:37:00,564 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 17:37:00,564 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 17:37:00,565 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 17:37:00,566 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 17:37:00,567 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-08-27 17:37:00,596 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 17:37:00,597 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 17:37:00,598 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 17:37:00,598 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 17:37:00,599 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 17:37:00,599 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 17:37:00,600 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 17:37:00,600 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-08-27 17:37:00,600 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-08-27 17:37:00,600 INFO L138 SettingsManager]: * Use old map elimination=false [2021-08-27 17:37:00,601 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-08-27 17:37:00,601 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-08-27 17:37:00,601 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-08-27 17:37:00,601 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 17:37:00,609 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 17:37:00,610 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 17:37:00,610 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 17:37:00,610 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 17:37:00,610 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 17:37:00,610 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-08-27 17:37:00,610 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-08-27 17:37:00,610 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-08-27 17:37:00,610 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 17:37:00,611 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-27 17:37:00,611 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-08-27 17:37:00,611 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 17:37:00,611 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-08-27 17:37:00,611 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 17:37:00,611 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 17:37:00,611 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 17:37:00,612 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 17:37:00,612 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 17:37:00,613 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-08-27 17:37:00,613 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a2eb39e0d0d0fa911fcf8a16c5f9511be1d37325 [2021-08-27 17:37:00,882 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 17:37:00,898 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 17:37:00,899 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 17:37:00,900 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 17:37:00,908 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 17:37:00,908 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/bubblesort-alloca-2.i [2021-08-27 17:37:00,950 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b93a7281/c7d777a21fde49c2b49577df7c26fbab/FLAGd12533301 [2021-08-27 17:37:01,268 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 17:37:01,269 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/bubblesort-alloca-2.i [2021-08-27 17:37:01,276 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b93a7281/c7d777a21fde49c2b49577df7c26fbab/FLAGd12533301 [2021-08-27 17:37:01,695 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b93a7281/c7d777a21fde49c2b49577df7c26fbab [2021-08-27 17:37:01,697 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 17:37:01,698 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-27 17:37:01,698 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 17:37:01,699 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 17:37:01,701 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 17:37:01,701 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 05:37:01" (1/1) ... [2021-08-27 17:37:01,702 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27fe3c46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:37:01, skipping insertion in model container [2021-08-27 17:37:01,702 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 05:37:01" (1/1) ... [2021-08-27 17:37:01,706 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 17:37:01,737 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 17:37:01,961 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 17:37:01,968 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 17:37:02,010 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 17:37:02,030 INFO L208 MainTranslator]: Completed translation [2021-08-27 17:37:02,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:37:02 WrapperNode [2021-08-27 17:37:02,032 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 17:37:02,033 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-27 17:37:02,034 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-27 17:37:02,034 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-27 17:37:02,038 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:37:02" (1/1) ... [2021-08-27 17:37:02,057 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:37:02" (1/1) ... [2021-08-27 17:37:02,075 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-27 17:37:02,076 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 17:37:02,077 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 17:37:02,077 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 17:37:02,082 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:37:02" (1/1) ... [2021-08-27 17:37:02,082 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:37:02" (1/1) ... [2021-08-27 17:37:02,094 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:37:02" (1/1) ... [2021-08-27 17:37:02,095 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:37:02" (1/1) ... [2021-08-27 17:37:02,102 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:37:02" (1/1) ... [2021-08-27 17:37:02,110 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:37:02" (1/1) ... [2021-08-27 17:37:02,113 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:37:02" (1/1) ... [2021-08-27 17:37:02,114 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 17:37:02,117 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 17:37:02,118 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 17:37:02,118 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 17:37:02,118 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:37:02" (1/1) ... [2021-08-27 17:37:02,123 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:37:02,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:37:02,155 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:37:02,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-08-27 17:37:02,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-27 17:37:02,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-27 17:37:02,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 17:37:02,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 17:37:02,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 17:37:02,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 17:37:02,454 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 17:37:02,454 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2021-08-27 17:37:02,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 05:37:02 BoogieIcfgContainer [2021-08-27 17:37:02,455 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 17:37:02,456 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-08-27 17:37:02,456 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-08-27 17:37:02,458 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-08-27 17:37:02,459 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 17:37:02,459 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.08 05:37:01" (1/3) ... [2021-08-27 17:37:02,460 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5d68f966 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 05:37:02, skipping insertion in model container [2021-08-27 17:37:02,460 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 17:37:02,460 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:37:02" (2/3) ... [2021-08-27 17:37:02,460 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5d68f966 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 05:37:02, skipping insertion in model container [2021-08-27 17:37:02,460 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 17:37:02,460 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 05:37:02" (3/3) ... [2021-08-27 17:37:02,461 INFO L389 chiAutomizerObserver]: Analyzing ICFG bubblesort-alloca-2.i [2021-08-27 17:37:02,503 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-08-27 17:37:02,504 INFO L360 BuchiCegarLoop]: Hoare is false [2021-08-27 17:37:02,504 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-08-27 17:37:02,504 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-27 17:37:02,504 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-27 17:37:02,504 INFO L364 BuchiCegarLoop]: Difference is false [2021-08-27 17:37:02,504 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-27 17:37:02,505 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-08-27 17:37:02,514 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:37:02,530 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2021-08-27 17:37:02,531 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:37:02,531 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:37:02,535 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-08-27 17:37:02,535 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 17:37:02,535 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-08-27 17:37:02,535 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:37:02,537 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2021-08-27 17:37:02,537 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:37:02,537 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:37:02,537 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-08-27 17:37:02,537 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 17:37:02,543 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 10#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 12#L527true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 13#L527-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;main_~k~0 := 0; 16#L532-3true [2021-08-27 17:37:02,544 INFO L793 eck$LassoCheckResult]: Loop: 16#L532-3true assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet11; 5#L532-2true main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 16#L532-3true [2021-08-27 17:37:02,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:37:02,551 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2021-08-27 17:37:02,557 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:37:02,561 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599059314] [2021-08-27 17:37:02,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:37:02,563 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:37:02,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:37:02,635 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:37:02,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:37:02,663 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:37:02,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:37:02,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2021-08-27 17:37:02,673 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:37:02,673 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891168513] [2021-08-27 17:37:02,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:37:02,674 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:37:02,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:37:02,687 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:37:02,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:37:02,700 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:37:02,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:37:02,703 INFO L82 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2021-08-27 17:37:02,703 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:37:02,704 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320048117] [2021-08-27 17:37:02,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:37:02,704 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:37:02,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:37:02,722 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:37:02,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:37:02,751 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:37:02,987 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 17:37:02,988 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 17:37:02,988 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 17:37:02,988 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 17:37:02,988 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 17:37:02,988 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:37:02,988 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 17:37:02,989 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 17:37:02,989 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-2.i_Iteration1_Lasso [2021-08-27 17:37:02,989 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 17:37:02,989 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 17:37:03,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:37:03,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:37:03,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:37:03,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:37:03,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:37:03,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:37:03,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:37:03,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:37:03,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:37:03,242 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 17:37:03,245 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 17:37:03,246 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:37:03,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:37:03,247 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:37:03,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-08-27 17:37:03,249 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:37:03,256 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:37:03,257 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:37:03,257 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:37:03,257 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:37:03,257 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:37:03,259 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:37:03,259 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:37:03,273 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:37:03,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2021-08-27 17:37:03,303 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:37:03,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:37:03,313 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:37:03,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-08-27 17:37:03,315 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:37:03,322 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:37:03,322 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:37:03,322 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:37:03,322 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:37:03,322 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:37:03,323 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:37:03,323 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:37:03,330 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:37:03,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-08-27 17:37:03,349 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:37:03,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:37:03,349 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:37:03,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-08-27 17:37:03,352 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:37:03,358 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:37:03,359 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:37:03,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:37:03,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:37:03,362 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:37:03,362 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:37:03,387 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:37:03,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-08-27 17:37:03,410 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:37:03,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:37:03,411 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:37:03,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-08-27 17:37:03,414 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:37:03,420 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:37:03,421 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:37:03,421 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:37:03,421 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:37:03,423 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:37:03,423 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:37:03,436 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:37:03,452 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-08-27 17:37:03,453 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:37:03,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:37:03,453 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:37:03,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-08-27 17:37:03,456 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:37:03,463 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:37:03,463 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:37:03,463 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:37:03,464 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:37:03,464 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:37:03,467 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:37:03,468 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:37:03,469 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:37:03,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2021-08-27 17:37:03,488 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:37:03,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:37:03,489 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:37:03,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-08-27 17:37:03,493 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:37:03,500 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:37:03,500 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:37:03,500 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:37:03,500 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:37:03,502 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:37:03,502 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:37:03,528 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:37:03,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-08-27 17:37:03,573 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:37:03,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:37:03,574 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:37:03,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2021-08-27 17:37:03,576 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:37:03,583 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:37:03,583 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:37:03,583 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:37:03,583 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:37:03,591 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:37:03,591 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:37:03,596 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:37:03,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2021-08-27 17:37:03,612 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:37:03,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:37:03,613 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:37:03,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-08-27 17:37:03,615 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:37:03,622 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:37:03,622 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:37:03,622 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:37:03,622 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:37:03,622 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:37:03,623 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:37:03,623 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:37:03,641 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:37:03,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2021-08-27 17:37:03,668 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:37:03,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:37:03,671 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:37:03,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2021-08-27 17:37:03,687 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:37:03,693 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:37:03,694 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:37:03,694 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:37:03,694 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:37:03,694 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:37:03,694 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:37:03,694 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:37:03,709 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:37:03,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2021-08-27 17:37:03,733 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:37:03,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:37:03,733 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:37:03,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2021-08-27 17:37:03,757 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:37:03,764 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:37:03,764 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:37:03,764 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:37:03,764 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:37:03,767 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:37:03,767 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:37:03,795 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:37:03,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2021-08-27 17:37:03,831 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:37:03,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:37:03,832 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:37:03,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2021-08-27 17:37:03,834 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:37:03,842 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:37:03,843 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:37:03,843 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:37:03,843 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:37:03,846 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:37:03,847 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:37:03,862 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:37:03,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2021-08-27 17:37:03,878 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:37:03,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:37:03,879 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:37:03,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2021-08-27 17:37:03,881 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:37:03,888 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:37:03,888 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:37:03,888 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:37:03,888 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:37:03,891 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:37:03,891 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:37:03,907 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:37:03,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2021-08-27 17:37:03,923 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:37:03,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:37:03,924 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:37:03,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2021-08-27 17:37:03,926 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:37:03,933 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:37:03,933 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:37:03,933 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:37:03,933 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:37:03,939 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:37:03,939 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:37:03,955 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 17:37:03,980 INFO L443 ModelExtractionUtils]: Simplification made 17 calls to the SMT solver. [2021-08-27 17:37:03,980 INFO L444 ModelExtractionUtils]: 4 out of 22 variables were initially zero. Simplification set additionally 13 variables to zero. [2021-08-27 17:37:03,981 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:37:03,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:37:03,982 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:37:03,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2021-08-27 17:37:03,984 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 17:37:04,010 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2021-08-27 17:37:04,010 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 17:37:04,011 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0, v_rep(select #length ULTIMATE.start_main_~numbers~0.base)_1) = -2*ULTIMATE.start_main_~k~0 + 1*v_rep(select #length ULTIMATE.start_main_~numbers~0.base)_1 Supporting invariants [-2*ULTIMATE.start_main_~array_size~0 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc9.base)_1 >= 0] [2021-08-27 17:37:04,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2021-08-27 17:37:04,035 INFO L297 tatePredicateManager]: 2 out of 4 supporting invariants were superfluous and have been removed [2021-08-27 17:37:04,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:37:04,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:37:04,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-27 17:37:04,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:37:04,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:37:04,131 WARN L261 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-27 17:37:04,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:37:04,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2021-08-27 17:37:04,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:37:04,170 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 [2021-08-27 17:37:04,170 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:37:04,221 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 35 states and 53 transitions. Complement of second has 9 states. [2021-08-27 17:37:04,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2021-08-27 17:37:04,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:37:04,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2021-08-27 17:37:04,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 4 letters. Loop has 2 letters. [2021-08-27 17:37:04,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:37:04,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 6 letters. Loop has 2 letters. [2021-08-27 17:37:04,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:37:04,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 4 letters. Loop has 4 letters. [2021-08-27 17:37:04,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:37:04,225 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 53 transitions. [2021-08-27 17:37:04,226 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 17:37:04,228 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 13 states and 18 transitions. [2021-08-27 17:37:04,229 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-08-27 17:37:04,229 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-08-27 17:37:04,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2021-08-27 17:37:04,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:37:04,229 INFO L681 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2021-08-27 17:37:04,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2021-08-27 17:37:04,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2021-08-27 17:37:04,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:37:04,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2021-08-27 17:37:04,242 INFO L704 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2021-08-27 17:37:04,242 INFO L587 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2021-08-27 17:37:04,243 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-08-27 17:37:04,243 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2021-08-27 17:37:04,243 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 17:37:04,243 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:37:04,243 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:37:04,243 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-08-27 17:37:04,243 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 17:37:04,244 INFO L791 eck$LassoCheckResult]: Stem: 123#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 124#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 121#L527 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 122#L527-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;main_~k~0 := 0; 125#L532-3 assume !(main_~k~0 < main_~array_size~0); 128#L532-4 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; 129#L515-3 [2021-08-27 17:37:04,244 INFO L793 eck$LassoCheckResult]: Loop: 129#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 130#L516-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 131#L515-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 129#L515-3 [2021-08-27 17:37:04,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:37:04,244 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2021-08-27 17:37:04,244 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:37:04,244 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329495967] [2021-08-27 17:37:04,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:37:04,244 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:37:04,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:37:04,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:37:04,283 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:37:04,283 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329495967] [2021-08-27 17:37:04,283 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329495967] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 17:37:04,283 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 17:37:04,283 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 17:37:04,283 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995666537] [2021-08-27 17:37:04,285 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:37:04,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:37:04,285 INFO L82 PathProgramCache]: Analyzing trace with hash 60779, now seen corresponding path program 1 times [2021-08-27 17:37:04,285 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:37:04,286 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177681109] [2021-08-27 17:37:04,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:37:04,286 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:37:04,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:37:04,289 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:37:04,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:37:04,291 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:37:04,326 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 17:37:04,326 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 17:37:04,326 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 17:37:04,326 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 17:37:04,326 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-08-27 17:37:04,326 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:37:04,326 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 17:37:04,326 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 17:37:04,326 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-2.i_Iteration2_Loop [2021-08-27 17:37:04,327 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 17:37:04,327 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 17:37:04,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:37:04,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:37:04,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:37:04,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:37:04,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:37:04,398 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 17:37:04,399 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-08-27 17:37:04,400 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:37:04,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:37:04,418 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:37:04,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2021-08-27 17:37:04,459 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 17:37:04,459 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 17:37:04,482 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 17:37:04,482 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: [] [2021-08-27 17:37:04,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2021-08-27 17:37:04,500 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:37:04,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:37:04,501 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:37:04,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2021-08-27 17:37:04,503 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 17:37:04,503 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 17:37:04,524 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 17:37:04,525 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~P_PGID_2=2} Honda state: {v_rep~unnamed0~0~P_PGID_2=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-27 17:37:04,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2021-08-27 17:37:04,542 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:37:04,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:37:04,542 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:37:04,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2021-08-27 17:37:04,545 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 17:37:04,545 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 17:37:04,565 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 17:37:04,566 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~P_PID_2=1} Honda state: {v_rep~unnamed0~0~P_PID_2=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-27 17:37:04,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2021-08-27 17:37:04,583 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:37:04,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:37:04,583 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:37:04,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2021-08-27 17:37:04,586 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 17:37:04,586 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 17:37:04,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2021-08-27 17:37:04,623 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:37:04,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:37:04,624 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:37:04,629 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-08-27 17:37:04,629 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 17:37:04,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2021-08-27 17:37:04,660 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-08-27 17:37:04,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2021-08-27 17:37:04,665 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 17:37:04,665 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 17:37:04,665 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 17:37:04,665 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 17:37:04,665 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 17:37:04,665 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:37:04,665 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 17:37:04,665 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 17:37:04,665 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-2.i_Iteration2_Loop [2021-08-27 17:37:04,665 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 17:37:04,665 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 17:37:04,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:37:04,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:37:04,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:37:04,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:37:04,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:37:04,733 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 17:37:04,733 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 17:37:04,733 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:37:04,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:37:04,749 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:37:04,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2021-08-27 17:37:04,786 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:37:04,792 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:37:04,792 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:37:04,792 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:37:04,792 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:37:04,792 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:37:04,792 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:37:04,792 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:37:04,794 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:37:04,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2021-08-27 17:37:04,809 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:37:04,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:37:04,810 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:37:04,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2021-08-27 17:37:04,812 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:37:04,818 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:37:04,818 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:37:04,818 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:37:04,818 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:37:04,820 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:37:04,820 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:37:04,824 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:37:04,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2021-08-27 17:37:04,839 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:37:04,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:37:04,840 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:37:04,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2021-08-27 17:37:04,842 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:37:04,848 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:37:04,848 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:37:04,848 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:37:04,848 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:37:04,848 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:37:04,849 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:37:04,849 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:37:04,864 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 17:37:04,866 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-08-27 17:37:04,866 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-08-27 17:37:04,866 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:37:04,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:37:04,867 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:37:04,876 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 17:37:04,876 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-08-27 17:37:04,876 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 17:37:04,876 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_bubbleSort_~i~0) = 2*ULTIMATE.start_bubbleSort_~i~0 + 1 Supporting invariants [] [2021-08-27 17:37:04,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2021-08-27 17:37:04,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2021-08-27 17:37:04,891 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-08-27 17:37:04,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:37:04,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:37:04,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 17:37:04,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:37:04,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:37:04,927 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 17:37:04,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:37:04,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:37:04,945 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 [2021-08-27 17:37:04,946 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:37:04,954 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 18 transitions. cyclomatic complexity: 7. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 19 states and 28 transitions. Complement of second has 4 states. [2021-08-27 17:37:04,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2021-08-27 17:37:04,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:37:04,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2021-08-27 17:37:04,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 6 letters. Loop has 3 letters. [2021-08-27 17:37:04,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:37:04,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 9 letters. Loop has 3 letters. [2021-08-27 17:37:04,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:37:04,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 6 letters. Loop has 6 letters. [2021-08-27 17:37:04,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:37:04,955 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 28 transitions. [2021-08-27 17:37:04,956 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-27 17:37:04,956 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 18 states and 26 transitions. [2021-08-27 17:37:04,956 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-08-27 17:37:04,956 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-08-27 17:37:04,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 26 transitions. [2021-08-27 17:37:04,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 17:37:04,956 INFO L681 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2021-08-27 17:37:04,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 26 transitions. [2021-08-27 17:37:04,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2021-08-27 17:37:04,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:37:04,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2021-08-27 17:37:04,958 INFO L704 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2021-08-27 17:37:04,958 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:37:04,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 17:37:04,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 17:37:04,960 INFO L87 Difference]: Start difference. First operand 17 states and 25 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:37:04,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:37:04,974 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2021-08-27 17:37:04,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 17:37:04,974 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 25 transitions. [2021-08-27 17:37:04,975 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-27 17:37:04,975 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 25 transitions. [2021-08-27 17:37:04,975 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-08-27 17:37:04,975 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2021-08-27 17:37:04,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2021-08-27 17:37:04,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 17:37:04,976 INFO L681 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2021-08-27 17:37:04,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2021-08-27 17:37:04,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2021-08-27 17:37:04,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.411764705882353) internal successors, (24), 16 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:37:04,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2021-08-27 17:37:04,977 INFO L704 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2021-08-27 17:37:04,977 INFO L587 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2021-08-27 17:37:04,977 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-08-27 17:37:04,977 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. [2021-08-27 17:37:04,978 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-27 17:37:04,978 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:37:04,978 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:37:04,978 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:37:04,978 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 17:37:04,979 INFO L791 eck$LassoCheckResult]: Stem: 237#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 238#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 235#L527 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 236#L527-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;main_~k~0 := 0; 241#L532-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet11; 239#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 240#L532-3 assume !(main_~k~0 < main_~array_size~0); 242#L532-4 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; 243#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 244#L516-3 [2021-08-27 17:37:04,979 INFO L793 eck$LassoCheckResult]: Loop: 244#L516-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); 245#L517 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); 250#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 244#L516-3 [2021-08-27 17:37:04,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:37:04,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1185641744, now seen corresponding path program 1 times [2021-08-27 17:37:04,979 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:37:04,979 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113323238] [2021-08-27 17:37:04,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:37:04,980 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:37:04,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:37:04,988 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:37:04,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:37:04,996 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:37:04,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:37:04,996 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 1 times [2021-08-27 17:37:04,996 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:37:04,996 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268349590] [2021-08-27 17:37:04,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:37:04,997 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:37:05,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:37:05,000 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:37:05,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:37:05,004 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:37:05,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:37:05,004 INFO L82 PathProgramCache]: Analyzing trace with hash -357807973, now seen corresponding path program 1 times [2021-08-27 17:37:05,005 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:37:05,005 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518339344] [2021-08-27 17:37:05,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:37:05,005 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:37:05,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:37:05,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:37:05,071 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:37:05,071 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518339344] [2021-08-27 17:37:05,071 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518339344] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:37:05,072 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287187511] [2021-08-27 17:37:05,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:37:05,072 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:37:05,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:37:05,075 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:37:05,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2021-08-27 17:37:05,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2021-08-27 17:37:05,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:37:05,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-27 17:37:05,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:37:05,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:37:05,201 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1287187511] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:37:05,201 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:37:05,201 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-08-27 17:37:05,201 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641477888] [2021-08-27 17:37:05,278 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:37:05,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 17:37:05,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-08-27 17:37:05,279 INFO L87 Difference]: Start difference. First operand 17 states and 24 transitions. cyclomatic complexity: 10 Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:37:05,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:37:05,359 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2021-08-27 17:37:05,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 17:37:05,359 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 41 transitions. [2021-08-27 17:37:05,360 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-27 17:37:05,361 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 20 states and 26 transitions. [2021-08-27 17:37:05,361 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-08-27 17:37:05,361 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2021-08-27 17:37:05,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2021-08-27 17:37:05,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 17:37:05,361 INFO L681 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2021-08-27 17:37:05,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2021-08-27 17:37:05,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2021-08-27 17:37:05,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:37:05,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2021-08-27 17:37:05,363 INFO L704 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2021-08-27 17:37:05,363 INFO L587 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2021-08-27 17:37:05,363 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-08-27 17:37:05,363 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2021-08-27 17:37:05,363 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-27 17:37:05,363 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:37:05,364 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:37:05,364 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:37:05,364 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 17:37:05,364 INFO L791 eck$LassoCheckResult]: Stem: 342#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 343#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 340#L527 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 341#L527-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;main_~k~0 := 0; 346#L532-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet11; 344#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 345#L532-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet11; 357#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 358#L532-3 assume !(main_~k~0 < main_~array_size~0); 347#L532-4 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; 348#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 349#L516-3 [2021-08-27 17:37:05,364 INFO L793 eck$LassoCheckResult]: Loop: 349#L516-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); 350#L517 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); 355#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 349#L516-3 [2021-08-27 17:37:05,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:37:05,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1237095790, now seen corresponding path program 2 times [2021-08-27 17:37:05,365 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:37:05,365 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193939794] [2021-08-27 17:37:05,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:37:05,365 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:37:05,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:37:05,373 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:37:05,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:37:05,394 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:37:05,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:37:05,394 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 2 times [2021-08-27 17:37:05,395 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:37:05,395 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312475423] [2021-08-27 17:37:05,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:37:05,395 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:37:05,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:37:05,399 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:37:05,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:37:05,403 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:37:05,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:37:05,403 INFO L82 PathProgramCache]: Analyzing trace with hash -793648259, now seen corresponding path program 2 times [2021-08-27 17:37:05,404 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:37:05,404 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039891293] [2021-08-27 17:37:05,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:37:05,404 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:37:05,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:37:05,415 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:37:05,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:37:05,427 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:37:05,782 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 17:37:05,783 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 17:37:05,783 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 17:37:05,783 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 17:37:05,783 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 17:37:05,783 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:37:05,783 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 17:37:05,783 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 17:37:05,783 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-2.i_Iteration4_Lasso [2021-08-27 17:37:05,783 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 17:37:05,783 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 17:37:05,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:37:05,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:37:05,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:37:05,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:37:05,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:37:05,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:37:05,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:37:05,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:37:05,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:37:05,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:37:05,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:37:05,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:37:05,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:37:05,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:37:05,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:37:05,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:37:05,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:37:06,215 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 17:37:06,216 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 17:37:06,216 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:37:06,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:37:06,217 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:37:06,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2021-08-27 17:37:06,219 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:37:06,225 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:37:06,226 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:37:06,226 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:37:06,226 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:37:06,226 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:37:06,226 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:37:06,226 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:37:06,241 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:37:06,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2021-08-27 17:37:06,258 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:37:06,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:37:06,259 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:37:06,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2021-08-27 17:37:06,261 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:37:06,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:37:06,267 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:37:06,267 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:37:06,267 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:37:06,269 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:37:06,269 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:37:06,291 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:37:06,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2021-08-27 17:37:06,308 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:37:06,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:37:06,333 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:37:06,357 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:37:06,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2021-08-27 17:37:06,363 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:37:06,363 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:37:06,363 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:37:06,363 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:37:06,363 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:37:06,364 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:37:06,364 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:37:06,379 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:37:06,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2021-08-27 17:37:06,397 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:37:06,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:37:06,398 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:37:06,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2021-08-27 17:37:06,401 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:37:06,407 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:37:06,408 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:37:06,408 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:37:06,408 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:37:06,410 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:37:06,410 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:37:06,425 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:37:06,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2021-08-27 17:37:06,440 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:37:06,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:37:06,441 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:37:06,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2021-08-27 17:37:06,448 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:37:06,454 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:37:06,454 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:37:06,454 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:37:06,454 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:37:06,456 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:37:06,456 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:37:06,471 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:37:06,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2021-08-27 17:37:06,486 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:37:06,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:37:06,487 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:37:06,497 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:37:06,504 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:37:06,504 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:37:06,504 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:37:06,504 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:37:06,504 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:37:06,505 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:37:06,505 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:37:06,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2021-08-27 17:37:06,518 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:37:06,533 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2021-08-27 17:37:06,533 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:37:06,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:37:06,535 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:37:06,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2021-08-27 17:37:06,538 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:37:06,544 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:37:06,544 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:37:06,544 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:37:06,545 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:37:06,545 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:37:06,545 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:37:06,545 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:37:06,560 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:37:06,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2021-08-27 17:37:06,574 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:37:06,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:37:06,575 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:37:06,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2021-08-27 17:37:06,577 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:37:06,583 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:37:06,583 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:37:06,583 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:37:06,584 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:37:06,596 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:37:06,596 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:37:06,607 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:37:06,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2021-08-27 17:37:06,622 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:37:06,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:37:06,623 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:37:06,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2021-08-27 17:37:06,626 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:37:06,632 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:37:06,632 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:37:06,632 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:37:06,632 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:37:06,632 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:37:06,633 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:37:06,633 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:37:06,648 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:37:06,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2021-08-27 17:37:06,663 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:37:06,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:37:06,664 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:37:06,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2021-08-27 17:37:06,667 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:37:06,674 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:37:06,674 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:37:06,674 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:37:06,674 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:37:06,674 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:37:06,674 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:37:06,674 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:37:06,675 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:37:06,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2021-08-27 17:37:06,690 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:37:06,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:37:06,691 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:37:06,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2021-08-27 17:37:06,693 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:37:06,700 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:37:06,700 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:37:06,700 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:37:06,700 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:37:06,700 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:37:06,701 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:37:06,701 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:37:06,715 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:37:06,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2021-08-27 17:37:06,738 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:37:06,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:37:06,738 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:37:06,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2021-08-27 17:37:06,741 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:37:06,747 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:37:06,747 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:37:06,747 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:37:06,747 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:37:06,749 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:37:06,749 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:37:06,751 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:37:06,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2021-08-27 17:37:06,766 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:37:06,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:37:06,772 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:37:06,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2021-08-27 17:37:06,774 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:37:06,780 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:37:06,780 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:37:06,781 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:37:06,781 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:37:06,781 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:37:06,781 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:37:06,781 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:37:06,782 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:37:06,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2021-08-27 17:37:06,797 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:37:06,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:37:06,798 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:37:06,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2021-08-27 17:37:06,800 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:37:06,807 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:37:06,807 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:37:06,807 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:37:06,807 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:37:06,807 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:37:06,808 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:37:06,808 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:37:06,817 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:37:06,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2021-08-27 17:37:06,836 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:37:06,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:37:06,836 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:37:06,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2021-08-27 17:37:06,840 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:37:06,848 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:37:06,849 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:37:06,849 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:37:06,849 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:37:06,849 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:37:06,849 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:37:06,849 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:37:06,850 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:37:06,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2021-08-27 17:37:06,866 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:37:06,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:37:06,866 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:37:06,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2021-08-27 17:37:06,869 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:37:06,875 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:37:06,876 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:37:06,876 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:37:06,876 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:37:06,877 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:37:06,877 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:37:06,880 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:37:06,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2021-08-27 17:37:06,896 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:37:06,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:37:06,897 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:37:06,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2021-08-27 17:37:06,900 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:37:06,906 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:37:06,906 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:37:06,907 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:37:06,907 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:37:06,907 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:37:06,907 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:37:06,907 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:37:06,913 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:37:06,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2021-08-27 17:37:06,929 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:37:06,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:37:06,930 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:37:06,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2021-08-27 17:37:06,932 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:37:06,938 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:37:06,938 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:37:06,938 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:37:06,939 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:37:06,941 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:37:06,941 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:37:06,956 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:37:07,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2021-08-27 17:37:07,002 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:37:07,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:37:07,003 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:37:07,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2021-08-27 17:37:07,005 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:37:07,012 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:37:07,012 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:37:07,012 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:37:07,012 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:37:07,014 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:37:07,014 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:37:07,040 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:37:07,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2021-08-27 17:37:07,059 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:37:07,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:37:07,060 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:37:07,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2021-08-27 17:37:07,062 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:37:07,069 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:37:07,069 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:37:07,069 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:37:07,069 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:37:07,072 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:37:07,073 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:37:07,084 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:37:07,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2021-08-27 17:37:07,101 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:37:07,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:37:07,101 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:37:07,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2021-08-27 17:37:07,103 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 17:37:07,110 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:37:07,111 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:37:07,111 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:37:07,111 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:37:07,118 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:37:07,119 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:37:07,130 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 17:37:07,168 INFO L443 ModelExtractionUtils]: Simplification made 27 calls to the SMT solver. [2021-08-27 17:37:07,168 INFO L444 ModelExtractionUtils]: 6 out of 40 variables were initially zero. Simplification set additionally 30 variables to zero. [2021-08-27 17:37:07,168 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:37:07,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:37:07,169 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:37:07,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2021-08-27 17:37:07,173 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 17:37:07,180 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-08-27 17:37:07,180 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 17:37:07,180 INFO L515 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_~numbers~0.base)_2) = -1*ULTIMATE.start_bubbleSort_~numbers.offset - 4*ULTIMATE.start_bubbleSort_~j~0 + 1*v_rep(select #length ULTIMATE.start_main_~numbers~0.base)_2 Supporting invariants [] [2021-08-27 17:37:07,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2021-08-27 17:37:07,217 INFO L297 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2021-08-27 17:37:07,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:37:07,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:37:07,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-27 17:37:07,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:37:07,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:37:07,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-27 17:37:07,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:37:07,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:37:07,324 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 [2021-08-27 17:37:07,324 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 25 transitions. cyclomatic complexity: 9 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:37:07,354 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 25 transitions. cyclomatic complexity: 9. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 34 states and 47 transitions. Complement of second has 8 states. [2021-08-27 17:37:07,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2021-08-27 17:37:07,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:37:07,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2021-08-27 17:37:07,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 11 letters. Loop has 3 letters. [2021-08-27 17:37:07,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:37:07,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 14 letters. Loop has 3 letters. [2021-08-27 17:37:07,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:37:07,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 11 letters. Loop has 6 letters. [2021-08-27 17:37:07,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:37:07,356 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 47 transitions. [2021-08-27 17:37:07,357 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-27 17:37:07,357 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 24 states and 32 transitions. [2021-08-27 17:37:07,357 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-08-27 17:37:07,357 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2021-08-27 17:37:07,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 32 transitions. [2021-08-27 17:37:07,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 17:37:07,358 INFO L681 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2021-08-27 17:37:07,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 32 transitions. [2021-08-27 17:37:07,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2021-08-27 17:37:07,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.263157894736842) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:37:07,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2021-08-27 17:37:07,359 INFO L704 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2021-08-27 17:37:07,359 INFO L587 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2021-08-27 17:37:07,359 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-08-27 17:37:07,359 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2021-08-27 17:37:07,360 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-27 17:37:07,360 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:37:07,360 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:37:07,360 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:37:07,360 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 17:37:07,361 INFO L791 eck$LassoCheckResult]: Stem: 492#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 493#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 490#L527 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 491#L527-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;main_~k~0 := 0; 496#L532-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet11; 494#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 495#L532-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet11; 507#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 508#L532-3 assume !(main_~k~0 < main_~array_size~0); 497#L532-4 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; 498#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 501#L516-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 502#L515-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 504#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 499#L516-3 [2021-08-27 17:37:07,361 INFO L793 eck$LassoCheckResult]: Loop: 499#L516-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); 500#L517 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); 505#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 499#L516-3 [2021-08-27 17:37:07,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:37:07,361 INFO L82 PathProgramCache]: Analyzing trace with hash -793649948, now seen corresponding path program 1 times [2021-08-27 17:37:07,361 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:37:07,361 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793095862] [2021-08-27 17:37:07,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:37:07,362 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:37:07,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:37:07,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2021-08-27 17:37:07,453 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:37:07,454 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:37:07,454 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793095862] [2021-08-27 17:37:07,454 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793095862] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:37:07,454 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798979037] [2021-08-27 17:37:07,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:37:07,454 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:37:07,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:37:07,455 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:37:07,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2021-08-27 17:37:07,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:37:07,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-27 17:37:07,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:37:07,592 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:37:07,592 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1798979037] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:37:07,592 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:37:07,593 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-08-27 17:37:07,593 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965985847] [2021-08-27 17:37:07,593 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:37:07,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:37:07,593 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 3 times [2021-08-27 17:37:07,593 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:37:07,594 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384779006] [2021-08-27 17:37:07,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:37:07,594 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:37:07,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:37:07,600 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:37:07,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:37:07,603 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:37:07,667 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:37:07,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 17:37:07,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-08-27 17:37:07,668 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. cyclomatic complexity: 8 Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:37:07,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:37:07,746 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2021-08-27 17:37:07,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 17:37:07,747 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 34 transitions. [2021-08-27 17:37:07,747 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-27 17:37:07,748 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 34 transitions. [2021-08-27 17:37:07,748 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-08-27 17:37:07,748 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2021-08-27 17:37:07,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 34 transitions. [2021-08-27 17:37:07,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 17:37:07,748 INFO L681 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2021-08-27 17:37:07,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 34 transitions. [2021-08-27 17:37:07,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 20. [2021-08-27 17:37:07,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.25) internal successors, (25), 19 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:37:07,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2021-08-27 17:37:07,750 INFO L704 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2021-08-27 17:37:07,750 INFO L587 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2021-08-27 17:37:07,750 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-08-27 17:37:07,750 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2021-08-27 17:37:07,750 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-27 17:37:07,750 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:37:07,750 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:37:07,751 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:37:07,751 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 17:37:07,751 INFO L791 eck$LassoCheckResult]: Stem: 596#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 597#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 594#L527 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 595#L527-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;main_~k~0 := 0; 598#L532-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet11; 612#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 613#L532-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet11; 599#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 600#L532-3 assume !(main_~k~0 < main_~array_size~0); 601#L532-4 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; 602#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 605#L516-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); 606#L517 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5; 611#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 608#L516-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 609#L515-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 607#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 603#L516-3 [2021-08-27 17:37:07,751 INFO L793 eck$LassoCheckResult]: Loop: 603#L516-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); 604#L517 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); 610#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 603#L516-3 [2021-08-27 17:37:07,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:37:07,751 INFO L82 PathProgramCache]: Analyzing trace with hash 221564791, now seen corresponding path program 1 times [2021-08-27 17:37:07,752 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:37:07,752 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271409488] [2021-08-27 17:37:07,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:37:07,752 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:37:07,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:37:07,772 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:37:07,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:37:07,780 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:37:07,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:37:07,781 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 4 times [2021-08-27 17:37:07,781 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:37:07,781 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681429784] [2021-08-27 17:37:07,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:37:07,782 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:37:07,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:37:07,785 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:37:07,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:37:07,787 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:37:07,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:37:07,788 INFO L82 PathProgramCache]: Analyzing trace with hash -728006444, now seen corresponding path program 1 times [2021-08-27 17:37:07,788 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:37:07,788 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467166542] [2021-08-27 17:37:07,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:37:07,788 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:37:07,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:37:07,840 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 17:37:07,840 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:37:07,840 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467166542] [2021-08-27 17:37:07,840 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467166542] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:37:07,841 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1706952412] [2021-08-27 17:37:07,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:37:07,841 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:37:07,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:37:07,854 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:37:07,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2021-08-27 17:37:07,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:37:07,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-27 17:37:07,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:37:08,019 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 17:37:08,020 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1706952412] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:37:08,020 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:37:08,020 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2021-08-27 17:37:08,020 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477363995] [2021-08-27 17:37:08,085 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:37:08,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 17:37:08,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-08-27 17:37:08,086 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. cyclomatic complexity: 8 Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:37:08,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:37:08,176 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2021-08-27 17:37:08,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 17:37:08,176 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 44 transitions. [2021-08-27 17:37:08,177 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-27 17:37:08,177 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 23 states and 28 transitions. [2021-08-27 17:37:08,177 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-08-27 17:37:08,177 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2021-08-27 17:37:08,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 28 transitions. [2021-08-27 17:37:08,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 17:37:08,177 INFO L681 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2021-08-27 17:37:08,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 28 transitions. [2021-08-27 17:37:08,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2021-08-27 17:37:08,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:37:08,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2021-08-27 17:37:08,179 INFO L704 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2021-08-27 17:37:08,179 INFO L587 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2021-08-27 17:37:08,179 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-08-27 17:37:08,179 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2021-08-27 17:37:08,179 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-27 17:37:08,179 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:37:08,180 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:37:08,180 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:37:08,180 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 17:37:08,180 INFO L791 eck$LassoCheckResult]: Stem: 732#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 733#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 730#L527 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 731#L527-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;main_~k~0 := 0; 736#L532-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet11; 734#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 735#L532-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet11; 751#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 748#L532-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet11; 749#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 750#L532-3 assume !(main_~k~0 < main_~array_size~0); 737#L532-4 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; 738#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 741#L516-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); 742#L517 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5; 747#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 744#L516-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 745#L515-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 743#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 739#L516-3 [2021-08-27 17:37:08,180 INFO L793 eck$LassoCheckResult]: Loop: 739#L516-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); 740#L517 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); 746#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 739#L516-3 [2021-08-27 17:37:08,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:37:08,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1850126805, now seen corresponding path program 2 times [2021-08-27 17:37:08,181 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:37:08,181 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081921335] [2021-08-27 17:37:08,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:37:08,181 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:37:08,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:37:08,264 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:37:08,264 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:37:08,264 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081921335] [2021-08-27 17:37:08,264 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081921335] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:37:08,265 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87467863] [2021-08-27 17:37:08,265 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 17:37:08,265 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:37:08,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:37:08,266 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:37:08,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2021-08-27 17:37:08,345 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-27 17:37:08,345 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 17:37:08,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-27 17:37:08,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:37:08,468 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:37:08,468 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [87467863] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:37:08,468 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:37:08,468 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2021-08-27 17:37:08,468 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127756656] [2021-08-27 17:37:08,469 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:37:08,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:37:08,469 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 5 times [2021-08-27 17:37:08,469 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:37:08,469 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548242988] [2021-08-27 17:37:08,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:37:08,469 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:37:08,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:37:08,473 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:37:08,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:37:08,475 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:37:08,550 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:37:08,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-27 17:37:08,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2021-08-27 17:37:08,551 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand has 15 states, 15 states have (on average 2.2) internal successors, (33), 15 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:37:08,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:37:08,689 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2021-08-27 17:37:08,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 17:37:08,690 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 40 transitions. [2021-08-27 17:37:08,690 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-27 17:37:08,691 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 40 transitions. [2021-08-27 17:37:08,691 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-08-27 17:37:08,691 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2021-08-27 17:37:08,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 40 transitions. [2021-08-27 17:37:08,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 17:37:08,691 INFO L681 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2021-08-27 17:37:08,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 40 transitions. [2021-08-27 17:37:08,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2021-08-27 17:37:08,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:37:08,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2021-08-27 17:37:08,693 INFO L704 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2021-08-27 17:37:08,693 INFO L587 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2021-08-27 17:37:08,693 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-08-27 17:37:08,693 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 31 transitions. [2021-08-27 17:37:08,693 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-27 17:37:08,693 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:37:08,693 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:37:08,694 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:37:08,694 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 17:37:08,694 INFO L791 eck$LassoCheckResult]: Stem: 869#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 870#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 867#L527 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 868#L527-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;main_~k~0 := 0; 873#L532-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet11; 871#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 872#L532-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet11; 886#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 889#L532-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet11; 888#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 887#L532-3 assume !(main_~k~0 < main_~array_size~0); 874#L532-4 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; 875#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 880#L516-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); 891#L517 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5; 890#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 878#L516-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); 879#L517 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5; 885#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 882#L516-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 883#L515-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 881#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 876#L516-3 [2021-08-27 17:37:08,694 INFO L793 eck$LassoCheckResult]: Loop: 876#L516-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); 877#L517 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); 884#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 876#L516-3 [2021-08-27 17:37:08,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:37:08,695 INFO L82 PathProgramCache]: Analyzing trace with hash -135460634, now seen corresponding path program 3 times [2021-08-27 17:37:08,695 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:37:08,695 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980007585] [2021-08-27 17:37:08,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:37:08,695 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:37:08,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:37:08,705 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:37:08,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:37:08,715 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:37:08,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:37:08,716 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 6 times [2021-08-27 17:37:08,716 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:37:08,716 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400462572] [2021-08-27 17:37:08,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:37:08,716 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:37:08,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:37:08,719 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:37:08,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:37:08,721 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:37:08,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:37:08,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1761549573, now seen corresponding path program 2 times [2021-08-27 17:37:08,722 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:37:08,722 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805530317] [2021-08-27 17:37:08,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:37:08,722 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:37:08,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:37:08,888 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-27 17:37:08,888 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:37:08,889 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805530317] [2021-08-27 17:37:08,889 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805530317] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:37:08,889 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771585273] [2021-08-27 17:37:08,889 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 17:37:08,889 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 17:37:08,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:37:08,890 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 17:37:08,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2021-08-27 17:37:08,991 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-27 17:37:08,992 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 17:37:08,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 18 conjunts are in the unsatisfiable core [2021-08-27 17:37:08,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:37:09,134 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-27 17:37:09,135 INFO L388 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 [2021-08-27 17:37:09,147 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-27 17:37:09,147 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1771585273] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 17:37:09,147 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 17:37:09,147 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 13 [2021-08-27 17:37:09,147 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085882622] [2021-08-27 17:37:09,214 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:37:09,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-27 17:37:09,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2021-08-27 17:37:09,215 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. cyclomatic complexity: 9 Second operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:37:09,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:37:09,365 INFO L93 Difference]: Finished difference Result 47 states and 63 transitions. [2021-08-27 17:37:09,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 17:37:09,366 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 63 transitions. [2021-08-27 17:37:09,367 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-08-27 17:37:09,367 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 47 states and 63 transitions. [2021-08-27 17:37:09,367 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2021-08-27 17:37:09,367 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2021-08-27 17:37:09,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 63 transitions. [2021-08-27 17:37:09,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-27 17:37:09,368 INFO L681 BuchiCegarLoop]: Abstraction has 47 states and 63 transitions. [2021-08-27 17:37:09,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 63 transitions. [2021-08-27 17:37:09,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 36. [2021-08-27 17:37:09,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 35 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 17:37:09,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2021-08-27 17:37:09,369 INFO L704 BuchiCegarLoop]: Abstraction has 36 states and 48 transitions. [2021-08-27 17:37:09,370 INFO L587 BuchiCegarLoop]: Abstraction has 36 states and 48 transitions. [2021-08-27 17:37:09,370 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-08-27 17:37:09,370 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 48 transitions. [2021-08-27 17:37:09,370 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-27 17:37:09,370 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:37:09,370 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:37:09,371 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:37:09,371 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-27 17:37:09,371 INFO L791 eck$LassoCheckResult]: Stem: 1043#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1044#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 1041#L527 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1042#L527-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;main_~k~0 := 0; 1045#L532-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet11; 1060#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 1061#L532-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet11; 1046#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 1047#L532-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet11, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet11; 1064#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 1063#L532-3 assume !(main_~k~0 < main_~array_size~0); 1048#L532-4 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; 1049#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 1052#L516-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); 1053#L517 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5; 1058#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 1059#L516-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); 1075#L517 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); 1073#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 1074#L516-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 1054#L515-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 1055#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 1050#L516-3 [2021-08-27 17:37:09,371 INFO L793 eck$LassoCheckResult]: Loop: 1050#L516-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); 1051#L517 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); 1057#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 1050#L516-3 [2021-08-27 17:37:09,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:37:09,371 INFO L82 PathProgramCache]: Analyzing trace with hash -137307676, now seen corresponding path program 3 times [2021-08-27 17:37:09,372 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:37:09,372 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241164050] [2021-08-27 17:37:09,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:37:09,372 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:37:09,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:37:09,381 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:37:09,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:37:09,391 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:37:09,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:37:09,392 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 7 times [2021-08-27 17:37:09,392 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:37:09,392 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013317589] [2021-08-27 17:37:09,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:37:09,392 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:37:09,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:37:09,395 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:37:09,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:37:09,397 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:37:09,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:37:09,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1724071097, now seen corresponding path program 4 times [2021-08-27 17:37:09,398 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:37:09,398 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499440902] [2021-08-27 17:37:09,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:37:09,398 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:37:09,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:37:09,406 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:37:09,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:37:09,416 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:37:10,396 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 17:37:10,396 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 17:37:10,396 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 17:37:10,396 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 17:37:10,397 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 17:37:10,397 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:37:10,397 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 17:37:10,397 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 17:37:10,397 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-2.i_Iteration9_Lasso [2021-08-27 17:37:10,397 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 17:37:10,397 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 17:37:10,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:37:10,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:37:10,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:37:10,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:37:10,444 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: MapEliminator tries to combine Int and (Array Int Int) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:330) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:280) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:953) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:862) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:252) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:457) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:398) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-08-27 17:37:10,446 INFO L168 Benchmark]: Toolchain (without parser) took 8748.38 ms. Allocated memory was 56.6 MB in the beginning and 182.5 MB in the end (delta: 125.8 MB). Free memory was 33.9 MB in the beginning and 142.9 MB in the end (delta: -109.0 MB). Peak memory consumption was 114.9 MB. Max. memory is 16.1 GB. [2021-08-27 17:37:10,446 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 56.6 MB. Free memory was 37.9 MB in the beginning and 37.8 MB in the end (delta: 38.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 17:37:10,447 INFO L168 Benchmark]: CACSL2BoogieTranslator took 334.19 ms. Allocated memory is still 56.6 MB. Free memory was 33.7 MB in the beginning and 34.1 MB in the end (delta: -480.6 kB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-08-27 17:37:10,447 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.59 ms. Allocated memory is still 56.6 MB. Free memory was 34.1 MB in the beginning and 32.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 17:37:10,447 INFO L168 Benchmark]: Boogie Preprocessor took 40.43 ms. Allocated memory is still 56.6 MB. Free memory was 32.1 MB in the beginning and 30.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 17:37:10,447 INFO L168 Benchmark]: RCFGBuilder took 338.10 ms. Allocated memory was 56.6 MB in the beginning and 69.2 MB in the end (delta: 12.6 MB). Free memory was 30.7 MB in the beginning and 41.8 MB in the end (delta: -11.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 16.1 GB. [2021-08-27 17:37:10,448 INFO L168 Benchmark]: BuchiAutomizer took 7989.46 ms. Allocated memory was 69.2 MB in the beginning and 182.5 MB in the end (delta: 113.2 MB). Free memory was 41.8 MB in the beginning and 142.9 MB in the end (delta: -101.1 MB). Peak memory consumption was 110.0 MB. Max. memory is 16.1 GB. [2021-08-27 17:37:10,449 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 56.6 MB. Free memory was 37.9 MB in the beginning and 37.8 MB in the end (delta: 38.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 334.19 ms. Allocated memory is still 56.6 MB. Free memory was 33.7 MB in the beginning and 34.1 MB in the end (delta: -480.6 kB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 42.59 ms. Allocated memory is still 56.6 MB. Free memory was 34.1 MB in the beginning and 32.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 40.43 ms. Allocated memory is still 56.6 MB. Free memory was 32.1 MB in the beginning and 30.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 338.10 ms. Allocated memory was 56.6 MB in the beginning and 69.2 MB in the end (delta: 12.6 MB). Free memory was 30.7 MB in the beginning and 41.8 MB in the end (delta: -11.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 7989.46 ms. Allocated memory was 69.2 MB in the beginning and 182.5 MB in the end (delta: 113.2 MB). Free memory was 41.8 MB in the beginning and 142.9 MB in the end (delta: -101.1 MB). Peak memory consumption was 110.0 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: MapEliminator tries to combine Int and (Array Int Int): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-08-27 17:37:10,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Forceful destruction successful, exit code 0 [2021-08-27 17:37:10,686 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Ended with exit code 0 [2021-08-27 17:37:10,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2021-08-27 17:37:11,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2021-08-27 17:37:11,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2021-08-27 17:37:11,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...