./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 9a8b2e8d 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.3.100.v20150511-1540.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.1.25-9a8b2e8 [2020-10-20 08:17:47,449 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 08:17:47,452 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 08:17:47,493 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 08:17:47,494 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 08:17:47,504 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 08:17:47,507 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 08:17:47,510 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 08:17:47,513 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 08:17:47,516 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 08:17:47,518 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 08:17:47,519 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 08:17:47,520 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 08:17:47,523 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 08:17:47,524 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 08:17:47,526 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 08:17:47,528 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 08:17:47,529 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 08:17:47,532 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 08:17:47,538 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 08:17:47,548 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 08:17:47,550 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 08:17:47,552 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 08:17:47,553 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 08:17:47,564 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 08:17:47,564 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 08:17:47,565 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 08:17:47,566 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 08:17:47,566 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 08:17:47,567 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 08:17:47,567 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 08:17:47,568 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 08:17:47,570 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 08:17:47,571 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 08:17:47,573 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 08:17:47,574 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 08:17:47,574 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 08:17:47,575 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 08:17:47,575 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 08:17:47,576 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 08:17:47,577 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 08:17:47,578 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-20 08:17:47,619 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 08:17:47,619 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 08:17:47,621 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 08:17:47,622 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 08:17:47,622 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 08:17:47,622 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-20 08:17:47,622 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-20 08:17:47,623 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-20 08:17:47,623 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-20 08:17:47,623 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-20 08:17:47,624 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-20 08:17:47,625 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 08:17:47,625 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 08:17:47,626 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 08:17:47,626 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 08:17:47,626 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 08:17:47,626 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 08:17:47,627 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-20 08:17:47,627 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-20 08:17:47,628 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-20 08:17:47,629 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 08:17:47,630 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 08:17:47,631 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-20 08:17:47,633 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 08:17:47,633 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-20 08:17:47,633 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 08:17:47,634 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 08:17:47,634 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-20 08:17:47,634 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 08:17:47,634 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 08:17:47,635 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 08:17:47,635 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-20 08:17:47,636 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-20 08:17:47,636 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /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 [2020-10-20 08:17:47,852 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 08:17:47,865 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 08:17:47,869 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 08:17:47,871 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 08:17:47,872 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 08:17:47,873 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 [2020-10-20 08:17:47,959 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da1732bf5/a3ca1d5deb734d5cb52708a5333d96ea/FLAGf23c8d536 [2020-10-20 08:17:48,536 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 08:17:48,536 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/bubblesort-alloca-2.i [2020-10-20 08:17:48,550 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da1732bf5/a3ca1d5deb734d5cb52708a5333d96ea/FLAGf23c8d536 [2020-10-20 08:17:48,858 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da1732bf5/a3ca1d5deb734d5cb52708a5333d96ea [2020-10-20 08:17:48,862 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 08:17:48,869 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 08:17:48,870 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 08:17:48,870 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 08:17:48,873 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 08:17:48,874 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 08:17:48" (1/1) ... [2020-10-20 08:17:48,877 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@790c4b14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:17:48, skipping insertion in model container [2020-10-20 08:17:48,878 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 08:17:48" (1/1) ... [2020-10-20 08:17:48,885 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 08:17:48,941 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 08:17:49,324 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 08:17:49,335 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 08:17:49,378 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 08:17:49,437 INFO L208 MainTranslator]: Completed translation [2020-10-20 08:17:49,438 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:17:49 WrapperNode [2020-10-20 08:17:49,438 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 08:17:49,440 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 08:17:49,441 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 08:17:49,441 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 08:17:49,451 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:17:49" (1/1) ... [2020-10-20 08:17:49,481 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:17:49" (1/1) ... [2020-10-20 08:17:49,516 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 08:17:49,516 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 08:17:49,517 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 08:17:49,517 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 08:17:49,533 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:17:49" (1/1) ... [2020-10-20 08:17:49,534 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:17:49" (1/1) ... [2020-10-20 08:17:49,550 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:17:49" (1/1) ... [2020-10-20 08:17:49,550 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:17:49" (1/1) ... [2020-10-20 08:17:49,564 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:17:49" (1/1) ... [2020-10-20 08:17:49,570 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:17:49" (1/1) ... [2020-10-20 08:17:49,576 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:17:49" (1/1) ... [2020-10-20 08:17:49,582 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 08:17:49,583 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 08:17:49,583 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 08:17:49,583 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 08:17:49,584 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:17:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:49,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-20 08:17:49,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-20 08:17:49,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 08:17:49,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 08:17:49,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 08:17:49,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 08:17:49,996 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 08:17:49,996 INFO L298 CfgBuilder]: Removed 9 assume(true) statements. [2020-10-20 08:17:49,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 08:17:49 BoogieIcfgContainer [2020-10-20 08:17:49,998 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 08:17:49,999 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-20 08:17:49,999 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-20 08:17:50,002 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-20 08:17:50,004 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 08:17:50,004 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.10 08:17:48" (1/3) ... [2020-10-20 08:17:50,005 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@711c3143 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 08:17:50, skipping insertion in model container [2020-10-20 08:17:50,005 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 08:17:50,006 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:17:49" (2/3) ... [2020-10-20 08:17:50,006 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@711c3143 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 08:17:50, skipping insertion in model container [2020-10-20 08:17:50,006 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 08:17:50,006 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 08:17:49" (3/3) ... [2020-10-20 08:17:50,008 INFO L373 chiAutomizerObserver]: Analyzing ICFG bubblesort-alloca-2.i [2020-10-20 08:17:50,052 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-20 08:17:50,053 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-20 08:17:50,053 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-20 08:17:50,053 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 08:17:50,053 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 08:17:50,053 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-20 08:17:50,053 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 08:17:50,053 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-20 08:17:50,068 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2020-10-20 08:17:50,088 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-10-20 08:17:50,088 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:17:50,089 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:17:50,095 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-20 08:17:50,095 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 08:17:50,095 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-20 08:17:50,095 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2020-10-20 08:17:50,097 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-10-20 08:17:50,097 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:17:50,097 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:17:50,097 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-20 08:17:50,098 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 08:17:50,104 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 9#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; 18#L527true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 3#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; 13#L532-3true [2020-10-20 08:17:50,104 INFO L796 eck$LassoCheckResult]: Loop: 13#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; 11#L532-2true main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 13#L532-3true [2020-10-20 08:17:50,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:50,110 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2020-10-20 08:17:50,117 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:50,118 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772881427] [2020-10-20 08:17:50,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:50,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:50,221 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:50,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:50,234 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:50,268 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:17:50,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:50,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2020-10-20 08:17:50,270 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:50,270 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502648077] [2020-10-20 08:17:50,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:50,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:50,282 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:50,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:50,289 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:50,292 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:17:50,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:50,294 INFO L82 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2020-10-20 08:17:50,294 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:50,295 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039552232] [2020-10-20 08:17:50,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:50,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:50,319 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:50,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:50,354 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:50,361 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:17:50,563 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2020-10-20 08:17:50,635 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:17:50,636 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:17:50,636 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:17:50,636 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:17:50,637 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 08:17:50,637 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:50,637 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:17:50,637 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:17:50,638 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-2.i_Iteration1_Lasso [2020-10-20 08:17:50,638 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:17:50,638 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:17:50,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:50,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:50,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:50,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:50,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:50,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:50,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:50,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:50,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:51,164 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 08:17:51,170 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:17:51,176 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:17:51,179 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:51,179 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:51,180 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:51,180 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:51,180 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:51,183 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:51,183 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:51,191 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:17:51,229 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:17:51,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:51,233 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:51,233 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:51,233 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:51,233 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:51,237 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:51,237 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:51,245 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:17:51,282 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:51,285 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:51,285 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:51,285 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:51,286 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:51,289 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:51,290 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:51,294 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:51,333 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:17:51,335 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:51,335 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:51,335 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:51,336 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:51,339 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:51,339 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:51,343 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:51,386 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:17:51,388 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:51,388 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:51,388 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:51,388 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:51,389 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:51,390 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:51,390 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:17:51,392 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:51,432 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:17:51,434 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:51,434 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:51,434 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:51,434 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:51,438 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:51,438 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:51,443 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:51,471 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:17:51,473 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:51,474 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:51,474 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:51,474 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:51,476 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:51,477 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:51,484 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:17:51,531 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:17:51,533 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:51,533 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:51,534 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:51,534 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:51,534 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:51,535 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:51,535 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:17:51,537 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:51,567 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:17:51,568 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:51,569 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:51,569 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:51,569 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:51,575 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:51,576 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:51,600 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:51,628 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:17:51,630 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:51,631 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:51,631 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:51,631 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:51,635 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:51,635 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:51,640 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:51,667 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:17:51,668 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:51,669 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:51,669 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:51,669 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:51,675 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:51,675 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:51,682 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:51,727 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:17:51,729 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:51,729 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:51,729 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:51,729 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:51,729 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:51,730 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:51,730 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:17:51,733 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:51,760 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:17:51,762 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:51,762 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:51,762 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:51,762 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:51,770 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:51,770 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:51,785 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 08:17:51,837 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2020-10-20 08:17:51,837 INFO L444 ModelExtractionUtils]: 8 out of 22 variables were initially zero. Simplification set additionally 10 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:17:51,849 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:51,853 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-10-20 08:17:51,853 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 08:17:51,854 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0, v_rep(select #length ULTIMATE.start_main_~numbers~0.base)_1) = -4*ULTIMATE.start_main_~k~0 + 1*v_rep(select #length ULTIMATE.start_main_~numbers~0.base)_1 Supporting invariants [1*ULTIMATE.start_main_~numbers~0.offset >= 0] [2020-10-20 08:17:51,905 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2020-10-20 08:17:51,917 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-20 08:17:51,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:51,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:17:51,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 08:17:51,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:17:52,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:17:52,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-20 08:17:52,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:17:52,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:17:52,103 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 [2020-10-20 08:17:52,104 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states. Second operand 3 states. [2020-10-20 08:17:52,206 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states.. Second operand 3 states. Result 38 states and 56 transitions. Complement of second has 7 states. [2020-10-20 08:17:52,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-20 08:17:52,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 08:17:52,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2020-10-20 08:17:52,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 4 letters. Loop has 2 letters. [2020-10-20 08:17:52,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:17:52,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 6 letters. Loop has 2 letters. [2020-10-20 08:17:52,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:17:52,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 4 letters. Loop has 4 letters. [2020-10-20 08:17:52,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:17:52,216 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 56 transitions. [2020-10-20 08:17:52,219 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-20 08:17:52,224 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 13 states and 18 transitions. [2020-10-20 08:17:52,225 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-10-20 08:17:52,225 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-10-20 08:17:52,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2020-10-20 08:17:52,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:17:52,227 INFO L691 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2020-10-20 08:17:52,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2020-10-20 08:17:52,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-10-20 08:17:52,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-20 08:17:52,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2020-10-20 08:17:52,258 INFO L714 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2020-10-20 08:17:52,258 INFO L594 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2020-10-20 08:17:52,258 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-20 08:17:52,259 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2020-10-20 08:17:52,259 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-20 08:17:52,260 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:17:52,260 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:17:52,260 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-10-20 08:17:52,260 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 08:17:52,261 INFO L794 eck$LassoCheckResult]: Stem: 122#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 120#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); 123#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; 124#L532-3 assume !(main_~k~0 < main_~array_size~0); 132#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; 131#L515-3 [2020-10-20 08:17:52,261 INFO L796 eck$LassoCheckResult]: Loop: 131#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 128#L516-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 129#L515-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 131#L515-3 [2020-10-20 08:17:52,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:52,262 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2020-10-20 08:17:52,262 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:52,262 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766921619] [2020-10-20 08:17:52,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:52,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:17:52,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:17:52,324 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766921619] [2020-10-20 08:17:52,325 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:17:52,325 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 08:17:52,326 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084401561] [2020-10-20 08:17:52,329 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:17:52,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:52,330 INFO L82 PathProgramCache]: Analyzing trace with hash 60779, now seen corresponding path program 1 times [2020-10-20 08:17:52,330 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:52,330 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710678613] [2020-10-20 08:17:52,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:52,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:52,335 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:52,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:52,338 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:52,340 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:17:52,363 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:17:52,363 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:17:52,363 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:17:52,363 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:17:52,364 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 08:17:52,364 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:52,364 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:17:52,364 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:17:52,364 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-2.i_Iteration2_Loop [2020-10-20 08:17:52,364 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:17:52,364 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:17:52,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:52,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:52,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:52,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:52,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:52,468 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 08:17:52,469 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:52,479 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:17:52,480 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 08:17:52,485 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 08:17:52,485 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_bubbleSort_#t~post2=0} Honda state: {ULTIMATE.start_bubbleSort_#t~post2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:52,525 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:17:52,525 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 08:17:52,529 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 08:17:52,529 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: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:17:52,576 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:17:52,576 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:52,581 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 08:17:52,581 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: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:17:52,646 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:17:52,646 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:52,720 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 08:17:52,720 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 08:17:52,771 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 08:17:52,772 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:17:52,773 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:17:52,773 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:17:52,773 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:17:52,773 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 08:17:52,773 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:52,773 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:17:52,773 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:17:52,774 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-2.i_Iteration2_Loop [2020-10-20 08:17:52,774 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:17:52,774 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:17:52,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:52,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:52,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:52,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:52,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:52,895 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 08:17:52,895 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:17:52,905 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:17:52,907 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:52,907 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:52,907 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:52,907 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:52,907 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:52,908 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:52,908 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:52,910 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:17:52,951 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:17:52,952 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:52,953 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:52,953 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:52,953 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:52,955 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:52,955 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:52,960 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:17:53,000 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:17:53,002 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:53,002 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:53,002 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:53,003 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:53,003 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:53,004 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:53,004 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:53,007 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 08:17:53,011 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-20 08:17:53,011 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:17:53,014 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 08:17:53,014 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-20 08:17:53,014 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 08:17:53,015 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_bubbleSort_~i~0) = 2*ULTIMATE.start_bubbleSort_~i~0 + 1 Supporting invariants [] Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:53,050 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-20 08:17:53,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:53,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:17:53,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 08:17:53,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:17:53,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:17:53,085 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 08:17:53,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:17:53,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:17:53,096 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 [2020-10-20 08:17:53,096 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2020-10-20 08:17:53,112 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 18 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 19 states and 28 transitions. Complement of second has 4 states. [2020-10-20 08:17:53,113 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 [2020-10-20 08:17:53,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 08:17:53,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2020-10-20 08:17:53,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 6 letters. Loop has 3 letters. [2020-10-20 08:17:53,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:17:53,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 9 letters. Loop has 3 letters. [2020-10-20 08:17:53,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:17:53,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 6 letters. Loop has 6 letters. [2020-10-20 08:17:53,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:17:53,116 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 28 transitions. [2020-10-20 08:17:53,117 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 08:17:53,117 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 18 states and 26 transitions. [2020-10-20 08:17:53,118 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-10-20 08:17:53,118 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-10-20 08:17:53,118 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 26 transitions. [2020-10-20 08:17:53,118 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:17:53,118 INFO L691 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2020-10-20 08:17:53,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 26 transitions. [2020-10-20 08:17:53,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2020-10-20 08:17:53,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-10-20 08:17:53,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2020-10-20 08:17:53,121 INFO L714 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2020-10-20 08:17:53,121 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:17:53,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 08:17:53,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-20 08:17:53,126 INFO L87 Difference]: Start difference. First operand 17 states and 25 transitions. Second operand 4 states. [2020-10-20 08:17:53,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:17:53,156 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2020-10-20 08:17:53,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 08:17:53,156 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 25 transitions. [2020-10-20 08:17:53,157 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 08:17:53,158 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 25 transitions. [2020-10-20 08:17:53,158 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-10-20 08:17:53,158 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-10-20 08:17:53,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2020-10-20 08:17:53,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:17:53,159 INFO L691 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2020-10-20 08:17:53,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2020-10-20 08:17:53,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2020-10-20 08:17:53,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-10-20 08:17:53,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2020-10-20 08:17:53,161 INFO L714 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2020-10-20 08:17:53,161 INFO L594 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2020-10-20 08:17:53,161 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-20 08:17:53,161 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. [2020-10-20 08:17:53,162 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 08:17:53,162 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:17:53,162 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:17:53,163 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:17:53,163 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 08:17:53,163 INFO L794 eck$LassoCheckResult]: Stem: 236#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 234#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); 237#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; 238#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; 243#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 244#L532-3 assume !(main_~k~0 < main_~array_size~0); 249#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; 250#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 240#L516-3 [2020-10-20 08:17:53,163 INFO L796 eck$LassoCheckResult]: Loop: 240#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); 239#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 240#L516-3 [2020-10-20 08:17:53,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:53,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1185641744, now seen corresponding path program 1 times [2020-10-20 08:17:53,164 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:53,164 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411816901] [2020-10-20 08:17:53,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:53,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:53,180 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:53,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:53,193 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:53,197 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:17:53,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:53,198 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 1 times [2020-10-20 08:17:53,198 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:53,198 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81998088] [2020-10-20 08:17:53,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:53,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:53,220 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:53,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:53,231 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:53,235 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:17:53,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:53,236 INFO L82 PathProgramCache]: Analyzing trace with hash -357807973, now seen corresponding path program 1 times [2020-10-20 08:17:53,237 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:53,237 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516432795] [2020-10-20 08:17:53,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:53,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:17:53,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:17:53,348 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516432795] [2020-10-20 08:17:53,348 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891169320] [2020-10-20 08:17:53,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 08:17:53,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:17:53,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-20 08:17:53,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:17:53,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:17:53,444 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 08:17:53,445 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-20 08:17:53,445 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678270267] [2020-10-20 08:17:53,545 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:17:53,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-20 08:17:53,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-20 08:17:53,546 INFO L87 Difference]: Start difference. First operand 17 states and 24 transitions. cyclomatic complexity: 10 Second operand 9 states. [2020-10-20 08:17:53,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:17:53,686 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2020-10-20 08:17:53,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-20 08:17:53,687 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 41 transitions. [2020-10-20 08:17:53,688 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 08:17:53,689 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 20 states and 26 transitions. [2020-10-20 08:17:53,689 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-10-20 08:17:53,689 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-10-20 08:17:53,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2020-10-20 08:17:53,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:17:53,689 INFO L691 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2020-10-20 08:17:53,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2020-10-20 08:17:53,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2020-10-20 08:17:53,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-10-20 08:17:53,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2020-10-20 08:17:53,692 INFO L714 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2020-10-20 08:17:53,692 INFO L594 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2020-10-20 08:17:53,692 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-20 08:17:53,692 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2020-10-20 08:17:53,693 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 08:17:53,693 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:17:53,693 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:17:53,694 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:17:53,694 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 08:17:53,694 INFO L794 eck$LassoCheckResult]: Stem: 341#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 339#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); 342#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; 343#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; 350#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 357#L532-3 assume !(main_~k~0 < main_~array_size~0); 355#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; 356#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 347#L516-3 [2020-10-20 08:17:53,694 INFO L796 eck$LassoCheckResult]: Loop: 347#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); 351#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); 346#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 347#L516-3 [2020-10-20 08:17:53,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:53,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1237095790, now seen corresponding path program 2 times [2020-10-20 08:17:53,695 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:53,695 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006667881] [2020-10-20 08:17:53,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:53,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:53,708 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:53,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:53,720 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:53,724 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:17:53,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:53,725 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 2 times [2020-10-20 08:17:53,725 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:53,725 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711705788] [2020-10-20 08:17:53,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:53,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:53,731 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:53,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:53,738 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:53,740 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:17:53,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:53,744 INFO L82 PathProgramCache]: Analyzing trace with hash -793648259, now seen corresponding path program 2 times [2020-10-20 08:17:53,744 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:53,744 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511893262] [2020-10-20 08:17:53,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:53,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:53,780 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:53,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:53,797 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:53,804 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:17:54,164 WARN L193 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 81 [2020-10-20 08:17:54,253 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:17:54,253 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:17:54,253 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:17:54,253 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:17:54,253 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 08:17:54,253 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:54,253 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:17:54,253 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:17:54,254 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-2.i_Iteration4_Lasso [2020-10-20 08:17:54,254 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:17:54,254 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:17:54,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:54,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:54,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:54,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:54,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:54,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:54,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:54,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:54,421 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2020-10-20 08:17:54,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:54,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:54,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:54,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:54,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:54,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:54,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:54,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:54,850 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 08:17:54,850 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:54,863 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:17:54,864 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:54,864 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:54,864 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:54,865 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:54,865 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:54,865 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:54,866 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:17:54,867 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:17:54,903 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:17:54,905 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:54,906 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:54,906 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:54,906 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:54,909 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:54,909 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:54,917 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:54,952 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:17:54,953 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:54,953 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:54,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:54,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:54,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:54,954 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:54,954 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:17:54,955 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:54,979 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:17:54,980 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:54,980 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:54,980 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:54,980 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:54,982 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:54,982 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:54,987 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:55,013 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:17:55,015 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:55,015 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:55,015 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:55,015 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:55,015 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:55,016 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:55,016 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:17:55,017 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:55,042 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:17:55,043 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:55,043 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:17:55,043 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:55,043 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:55,043 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:55,044 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:17:55,045 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:17:55,046 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:55,069 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:17:55,071 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:55,071 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:55,071 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:55,071 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:55,077 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:55,077 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:55,081 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:55,117 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:17:55,119 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:17:55,120 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:17:55,120 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:17:55,120 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:17:55,127 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 08:17:55,128 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 08:17:55,147 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 08:17:55,190 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2020-10-20 08:17:55,190 INFO L444 ModelExtractionUtils]: 10 out of 40 variables were initially zero. Simplification set additionally 26 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:17:55,196 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:55,199 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 08:17:55,199 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 08:17:55,199 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_bubbleSort_~i~0, ULTIMATE.start_bubbleSort_~j~0) = 2*ULTIMATE.start_bubbleSort_~i~0 - 2*ULTIMATE.start_bubbleSort_~j~0 + 1 Supporting invariants [] [2020-10-20 08:17:55,243 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2020-10-20 08:17:55,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:55,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:17:55,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 08:17:55,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:17:55,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:17:55,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 08:17:55,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:17:55,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:17:55,292 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 [2020-10-20 08:17:55,293 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 25 transitions. cyclomatic complexity: 9 Second operand 3 states. [2020-10-20 08:17:55,316 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 25 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 34 states and 47 transitions. Complement of second has 7 states. [2020-10-20 08:17:55,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-20 08:17:55,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 08:17:55,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2020-10-20 08:17:55,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 3 letters. [2020-10-20 08:17:55,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:17:55,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 14 letters. Loop has 3 letters. [2020-10-20 08:17:55,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:17:55,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 6 letters. [2020-10-20 08:17:55,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:17:55,318 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 47 transitions. [2020-10-20 08:17:55,320 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 08:17:55,320 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 24 states and 32 transitions. [2020-10-20 08:17:55,321 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-10-20 08:17:55,321 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-10-20 08:17:55,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 32 transitions. [2020-10-20 08:17:55,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:17:55,321 INFO L691 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2020-10-20 08:17:55,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 32 transitions. [2020-10-20 08:17:55,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2020-10-20 08:17:55,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-10-20 08:17:55,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2020-10-20 08:17:55,323 INFO L714 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2020-10-20 08:17:55,323 INFO L594 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2020-10-20 08:17:55,324 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-20 08:17:55,324 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2020-10-20 08:17:55,324 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 08:17:55,324 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:17:55,325 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:17:55,325 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:17:55,325 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 08:17:55,325 INFO L794 eck$LassoCheckResult]: Stem: 476#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 474#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; 475#L527 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 477#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; 478#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; 483#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 484#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; 487#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 492#L532-3 assume !(main_~k~0 < main_~array_size~0); 491#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; 490#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 482#L516-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 485#L515-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 486#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 480#L516-3 [2020-10-20 08:17:55,326 INFO L796 eck$LassoCheckResult]: Loop: 480#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); 488#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); 479#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 480#L516-3 [2020-10-20 08:17:55,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:55,326 INFO L82 PathProgramCache]: Analyzing trace with hash -793649948, now seen corresponding path program 1 times [2020-10-20 08:17:55,326 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:55,326 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799436975] [2020-10-20 08:17:55,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:55,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:17:55,378 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:17:55,378 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799436975] [2020-10-20 08:17:55,379 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097057382] [2020-10-20 08:17:55,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 08:17:55,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:17:55,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-20 08:17:55,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:17:55,457 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:17:55,458 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 08:17:55,458 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-20 08:17:55,458 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246385061] [2020-10-20 08:17:55,458 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:17:55,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:55,459 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 3 times [2020-10-20 08:17:55,459 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:55,459 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288069257] [2020-10-20 08:17:55,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:55,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:55,465 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:55,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:55,469 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:55,471 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:17:55,589 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:17:55,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-20 08:17:55,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-10-20 08:17:55,590 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. cyclomatic complexity: 8 Second operand 9 states. [2020-10-20 08:17:55,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:17:55,683 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2020-10-20 08:17:55,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 08:17:55,683 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 34 transitions. [2020-10-20 08:17:55,684 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 08:17:55,685 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 34 transitions. [2020-10-20 08:17:55,685 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-10-20 08:17:55,685 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-10-20 08:17:55,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 34 transitions. [2020-10-20 08:17:55,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:17:55,685 INFO L691 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2020-10-20 08:17:55,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 34 transitions. [2020-10-20 08:17:55,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 20. [2020-10-20 08:17:55,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-10-20 08:17:55,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2020-10-20 08:17:55,687 INFO L714 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2020-10-20 08:17:55,688 INFO L594 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2020-10-20 08:17:55,688 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-20 08:17:55,688 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2020-10-20 08:17:55,688 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 08:17:55,689 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:17:55,689 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:17:55,689 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:17:55,689 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 08:17:55,690 INFO L794 eck$LassoCheckResult]: Stem: 578#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 576#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; 577#L527 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 579#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; 580#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; 587#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 588#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; 581#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 582#L532-3 assume !(main_~k~0 < main_~array_size~0); 594#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; 595#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 590#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); 591#L517 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5; 585#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 586#L516-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 592#L515-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 593#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 584#L516-3 [2020-10-20 08:17:55,690 INFO L796 eck$LassoCheckResult]: Loop: 584#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); 589#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); 583#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 584#L516-3 [2020-10-20 08:17:55,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:55,690 INFO L82 PathProgramCache]: Analyzing trace with hash 221564791, now seen corresponding path program 1 times [2020-10-20 08:17:55,690 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:55,691 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374301151] [2020-10-20 08:17:55,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:55,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:55,705 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:55,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:55,718 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:55,722 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:17:55,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:55,723 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 4 times [2020-10-20 08:17:55,723 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:55,723 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833997728] [2020-10-20 08:17:55,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:55,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:55,728 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:55,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:55,735 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:55,739 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:17:55,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:55,740 INFO L82 PathProgramCache]: Analyzing trace with hash -728006444, now seen corresponding path program 1 times [2020-10-20 08:17:55,740 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:55,740 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951006458] [2020-10-20 08:17:55,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:55,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:17:55,849 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 08:17:55,849 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951006458] [2020-10-20 08:17:55,849 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590818107] [2020-10-20 08:17:55,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 08:17:55,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:17:55,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-20 08:17:55,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:17:55,949 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 08:17:55,950 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 08:17:55,950 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2020-10-20 08:17:55,950 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116717911] [2020-10-20 08:17:56,038 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:17:56,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-20 08:17:56,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-10-20 08:17:56,038 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. cyclomatic complexity: 8 Second operand 11 states. [2020-10-20 08:17:56,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:17:56,143 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2020-10-20 08:17:56,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-20 08:17:56,144 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 44 transitions. [2020-10-20 08:17:56,145 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 08:17:56,146 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 23 states and 28 transitions. [2020-10-20 08:17:56,146 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-10-20 08:17:56,146 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-10-20 08:17:56,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 28 transitions. [2020-10-20 08:17:56,147 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:17:56,147 INFO L691 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2020-10-20 08:17:56,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 28 transitions. [2020-10-20 08:17:56,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2020-10-20 08:17:56,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-10-20 08:17:56,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2020-10-20 08:17:56,150 INFO L714 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2020-10-20 08:17:56,150 INFO L594 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2020-10-20 08:17:56,150 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-20 08:17:56,150 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2020-10-20 08:17:56,151 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 08:17:56,151 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:17:56,151 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:17:56,152 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:17:56,152 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 08:17:56,152 INFO L794 eck$LassoCheckResult]: Stem: 714#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 712#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; 713#L527 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 715#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; 716#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; 723#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 724#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; 717#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 718#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; 733#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 732#L532-3 assume !(main_~k~0 < main_~array_size~0); 731#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; 730#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 726#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); 727#L517 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5; 721#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 722#L516-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 728#L515-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 729#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 720#L516-3 [2020-10-20 08:17:56,153 INFO L796 eck$LassoCheckResult]: Loop: 720#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); 725#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); 719#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 720#L516-3 [2020-10-20 08:17:56,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:56,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1850126805, now seen corresponding path program 2 times [2020-10-20 08:17:56,153 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:56,154 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509265462] [2020-10-20 08:17:56,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:56,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:17:56,237 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:17:56,237 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509265462] [2020-10-20 08:17:56,237 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034797401] [2020-10-20 08:17:56,238 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 08:17:56,285 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-20 08:17:56,285 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 08:17:56,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-20 08:17:56,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:17:56,344 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:17:56,344 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 08:17:56,344 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2020-10-20 08:17:56,345 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617118070] [2020-10-20 08:17:56,345 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:17:56,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:56,346 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 5 times [2020-10-20 08:17:56,346 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:56,346 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390647472] [2020-10-20 08:17:56,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:56,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:56,351 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:56,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:56,354 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:56,356 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:17:56,440 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:17:56,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-20 08:17:56,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-10-20 08:17:56,441 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand 12 states. [2020-10-20 08:17:56,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:17:56,642 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2020-10-20 08:17:56,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-20 08:17:56,643 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 40 transitions. [2020-10-20 08:17:56,644 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 08:17:56,645 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 40 transitions. [2020-10-20 08:17:56,645 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-10-20 08:17:56,645 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-10-20 08:17:56,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 40 transitions. [2020-10-20 08:17:56,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:17:56,645 INFO L691 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2020-10-20 08:17:56,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 40 transitions. [2020-10-20 08:17:56,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2020-10-20 08:17:56,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-10-20 08:17:56,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2020-10-20 08:17:56,649 INFO L714 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2020-10-20 08:17:56,649 INFO L594 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2020-10-20 08:17:56,649 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-20 08:17:56,649 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 31 transitions. [2020-10-20 08:17:56,650 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 08:17:56,650 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:17:56,650 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:17:56,651 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:17:56,651 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 08:17:56,651 INFO L794 eck$LassoCheckResult]: Stem: 848#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 846#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; 847#L527 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 849#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; 850#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; 855#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 856#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; 862#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 868#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; 867#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 866#L532-3 assume !(main_~k~0 < main_~array_size~0); 865#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; 863#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 864#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); 870#L517 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5; 869#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 858#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); 859#L517 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5; 853#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 854#L516-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 860#L515-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 861#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 852#L516-3 [2020-10-20 08:17:56,652 INFO L796 eck$LassoCheckResult]: Loop: 852#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); 857#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); 851#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 852#L516-3 [2020-10-20 08:17:56,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:56,652 INFO L82 PathProgramCache]: Analyzing trace with hash -135460634, now seen corresponding path program 3 times [2020-10-20 08:17:56,653 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:56,653 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032491916] [2020-10-20 08:17:56,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:56,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:56,673 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:56,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:56,692 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:56,698 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:17:56,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:56,699 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 6 times [2020-10-20 08:17:56,699 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:56,699 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998913308] [2020-10-20 08:17:56,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:56,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:56,704 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:56,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:56,710 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:56,712 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:17:56,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:56,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1761549573, now seen corresponding path program 2 times [2020-10-20 08:17:56,713 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:56,713 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909544139] [2020-10-20 08:17:56,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:56,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:17:56,996 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-20 08:17:57,015 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909544139] [2020-10-20 08:17:57,015 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447438049] [2020-10-20 08:17:57,016 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 08:17:57,069 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-20 08:17:57,069 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 08:17:57,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 20 conjunts are in the unsatisfiable core [2020-10-20 08:17:57,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:17:57,197 INFO L350 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2020-10-20 08:17:57,198 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 10 [2020-10-20 08:17:57,199 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 08:17:57,202 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 08:17:57,202 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 08:17:57,202 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2020-10-20 08:17:57,208 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-20 08:17:57,208 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 08:17:57,209 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2020-10-20 08:17:57,209 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287146244] [2020-10-20 08:17:57,292 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:17:57,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-20 08:17:57,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2020-10-20 08:17:57,293 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. cyclomatic complexity: 9 Second operand 15 states. [2020-10-20 08:17:57,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:17:57,568 INFO L93 Difference]: Finished difference Result 47 states and 63 transitions. [2020-10-20 08:17:57,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-20 08:17:57,569 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 63 transitions. [2020-10-20 08:17:57,570 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-10-20 08:17:57,570 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 47 states and 63 transitions. [2020-10-20 08:17:57,571 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2020-10-20 08:17:57,571 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2020-10-20 08:17:57,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 63 transitions. [2020-10-20 08:17:57,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:17:57,571 INFO L691 BuchiCegarLoop]: Abstraction has 47 states and 63 transitions. [2020-10-20 08:17:57,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 63 transitions. [2020-10-20 08:17:57,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 36. [2020-10-20 08:17:57,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-10-20 08:17:57,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2020-10-20 08:17:57,575 INFO L714 BuchiCegarLoop]: Abstraction has 36 states and 48 transitions. [2020-10-20 08:17:57,575 INFO L594 BuchiCegarLoop]: Abstraction has 36 states and 48 transitions. [2020-10-20 08:17:57,575 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-20 08:17:57,575 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 48 transitions. [2020-10-20 08:17:57,576 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 08:17:57,576 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:17:57,576 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:17:57,576 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:17:57,577 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 08:17:57,577 INFO L794 eck$LassoCheckResult]: Stem: 1025#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1023#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; 1024#L527 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1026#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; 1027#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; 1034#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 1035#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; 1028#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 1029#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; 1047#L532-2 main_#t~post10 := main_~k~0;main_~k~0 := 1 + main_#t~post10;havoc main_#t~post10; 1046#L532-3 assume !(main_~k~0 < main_~array_size~0); 1042#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; 1043#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 1038#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); 1039#L517 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5; 1055#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 1056#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); 1058#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); 1032#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 1033#L516-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 1040#L515-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 1041#L515-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 1031#L516-3 [2020-10-20 08:17:57,577 INFO L796 eck$LassoCheckResult]: Loop: 1031#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); 1048#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); 1030#L516-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 1031#L516-3 [2020-10-20 08:17:57,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:57,577 INFO L82 PathProgramCache]: Analyzing trace with hash -137307676, now seen corresponding path program 3 times [2020-10-20 08:17:57,578 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:57,578 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139753403] [2020-10-20 08:17:57,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:57,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:57,594 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:57,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:57,609 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:57,614 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:17:57,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:57,615 INFO L82 PathProgramCache]: Analyzing trace with hash 68618, now seen corresponding path program 7 times [2020-10-20 08:17:57,616 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:57,616 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076750604] [2020-10-20 08:17:57,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:57,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:57,620 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:57,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:57,623 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:57,625 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:17:57,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:17:57,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1724071097, now seen corresponding path program 4 times [2020-10-20 08:17:57,626 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:17:57,626 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179015770] [2020-10-20 08:17:57,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:17:57,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:57,641 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:57,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:17:57,656 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:17:57,662 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:17:58,667 WARN L193 SmtUtils]: Spent 911.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 140 [2020-10-20 08:17:58,861 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-10-20 08:17:58,873 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:17:58,873 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:17:58,873 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:17:58,873 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:17:58,873 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 08:17:58,873 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:17:58,873 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:17:58,873 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:17:58,873 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-2.i_Iteration9_Lasso [2020-10-20 08:17:58,874 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:17:58,874 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:17:58,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:58,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:58,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:58,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:58,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:58,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:17:58,988 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:278) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:612) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:539) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:957) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:865) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:461) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:382) 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:55) [2020-10-20 08:17:58,993 INFO L168 Benchmark]: Toolchain (without parser) took 10129.87 ms. Allocated memory was 40.9 MB in the beginning and 83.4 MB in the end (delta: 42.5 MB). Free memory was 18.8 MB in the beginning and 47.9 MB in the end (delta: -29.1 MB). Peak memory consumption was 58.0 MB. Max. memory is 14.3 GB. [2020-10-20 08:17:58,994 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 31.5 MB. Free memory was 7.2 MB in the beginning and 7.2 MB in the end (delta: 45.7 kB). Peak memory consumption was 45.7 kB. Max. memory is 14.3 GB. [2020-10-20 08:17:58,998 INFO L168 Benchmark]: CACSL2BoogieTranslator took 569.84 ms. Allocated memory was 40.9 MB in the beginning and 44.0 MB in the end (delta: 3.1 MB). Free memory was 17.9 MB in the beginning and 26.2 MB in the end (delta: -8.3 MB). Peak memory consumption was 9.5 MB. Max. memory is 14.3 GB. [2020-10-20 08:17:58,998 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.63 ms. Allocated memory is still 44.0 MB. Free memory was 26.0 MB in the beginning and 24.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 14.3 GB. [2020-10-20 08:17:58,999 INFO L168 Benchmark]: Boogie Preprocessor took 65.98 ms. Allocated memory is still 44.0 MB. Free memory was 24.1 MB in the beginning and 22.6 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 14.3 GB. [2020-10-20 08:17:58,999 INFO L168 Benchmark]: RCFGBuilder took 415.38 ms. Allocated memory is still 44.0 MB. Free memory was 22.3 MB in the beginning and 22.2 MB in the end (delta: 94.1 kB). Peak memory consumption was 13.6 MB. Max. memory is 14.3 GB. [2020-10-20 08:17:59,000 INFO L168 Benchmark]: BuchiAutomizer took 8992.78 ms. Allocated memory was 44.0 MB in the beginning and 83.4 MB in the end (delta: 39.3 MB). Free memory was 22.2 MB in the beginning and 47.9 MB in the end (delta: -25.7 MB). Peak memory consumption was 58.3 MB. Max. memory is 14.3 GB. [2020-10-20 08:17:59,008 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.28 ms. Allocated memory is still 31.5 MB. Free memory was 7.2 MB in the beginning and 7.2 MB in the end (delta: 45.7 kB). Peak memory consumption was 45.7 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 569.84 ms. Allocated memory was 40.9 MB in the beginning and 44.0 MB in the end (delta: 3.1 MB). Free memory was 17.9 MB in the beginning and 26.2 MB in the end (delta: -8.3 MB). Peak memory consumption was 9.5 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 75.63 ms. Allocated memory is still 44.0 MB. Free memory was 26.0 MB in the beginning and 24.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 65.98 ms. Allocated memory is still 44.0 MB. Free memory was 24.1 MB in the beginning and 22.6 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 14.3 GB. * RCFGBuilder took 415.38 ms. Allocated memory is still 44.0 MB. Free memory was 22.3 MB in the beginning and 22.2 MB in the end (delta: 94.1 kB). Peak memory consumption was 13.6 MB. Max. memory is 14.3 GB. * BuchiAutomizer took 8992.78 ms. Allocated memory was 44.0 MB in the beginning and 83.4 MB in the end (delta: 39.3 MB). Free memory was 22.2 MB in the beginning and 47.9 MB in the end (delta: -25.7 MB). Peak memory consumption was 58.3 MB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.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. Received shutdown request...