./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/bubblesort-alloca-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 906a4fb5 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -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/termination-memory-alloca/bubblesort-alloca-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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 64bit --witnessprinter.graph.data.programhash cb74f7a1bb788b2c5a3efb057591b3727e299c90 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-906a4fb [2020-10-19 18:46:15,033 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-19 18:46:15,036 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-19 18:46:15,072 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-19 18:46:15,073 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-19 18:46:15,085 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-19 18:46:15,087 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-19 18:46:15,090 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-19 18:46:15,094 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-19 18:46:15,096 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-19 18:46:15,098 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-19 18:46:15,100 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-19 18:46:15,102 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-19 18:46:15,107 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-19 18:46:15,109 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-19 18:46:15,110 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-19 18:46:15,112 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-19 18:46:15,115 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-19 18:46:15,117 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-19 18:46:15,122 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-19 18:46:15,124 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-19 18:46:15,126 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-19 18:46:15,128 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-19 18:46:15,129 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-19 18:46:15,135 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-19 18:46:15,135 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-19 18:46:15,135 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-19 18:46:15,136 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-19 18:46:15,139 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-19 18:46:15,140 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-19 18:46:15,140 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-19 18:46:15,141 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-19 18:46:15,142 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-19 18:46:15,143 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-19 18:46:15,145 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-19 18:46:15,145 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-19 18:46:15,146 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-19 18:46:15,146 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-19 18:46:15,147 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-19 18:46:15,148 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-19 18:46:15,149 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-19 18:46:15,150 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-10-19 18:46:15,178 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-19 18:46:15,179 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-19 18:46:15,180 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-19 18:46:15,180 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-19 18:46:15,181 INFO L138 SettingsManager]: * Use SBE=true [2020-10-19 18:46:15,181 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-19 18:46:15,181 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-19 18:46:15,182 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-19 18:46:15,182 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-19 18:46:15,182 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-19 18:46:15,182 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-19 18:46:15,183 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-19 18:46:15,183 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-19 18:46:15,183 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-19 18:46:15,184 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-19 18:46:15,184 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-19 18:46:15,184 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-19 18:46:15,184 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-19 18:46:15,185 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-19 18:46:15,185 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-19 18:46:15,185 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-19 18:46:15,186 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-19 18:46:15,186 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-19 18:46:15,186 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-19 18:46:15,187 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-19 18:46:15,187 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-19 18:46:15,187 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-19 18:46:15,187 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-19 18:46:15,188 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-19 18:46:15,189 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-19 18:46:15,189 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cb74f7a1bb788b2c5a3efb057591b3727e299c90 [2020-10-19 18:46:15,539 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-19 18:46:15,560 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-19 18:46:15,566 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-19 18:46:15,568 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-19 18:46:15,570 INFO L275 PluginConnector]: CDTParser initialized [2020-10-19 18:46:15,571 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/bubblesort-alloca-1.i [2020-10-19 18:46:15,635 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e76f80b4/b445f5a5ab114d8082b058a18003ba36/FLAG21e3f57a8 [2020-10-19 18:46:16,171 INFO L306 CDTParser]: Found 1 translation units. [2020-10-19 18:46:16,172 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/bubblesort-alloca-1.i [2020-10-19 18:46:16,188 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e76f80b4/b445f5a5ab114d8082b058a18003ba36/FLAG21e3f57a8 [2020-10-19 18:46:16,481 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e76f80b4/b445f5a5ab114d8082b058a18003ba36 [2020-10-19 18:46:16,484 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-19 18:46:16,492 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-19 18:46:16,493 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-19 18:46:16,493 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-19 18:46:16,497 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-19 18:46:16,498 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 06:46:16" (1/1) ... [2020-10-19 18:46:16,501 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d60bba0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:46:16, skipping insertion in model container [2020-10-19 18:46:16,501 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 06:46:16" (1/1) ... [2020-10-19 18:46:16,509 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-19 18:46:16,548 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-19 18:46:16,919 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 18:46:16,929 INFO L203 MainTranslator]: Completed pre-run [2020-10-19 18:46:16,965 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 18:46:17,018 INFO L208 MainTranslator]: Completed translation [2020-10-19 18:46:17,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:46:17 WrapperNode [2020-10-19 18:46:17,019 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-19 18:46:17,019 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-19 18:46:17,020 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-19 18:46:17,020 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-19 18:46:17,028 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:46:17" (1/1) ... [2020-10-19 18:46:17,043 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:46:17" (1/1) ... [2020-10-19 18:46:17,065 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-19 18:46:17,066 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-19 18:46:17,066 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-19 18:46:17,066 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-19 18:46:17,076 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:46:17" (1/1) ... [2020-10-19 18:46:17,076 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:46:17" (1/1) ... [2020-10-19 18:46:17,080 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:46:17" (1/1) ... [2020-10-19 18:46:17,080 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:46:17" (1/1) ... [2020-10-19 18:46:17,087 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:46:17" (1/1) ... [2020-10-19 18:46:17,092 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:46:17" (1/1) ... [2020-10-19 18:46:17,094 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:46:17" (1/1) ... [2020-10-19 18:46:17,096 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-19 18:46:17,097 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-19 18:46:17,097 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-19 18:46:17,097 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-19 18:46:17,098 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:46:17" (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-19 18:46:17,167 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-19 18:46:17,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-19 18:46:17,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-19 18:46:17,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-19 18:46:17,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-19 18:46:17,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-19 18:46:17,485 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-19 18:46:17,485 INFO L298 CfgBuilder]: Removed 8 assume(true) statements. [2020-10-19 18:46:17,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 06:46:17 BoogieIcfgContainer [2020-10-19 18:46:17,487 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-19 18:46:17,488 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-19 18:46:17,488 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-19 18:46:17,492 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-19 18:46:17,493 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 18:46:17,493 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.10 06:46:16" (1/3) ... [2020-10-19 18:46:17,494 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@12f3c691 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.10 06:46:17, skipping insertion in model container [2020-10-19 18:46:17,495 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 18:46:17,495 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:46:17" (2/3) ... [2020-10-19 18:46:17,495 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@12f3c691 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.10 06:46:17, skipping insertion in model container [2020-10-19 18:46:17,495 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 18:46:17,495 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 06:46:17" (3/3) ... [2020-10-19 18:46:17,497 INFO L373 chiAutomizerObserver]: Analyzing ICFG bubblesort-alloca-1.i [2020-10-19 18:46:17,547 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-19 18:46:17,547 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-19 18:46:17,548 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-19 18:46:17,548 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-19 18:46:17,550 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-19 18:46:17,550 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-19 18:46:17,550 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-19 18:46:17,550 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-19 18:46:17,570 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2020-10-19 18:46:17,589 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-19 18:46:17,590 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:46:17,590 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:46:17,596 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-19 18:46:17,596 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 18:46:17,596 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-19 18:46:17,597 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2020-10-19 18:46:17,598 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-19 18:46:17,598 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:46:17,599 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:46:17,599 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-19 18:46:17,599 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 18:46:17,608 INFO L794 eck$LassoCheckResult]: Stem: 9#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 8#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 11#L562true assume !(main_~array_size~0 < 1); 13#L562-2true call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset, bubbleSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc bubbleSort_#t~mem4, bubbleSort_#t~mem5, bubbleSort_#t~mem6, bubbleSort_#t~mem7, bubbleSort_#t~post3, bubbleSort_#t~post2, bubbleSort_~numbers.base, bubbleSort_~numbers.offset, bubbleSort_~array_size, bubbleSort_~i~0, bubbleSort_~j~0, bubbleSort_~temp~0;bubbleSort_~numbers.base, bubbleSort_~numbers.offset := bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset;bubbleSort_~array_size := bubbleSort_#in~array_size;havoc bubbleSort_~i~0;havoc bubbleSort_~j~0;havoc bubbleSort_~temp~0;bubbleSort_~i~0 := bubbleSort_~array_size - 1; 5#L550-3true [2020-10-19 18:46:17,608 INFO L796 eck$LassoCheckResult]: Loop: 5#L550-3true assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 3#L551-3true assume !true; 4#L550-2true bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 5#L550-3true [2020-10-19 18:46:17,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:46:17,616 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2020-10-19 18:46:17,626 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:46:17,627 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67007681] [2020-10-19 18:46:17,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:46:17,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:46:17,737 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:46:17,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:46:17,771 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:46:17,793 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:46:17,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:46:17,795 INFO L82 PathProgramCache]: Analyzing trace with hash 47218, now seen corresponding path program 1 times [2020-10-19 18:46:17,795 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:46:17,795 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638300666] [2020-10-19 18:46:17,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:46:17,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:46:17,830 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-19 18:46:17,830 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638300666] [2020-10-19 18:46:17,831 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 18:46:17,831 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-19 18:46:17,832 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054669835] [2020-10-19 18:46:17,838 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 18:46:17,839 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:46:17,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-19 18:46:17,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-19 18:46:17,859 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 2 states. [2020-10-19 18:46:17,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:46:17,866 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2020-10-19 18:46:17,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-19 18:46:17,869 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2020-10-19 18:46:17,870 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-19 18:46:17,874 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 9 states and 12 transitions. [2020-10-19 18:46:17,876 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-10-19 18:46:17,876 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-10-19 18:46:17,877 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 12 transitions. [2020-10-19 18:46:17,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 18:46:17,878 INFO L691 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2020-10-19 18:46:17,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 12 transitions. [2020-10-19 18:46:17,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2020-10-19 18:46:17,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-19 18:46:17,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2020-10-19 18:46:17,904 INFO L714 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2020-10-19 18:46:17,904 INFO L594 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2020-10-19 18:46:17,904 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-19 18:46:17,905 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 12 transitions. [2020-10-19 18:46:17,905 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-19 18:46:17,905 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:46:17,905 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:46:17,906 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-19 18:46:17,906 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 18:46:17,906 INFO L794 eck$LassoCheckResult]: Stem: 40#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 34#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 35#L562 assume !(main_~array_size~0 < 1); 42#L562-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset, bubbleSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc bubbleSort_#t~mem4, bubbleSort_#t~mem5, bubbleSort_#t~mem6, bubbleSort_#t~mem7, bubbleSort_#t~post3, bubbleSort_#t~post2, bubbleSort_~numbers.base, bubbleSort_~numbers.offset, bubbleSort_~array_size, bubbleSort_~i~0, bubbleSort_~j~0, bubbleSort_~temp~0;bubbleSort_~numbers.base, bubbleSort_~numbers.offset := bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset;bubbleSort_~array_size := bubbleSort_#in~array_size;havoc bubbleSort_~i~0;havoc bubbleSort_~j~0;havoc bubbleSort_~temp~0;bubbleSort_~i~0 := bubbleSort_~array_size - 1; 39#L550-3 [2020-10-19 18:46:17,906 INFO L796 eck$LassoCheckResult]: Loop: 39#L550-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 36#L551-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 37#L550-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 39#L550-3 [2020-10-19 18:46:17,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:46:17,907 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2020-10-19 18:46:17,907 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:46:17,907 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084296711] [2020-10-19 18:46:17,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:46:17,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:46:17,928 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:46:17,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:46:17,938 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:46:17,942 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:46:17,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:46:17,943 INFO L82 PathProgramCache]: Analyzing trace with hash 46877, now seen corresponding path program 1 times [2020-10-19 18:46:17,943 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:46:17,944 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264835984] [2020-10-19 18:46:17,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:46:17,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:46:17,950 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:46:17,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:46:17,953 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:46:17,955 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:46:17,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:46:17,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818489, now seen corresponding path program 1 times [2020-10-19 18:46:17,956 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:46:17,956 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435753938] [2020-10-19 18:46:17,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:46:17,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:46:17,970 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:46:17,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:46:17,982 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:46:17,987 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:46:18,043 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 18:46:18,044 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 18:46:18,044 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 18:46:18,044 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 18:46:18,044 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-19 18:46:18,045 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:46:18,045 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 18:46:18,045 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 18:46:18,045 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-1.i_Iteration2_Loop [2020-10-19 18:46:18,045 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 18:46:18,046 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 18:46:18,067 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-19 18:46:18,076 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-19 18:46:18,084 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-19 18:46:18,089 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-19 18:46:18,105 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-19 18:46:18,209 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 18:46:18,210 INFO L404 LassoAnalysis]: Checking for nontermination... 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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:46:18,216 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-19 18:46:18,216 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-19 18:46:18,228 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-19 18:46:18,228 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:46:18,275 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-19 18:46:18,275 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-19 18:46:18,280 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-19 18:46:18,280 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~P_PID_1=1} Honda state: {v_rep~unnamed0~0~P_PID_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /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-19 18:46:18,320 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-19 18:46:18,320 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:46:18,326 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-19 18:46:18,328 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~P_PGID_1=2} Honda state: {v_rep~unnamed0~0~P_PGID_1=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /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-19 18:46:18,352 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-19 18:46:18,352 INFO L160 nArgumentSynthesizer]: Using integer mode. 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) [2020-10-19 18:46:18,402 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-19 18:46:18,402 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:46:18,448 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-19 18:46:18,450 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 18:46:18,450 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 18:46:18,450 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 18:46:18,450 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 18:46:18,450 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 18:46:18,450 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:46:18,451 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 18:46:18,451 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 18:46:18,451 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-1.i_Iteration2_Loop [2020-10-19 18:46:18,451 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 18:46:18,451 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 18:46:18,454 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-19 18:46:18,458 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-19 18:46:18,471 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-19 18:46:18,476 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-19 18:46:18,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-19 18:46:18,573 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 18:46:18,579 INFO L489 LassoAnalysis]: Using template 'affine'. 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) [2020-10-19 18:46:18,585 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:46:18,587 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:46:18,588 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:46:18,589 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:46:18,589 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:46:18,589 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:46:18,592 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:46:18,592 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:46:18,596 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-19 18:46:18,624 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-19 18:46:18,626 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:46:18,626 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:46:18,627 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:46:18,627 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:46:18,627 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:46:18,629 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:46:18,629 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:46:18,633 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 18:46:18,639 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-19 18:46:18,640 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 9 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:46:18,658 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-19 18:46:18,658 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-19 18:46:18,658 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 18:46:18,659 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_bubbleSort_~i~0) = 2*ULTIMATE.start_bubbleSort_~i~0 + 1 Supporting invariants [] [2020-10-19 18:46:18,696 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-19 18:46:18,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:46:18,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:46:18,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 18:46:18,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:46:18,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:46:18,763 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-19 18:46:18,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:46:18,778 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-19 18:46:18,782 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-19 18:46:18,783 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 12 transitions. cyclomatic complexity: 4 Second operand 3 states. [2020-10-19 18:46:18,836 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 12 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 15 states and 22 transitions. Complement of second has 4 states. [2020-10-19 18:46:18,837 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-19 18:46:18,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-19 18:46:18,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2020-10-19 18:46:18,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 4 letters. Loop has 3 letters. [2020-10-19 18:46:18,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:46:18,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 7 letters. Loop has 3 letters. [2020-10-19 18:46:18,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:46:18,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 4 letters. Loop has 6 letters. [2020-10-19 18:46:18,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:46:18,844 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 22 transitions. [2020-10-19 18:46:18,845 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 18:46:18,846 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 14 states and 20 transitions. [2020-10-19 18:46:18,846 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2020-10-19 18:46:18,847 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-10-19 18:46:18,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 20 transitions. [2020-10-19 18:46:18,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 18:46:18,848 INFO L691 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2020-10-19 18:46:18,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 20 transitions. [2020-10-19 18:46:18,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2020-10-19 18:46:18,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-19 18:46:18,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2020-10-19 18:46:18,851 INFO L714 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2020-10-19 18:46:18,851 INFO L594 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2020-10-19 18:46:18,851 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-19 18:46:18,851 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 19 transitions. [2020-10-19 18:46:18,852 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 18:46:18,853 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:46:18,853 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:46:18,853 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-19 18:46:18,853 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 18:46:18,854 INFO L794 eck$LassoCheckResult]: Stem: 107#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 104#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 105#L562 assume !(main_~array_size~0 < 1); 111#L562-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset, bubbleSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc bubbleSort_#t~mem4, bubbleSort_#t~mem5, bubbleSort_#t~mem6, bubbleSort_#t~mem7, bubbleSort_#t~post3, bubbleSort_#t~post2, bubbleSort_~numbers.base, bubbleSort_~numbers.offset, bubbleSort_~array_size, bubbleSort_~i~0, bubbleSort_~j~0, bubbleSort_~temp~0;bubbleSort_~numbers.base, bubbleSort_~numbers.offset := bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset;bubbleSort_~array_size := bubbleSort_#in~array_size;havoc bubbleSort_~i~0;havoc bubbleSort_~j~0;havoc bubbleSort_~temp~0;bubbleSort_~i~0 := bubbleSort_~array_size - 1; 108#L550-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 99#L551-3 [2020-10-19 18:46:18,854 INFO L796 eck$LassoCheckResult]: Loop: 99#L551-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 100#L552 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 109#L551-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 99#L551-3 [2020-10-19 18:46:18,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:46:18,855 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2020-10-19 18:46:18,855 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:46:18,855 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145729213] [2020-10-19 18:46:18,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:46:18,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:46:18,868 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:46:18,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:46:18,878 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:46:18,882 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:46:18,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:46:18,883 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 1 times [2020-10-19 18:46:18,883 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:46:18,884 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401067637] [2020-10-19 18:46:18,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:46:18,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:46:18,903 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:46:18,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:46:18,922 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:46:18,927 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:46:18,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:46:18,931 INFO L82 PathProgramCache]: Analyzing trace with hash 176800017, now seen corresponding path program 1 times [2020-10-19 18:46:18,931 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:46:18,932 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006721850] [2020-10-19 18:46:18,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:46:18,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:46:18,971 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:46:18,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:46:19,000 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:46:19,006 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:46:19,263 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2020-10-19 18:46:19,328 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 18:46:19,328 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 18:46:19,328 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 18:46:19,328 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 18:46:19,328 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 18:46:19,328 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:46:19,329 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 18:46:19,329 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 18:46:19,329 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-1.i_Iteration3_Lasso [2020-10-19 18:46:19,329 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 18:46:19,330 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 18:46:19,336 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-19 18:46:19,340 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-19 18:46:19,344 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-19 18:46:19,348 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-19 18:46:19,352 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-19 18:46:19,356 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-19 18:46:19,360 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-19 18:46:19,364 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-19 18:46:19,368 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-19 18:46:19,371 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-19 18:46:19,517 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2020-10-19 18:46:19,581 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-19 18:46:19,585 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-19 18:46:19,588 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-19 18:46:19,591 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-19 18:46:19,923 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 18:46:19,924 INFO L489 LassoAnalysis]: Using template 'affine'. 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) [2020-10-19 18:46:19,936 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-19 18:46:19,938 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:46:19,939 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:46:19,939 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:46:19,939 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:46:19,939 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:46:19,940 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:46:19,941 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:46:19,943 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) [2020-10-19 18:46:19,997 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-19 18:46:20,000 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:46:20,000 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:46:20,001 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:46:20,001 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:46:20,001 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:46:20,003 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:46:20,003 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:46:20,005 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) [2020-10-19 18:46:20,055 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-19 18:46:20,057 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:46:20,057 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:46:20,057 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:46:20,057 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:46:20,058 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:46:20,059 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:46:20,060 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:46:20,083 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 12 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:46:20,157 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-19 18:46:20,159 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:46:20,159 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:46:20,159 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:46:20,159 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:46:20,167 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:46:20,167 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:46:20,172 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-19 18:46:20,220 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-19 18:46:20,221 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:46:20,222 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:46:20,222 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:46:20,222 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:46:20,222 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:46:20,224 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:46:20,225 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:46:20,226 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 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:46:20,260 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-19 18:46:20,261 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:46:20,261 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:46:20,262 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:46:20,262 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:46:20,265 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:46:20,265 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:46:20,269 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:46:20,313 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-19 18:46:20,315 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:46:20,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:46:20,315 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:46:20,315 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:46:20,317 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:46:20,318 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:46:20,322 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 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-19 18:46:20,361 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-19 18:46:20,363 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:46:20,364 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:46:20,364 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:46:20,364 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:46:20,364 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:46:20,365 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:46:20,365 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:46:20,367 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 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:46:20,403 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-19 18:46:20,405 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:46:20,405 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:46:20,405 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:46:20,405 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:46:20,405 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:46:20,406 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:46:20,406 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:46:20,408 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 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:46:20,449 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-19 18:46:20,451 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:46:20,451 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:46:20,451 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:46:20,451 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:46:20,458 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:46:20,458 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:46:20,467 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 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-19 18:46:20,505 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-19 18:46:20,509 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:46:20,509 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:46:20,509 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:46:20,509 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:46:20,526 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:46:20,527 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:46:20,547 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 18:46:20,615 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2020-10-19 18:46:20,615 INFO L444 ModelExtractionUtils]: 11 out of 37 variables were initially zero. Simplification set additionally 21 variables to zero. 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-19 18:46:20,619 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:46:20,622 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-10-19 18:46:20,623 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 18:46:20,623 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_bubbleSort_~j~0, v_rep(select #length ULTIMATE.start_bubbleSort_~numbers.base)_1) = -16*ULTIMATE.start_bubbleSort_~j~0 + 9*v_rep(select #length ULTIMATE.start_bubbleSort_~numbers.base)_1 Supporting invariants [1*v_rep(select #length ULTIMATE.start_main_#t~malloc9.base)_1 - 2*ULTIMATE.start_bubbleSort_~i~0 >= 0] [2020-10-19 18:46:20,677 INFO L297 tatePredicateManager]: 3 out of 5 supporting invariants were superfluous and have been removed [2020-10-19 18:46:20,684 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-19 18:46:20,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:46:20,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:46:20,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 13 conjunts are in the unsatisfiable core [2020-10-19 18:46:20,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:46:20,821 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2020-10-19 18:46:20,822 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 18:46:20,834 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 18:46:20,842 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-19 18:46:20,843 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:28 [2020-10-19 18:46:20,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:46:20,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-19 18:46:20,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:46:20,914 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-19 18:46:20,914 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2020-10-19 18:46:20,914 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 19 transitions. cyclomatic complexity: 8 Second operand 5 states. [2020-10-19 18:46:21,016 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 19 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 28 states and 41 transitions. Complement of second has 9 states. [2020-10-19 18:46:21,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-19 18:46:21,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-19 18:46:21,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2020-10-19 18:46:21,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 5 letters. Loop has 3 letters. [2020-10-19 18:46:21,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:46:21,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 8 letters. Loop has 3 letters. [2020-10-19 18:46:21,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:46:21,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 5 letters. Loop has 6 letters. [2020-10-19 18:46:21,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:46:21,019 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 41 transitions. [2020-10-19 18:46:21,021 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 18:46:21,022 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 18 states and 26 transitions. [2020-10-19 18:46:21,022 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2020-10-19 18:46:21,023 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2020-10-19 18:46:21,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 26 transitions. [2020-10-19 18:46:21,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 18:46:21,023 INFO L691 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2020-10-19 18:46:21,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 26 transitions. [2020-10-19 18:46:21,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 13. [2020-10-19 18:46:21,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-19 18:46:21,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2020-10-19 18:46:21,026 INFO L714 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2020-10-19 18:46:21,026 INFO L594 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2020-10-19 18:46:21,026 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-19 18:46:21,026 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2020-10-19 18:46:21,027 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 18:46:21,027 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:46:21,027 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:46:21,027 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2020-10-19 18:46:21,028 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 18:46:21,028 INFO L794 eck$LassoCheckResult]: Stem: 228#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 222#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 223#L562 assume !(main_~array_size~0 < 1); 232#L562-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset, bubbleSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc bubbleSort_#t~mem4, bubbleSort_#t~mem5, bubbleSort_#t~mem6, bubbleSort_#t~mem7, bubbleSort_#t~post3, bubbleSort_#t~post2, bubbleSort_~numbers.base, bubbleSort_~numbers.offset, bubbleSort_~array_size, bubbleSort_~i~0, bubbleSort_~j~0, bubbleSort_~temp~0;bubbleSort_~numbers.base, bubbleSort_~numbers.offset := bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset;bubbleSort_~array_size := bubbleSort_#in~array_size;havoc bubbleSort_~i~0;havoc bubbleSort_~j~0;havoc bubbleSort_~temp~0;bubbleSort_~i~0 := bubbleSort_~array_size - 1; 229#L550-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 226#L551-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 220#L550-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 221#L550-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 224#L551-3 [2020-10-19 18:46:21,028 INFO L796 eck$LassoCheckResult]: Loop: 224#L551-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 225#L552 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 230#L551-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 224#L551-3 [2020-10-19 18:46:21,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:46:21,028 INFO L82 PathProgramCache]: Analyzing trace with hash 176798328, now seen corresponding path program 2 times [2020-10-19 18:46:21,029 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:46:21,029 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546704324] [2020-10-19 18:46:21,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:46:21,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:46:21,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:46:21,102 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546704324] [2020-10-19 18:46:21,102 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 18:46:21,102 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-19 18:46:21,103 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733942046] [2020-10-19 18:46:21,103 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 18:46:21,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:46:21,103 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 2 times [2020-10-19 18:46:21,104 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:46:21,104 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96773777] [2020-10-19 18:46:21,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:46:21,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:46:21,124 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:46:21,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:46:21,138 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:46:21,143 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:46:21,244 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:46:21,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-19 18:46:21,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-19 18:46:21,245 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand 5 states. [2020-10-19 18:46:21,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:46:21,302 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions. [2020-10-19 18:46:21,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-19 18:46:21,303 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2020-10-19 18:46:21,304 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 18:46:21,304 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 19 states and 26 transitions. [2020-10-19 18:46:21,304 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-10-19 18:46:21,305 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-10-19 18:46:21,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 26 transitions. [2020-10-19 18:46:21,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 18:46:21,309 INFO L691 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2020-10-19 18:46:21,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 26 transitions. [2020-10-19 18:46:21,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 14. [2020-10-19 18:46:21,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-19 18:46:21,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2020-10-19 18:46:21,313 INFO L714 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2020-10-19 18:46:21,314 INFO L594 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2020-10-19 18:46:21,314 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-19 18:46:21,314 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2020-10-19 18:46:21,314 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 18:46:21,314 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:46:21,315 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:46:21,315 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:46:21,315 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 18:46:21,316 INFO L794 eck$LassoCheckResult]: Stem: 275#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 272#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 273#L562 assume !(main_~array_size~0 < 1); 278#L562-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset, bubbleSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc bubbleSort_#t~mem4, bubbleSort_#t~mem5, bubbleSort_#t~mem6, bubbleSort_#t~mem7, bubbleSort_#t~post3, bubbleSort_#t~post2, bubbleSort_~numbers.base, bubbleSort_~numbers.offset, bubbleSort_~array_size, bubbleSort_~i~0, bubbleSort_~j~0, bubbleSort_~temp~0;bubbleSort_~numbers.base, bubbleSort_~numbers.offset := bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset;bubbleSort_~array_size := bubbleSort_#in~array_size;havoc bubbleSort_~i~0;havoc bubbleSort_~j~0;havoc bubbleSort_~temp~0;bubbleSort_~i~0 := bubbleSort_~array_size - 1; 274#L550-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 270#L551-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 271#L552 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5; 277#L551-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 279#L551-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 266#L550-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 267#L550-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 268#L551-3 [2020-10-19 18:46:21,316 INFO L796 eck$LassoCheckResult]: Loop: 268#L551-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 269#L552 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 276#L551-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 268#L551-3 [2020-10-19 18:46:21,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:46:21,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1421271829, now seen corresponding path program 1 times [2020-10-19 18:46:21,318 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:46:21,318 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003862713] [2020-10-19 18:46:21,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:46:21,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:46:21,343 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:46:21,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:46:21,356 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:46:21,360 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:46:21,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:46:21,361 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 3 times [2020-10-19 18:46:21,361 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:46:21,361 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446967735] [2020-10-19 18:46:21,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:46:21,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:46:21,367 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:46:21,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:46:21,372 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:46:21,374 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:46:21,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:46:21,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1321478696, now seen corresponding path program 1 times [2020-10-19 18:46:21,375 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:46:21,375 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453654703] [2020-10-19 18:46:21,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:46:21,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:46:21,424 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:46:21,425 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453654703] [2020-10-19 18:46:21,425 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [633568480] [2020-10-19 18:46:21,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 18:46:21,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:46:21,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-19 18:46:21,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:46:21,520 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:46:21,521 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 18:46:21,521 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-19 18:46:21,521 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469874481] [2020-10-19 18:46:21,609 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:46:21,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-19 18:46:21,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-10-19 18:46:21,610 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand 9 states. [2020-10-19 18:46:21,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:46:21,664 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2020-10-19 18:46:21,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-19 18:46:21,665 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 38 transitions. [2020-10-19 18:46:21,666 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 18:46:21,667 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 25 states and 34 transitions. [2020-10-19 18:46:21,667 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-10-19 18:46:21,667 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-10-19 18:46:21,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 34 transitions. [2020-10-19 18:46:21,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 18:46:21,668 INFO L691 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2020-10-19 18:46:21,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 34 transitions. [2020-10-19 18:46:21,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2020-10-19 18:46:21,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-10-19 18:46:21,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2020-10-19 18:46:21,670 INFO L714 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2020-10-19 18:46:21,671 INFO L594 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2020-10-19 18:46:21,671 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-19 18:46:21,671 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2020-10-19 18:46:21,671 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 18:46:21,672 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:46:21,672 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:46:21,672 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2020-10-19 18:46:21,672 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 18:46:21,673 INFO L794 eck$LassoCheckResult]: Stem: 374#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 366#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 367#L562 assume !(main_~array_size~0 < 1); 380#L562-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset, bubbleSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc bubbleSort_#t~mem4, bubbleSort_#t~mem5, bubbleSort_#t~mem6, bubbleSort_#t~mem7, bubbleSort_#t~post3, bubbleSort_#t~post2, bubbleSort_~numbers.base, bubbleSort_~numbers.offset, bubbleSort_~array_size, bubbleSort_~i~0, bubbleSort_~j~0, bubbleSort_~temp~0;bubbleSort_~numbers.base, bubbleSort_~numbers.offset := bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset;bubbleSort_~array_size := bubbleSort_#in~array_size;havoc bubbleSort_~i~0;havoc bubbleSort_~j~0;havoc bubbleSort_~temp~0;bubbleSort_~i~0 := bubbleSort_~array_size - 1; 375#L550-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 376#L551-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 378#L552 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5; 379#L551-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 370#L551-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 371#L552 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5; 382#L551-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 381#L551-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 372#L550-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 373#L550-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 368#L551-3 [2020-10-19 18:46:21,673 INFO L796 eck$LassoCheckResult]: Loop: 368#L551-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 369#L552 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 377#L551-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 368#L551-3 [2020-10-19 18:46:21,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:46:21,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1373641048, now seen corresponding path program 2 times [2020-10-19 18:46:21,674 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:46:21,674 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459975878] [2020-10-19 18:46:21,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:46:21,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:46:21,689 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:46:21,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:46:21,701 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:46:21,705 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:46:21,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:46:21,706 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 4 times [2020-10-19 18:46:21,706 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:46:21,706 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585610703] [2020-10-19 18:46:21,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:46:21,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:46:21,712 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:46:21,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:46:21,715 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:46:21,717 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:46:21,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:46:21,718 INFO L82 PathProgramCache]: Analyzing trace with hash -307910395, now seen corresponding path program 2 times [2020-10-19 18:46:21,718 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:46:21,719 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607399842] [2020-10-19 18:46:21,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:46:21,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:46:21,927 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:46:21,928 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607399842] [2020-10-19 18:46:21,928 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259033129] [2020-10-19 18:46:21,928 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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 18:46:21,981 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-19 18:46:21,981 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-19 18:46:21,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-19 18:46:21,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:46:22,047 INFO L350 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2020-10-19 18:46:22,048 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-19 18:46:22,049 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 18:46:22,051 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 18:46:22,052 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-19 18:46:22,052 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2020-10-19 18:46:22,058 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-19 18:46:22,058 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 18:46:22,059 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 13 [2020-10-19 18:46:22,059 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597663382] [2020-10-19 18:46:22,151 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:46:22,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-19 18:46:22,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2020-10-19 18:46:22,152 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. cyclomatic complexity: 8 Second operand 13 states. [2020-10-19 18:46:22,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:46:22,256 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2020-10-19 18:46:22,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-19 18:46:22,257 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 50 transitions. [2020-10-19 18:46:22,258 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-10-19 18:46:22,261 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 50 transitions. [2020-10-19 18:46:22,261 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2020-10-19 18:46:22,262 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2020-10-19 18:46:22,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 50 transitions. [2020-10-19 18:46:22,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 18:46:22,262 INFO L691 BuchiCegarLoop]: Abstraction has 37 states and 50 transitions. [2020-10-19 18:46:22,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 50 transitions. [2020-10-19 18:46:22,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2020-10-19 18:46:22,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-10-19 18:46:22,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2020-10-19 18:46:22,267 INFO L714 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2020-10-19 18:46:22,267 INFO L594 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2020-10-19 18:46:22,267 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-19 18:46:22,268 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 35 transitions. [2020-10-19 18:46:22,268 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 18:46:22,269 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:46:22,269 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:46:22,269 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:46:22,270 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 18:46:22,270 INFO L794 eck$LassoCheckResult]: Stem: 496#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 488#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 489#L562 assume !(main_~array_size~0 < 1); 504#L562-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset, bubbleSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc bubbleSort_#t~mem4, bubbleSort_#t~mem5, bubbleSort_#t~mem6, bubbleSort_#t~mem7, bubbleSort_#t~post3, bubbleSort_#t~post2, bubbleSort_~numbers.base, bubbleSort_~numbers.offset, bubbleSort_~array_size, bubbleSort_~i~0, bubbleSort_~j~0, bubbleSort_~temp~0;bubbleSort_~numbers.base, bubbleSort_~numbers.offset := bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset;bubbleSort_~array_size := bubbleSort_#in~array_size;havoc bubbleSort_~i~0;havoc bubbleSort_~j~0;havoc bubbleSort_~temp~0;bubbleSort_~i~0 := bubbleSort_~array_size - 1; 497#L550-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 498#L551-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 510#L552 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5; 506#L551-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 492#L551-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 493#L552 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 502#L551-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 509#L551-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 494#L550-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 495#L550-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 505#L551-3 [2020-10-19 18:46:22,270 INFO L796 eck$LassoCheckResult]: Loop: 505#L551-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 513#L552 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 501#L551-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 505#L551-3 [2020-10-19 18:46:22,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:46:22,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1371794006, now seen corresponding path program 3 times [2020-10-19 18:46:22,271 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:46:22,271 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391775820] [2020-10-19 18:46:22,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:46:22,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:46:22,285 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:46:22,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:46:22,295 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:46:22,299 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:46:22,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:46:22,300 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 5 times [2020-10-19 18:46:22,300 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:46:22,300 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786216250] [2020-10-19 18:46:22,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:46:22,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:46:22,305 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:46:22,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:46:22,308 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:46:22,310 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:46:22,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:46:22,311 INFO L82 PathProgramCache]: Analyzing trace with hash 501436231, now seen corresponding path program 4 times [2020-10-19 18:46:22,311 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:46:22,311 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832372823] [2020-10-19 18:46:22,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:46:22,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:46:22,328 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:46:22,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:46:22,341 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:46:22,345 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:46:22,842 WARN L193 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 101 [2020-10-19 18:46:22,946 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 18:46:22,946 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 18:46:22,946 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 18:46:22,946 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 18:46:22,946 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 18:46:22,947 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:46:22,947 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 18:46:22,947 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 18:46:22,947 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-1.i_Iteration7_Lasso [2020-10-19 18:46:22,947 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 18:46:22,947 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 18:46:22,951 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-19 18:46:22,954 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-19 18:46:22,960 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-19 18:46:22,962 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-19 18:46:22,965 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-19 18:46:22,968 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-19 18:46:23,203 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2020-10-19 18:46:23,390 WARN L193 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2020-10-19 18:46:23,391 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-19 18:46:23,396 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-19 18:46:23,398 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-19 18:46:23,401 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-19 18:46:23,403 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-19 18:46:23,408 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-19 18:46:23,412 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-19 18:46:23,415 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-19 18:46:23,770 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 18:46:23,770 INFO L489 LassoAnalysis]: Using template 'affine'. 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-19 18:46:23,778 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-19 18:46:23,779 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:46:23,780 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:46:23,780 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:46:23,780 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:46:23,780 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:46:23,781 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:46:23,781 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:46:23,782 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:46:23,817 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-19 18:46:23,818 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:46:23,819 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:46:23,819 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:46:23,819 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:46:23,821 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:46:23,821 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:46:23,825 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:46:23,859 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-19 18:46:23,861 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:46:23,861 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:46:23,861 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:46:23,862 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:46:23,862 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:46:23,862 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:46:23,863 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:46:23,864 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-19 18:46:23,899 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-19 18:46:23,901 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:46:23,901 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:46:23,901 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:46:23,901 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:46:23,903 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:46:23,903 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-19 18:46:23,907 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-19 18:46:23,935 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-19 18:46:23,936 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:46:23,936 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:46:23,937 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:46:23,937 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:46:23,937 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:46:23,937 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:46:23,938 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:46:23,939 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-19 18:46:23,962 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-19 18:46:23,964 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:46:23,964 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:46:23,965 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:46:23,965 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:46:23,972 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:46:23,972 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:46:23,989 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 18:46:24,045 INFO L443 ModelExtractionUtils]: Simplification made 21 calls to the SMT solver. [2020-10-19 18:46:24,045 INFO L444 ModelExtractionUtils]: 18 out of 37 variables were initially zero. Simplification set additionally 14 variables to zero. 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-19 18:46:24,047 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-19 18:46:24,049 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-10-19 18:46:24,049 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 18:46:24,049 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_bubbleSort_~j~0) = -2*ULTIMATE.start_bubbleSort_~j~0 + 3 Supporting invariants [-1*ULTIMATE.start_bubbleSort_~i~0 + 1 >= 0] [2020-10-19 18:46:24,094 INFO L297 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2020-10-19 18:46:24,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:46:24,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:46:24,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-19 18:46:24,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:46:24,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:46:24,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-19 18:46:24,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:46:24,251 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-19 18:46:24,252 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 2 loop predicates [2020-10-19 18:46:24,252 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11 Second operand 8 states. [2020-10-19 18:46:24,281 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11. Second operand 8 states. Result 27 states and 36 transitions. Complement of second has 3 states. [2020-10-19 18:46:24,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2020-10-19 18:46:24,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-19 18:46:24,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 6 transitions. [2020-10-19 18:46:24,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 6 transitions. Stem has 14 letters. Loop has 3 letters. [2020-10-19 18:46:24,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:46:24,283 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-19 18:46:24,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:46:24,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:46:24,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-19 18:46:24,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:46:24,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:46:24,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-19 18:46:24,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:46:24,427 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-19 18:46:24,428 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.6 stem predicates 2 loop predicates [2020-10-19 18:46:24,428 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11 Second operand 8 states. [2020-10-19 18:46:24,451 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11. Second operand 8 states. Result 27 states and 36 transitions. Complement of second has 3 states. [2020-10-19 18:46:24,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2020-10-19 18:46:24,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-19 18:46:24,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 6 transitions. [2020-10-19 18:46:24,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 6 transitions. Stem has 14 letters. Loop has 3 letters. [2020-10-19 18:46:24,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:46:24,453 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-19 18:46:24,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:46:24,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:46:24,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-19 18:46:24,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:46:24,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:46:24,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-19 18:46:24,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:46:24,582 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-19 18:46:24,583 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.6 stem predicates 2 loop predicates [2020-10-19 18:46:24,583 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11 Second operand 8 states. [2020-10-19 18:46:24,837 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11. Second operand 8 states. Result 84 states and 119 transitions. Complement of second has 13 states. [2020-10-19 18:46:24,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 8 stem states 2 non-accepting loop states 2 accepting loop states [2020-10-19 18:46:24,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-19 18:46:24,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 44 transitions. [2020-10-19 18:46:24,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 44 transitions. Stem has 14 letters. Loop has 3 letters. [2020-10-19 18:46:24,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:46:24,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 44 transitions. Stem has 17 letters. Loop has 3 letters. [2020-10-19 18:46:24,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:46:24,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 44 transitions. Stem has 14 letters. Loop has 6 letters. [2020-10-19 18:46:24,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:46:24,842 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 119 transitions. [2020-10-19 18:46:24,845 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 18:46:24,846 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 44 states and 59 transitions. [2020-10-19 18:46:24,846 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-10-19 18:46:24,846 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2020-10-19 18:46:24,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 59 transitions. [2020-10-19 18:46:24,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 18:46:24,846 INFO L691 BuchiCegarLoop]: Abstraction has 44 states and 59 transitions. [2020-10-19 18:46:24,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 59 transitions. [2020-10-19 18:46:24,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 31. [2020-10-19 18:46:24,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-10-19 18:46:24,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2020-10-19 18:46:24,850 INFO L714 BuchiCegarLoop]: Abstraction has 31 states and 41 transitions. [2020-10-19 18:46:24,850 INFO L594 BuchiCegarLoop]: Abstraction has 31 states and 41 transitions. [2020-10-19 18:46:24,850 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-19 18:46:24,850 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 41 transitions. [2020-10-19 18:46:24,850 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-19 18:46:24,851 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:46:24,851 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:46:24,851 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-10-19 18:46:24,851 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 18:46:24,852 INFO L794 eck$LassoCheckResult]: Stem: 917#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 915#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 916#L562 assume !(main_~array_size~0 < 1); 925#L562-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset, bubbleSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc bubbleSort_#t~mem4, bubbleSort_#t~mem5, bubbleSort_#t~mem6, bubbleSort_#t~mem7, bubbleSort_#t~post3, bubbleSort_#t~post2, bubbleSort_~numbers.base, bubbleSort_~numbers.offset, bubbleSort_~array_size, bubbleSort_~i~0, bubbleSort_~j~0, bubbleSort_~temp~0;bubbleSort_~numbers.base, bubbleSort_~numbers.offset := bubbleSort_#in~numbers.base, bubbleSort_#in~numbers.offset;bubbleSort_~array_size := bubbleSort_#in~array_size;havoc bubbleSort_~i~0;havoc bubbleSort_~j~0;havoc bubbleSort_~temp~0;bubbleSort_~i~0 := bubbleSort_~array_size - 1; 918#L550-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 919#L551-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 939#L552 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5; 924#L551-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 938#L551-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 937#L552 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 926#L551-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 911#L551-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 912#L552 assume !(bubbleSort_#t~mem4 > bubbleSort_#t~mem5);havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5; 931#L551-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 927#L551-3 assume !(bubbleSort_~j~0 <= bubbleSort_~i~0); 928#L550-2 bubbleSort_#t~post2 := bubbleSort_~i~0;bubbleSort_~i~0 := bubbleSort_#t~post2 - 1;havoc bubbleSort_#t~post2; 920#L550-3 assume !!(bubbleSort_~i~0 >= 0);bubbleSort_~j~0 := 1; 909#L551-3 [2020-10-19 18:46:24,852 INFO L796 eck$LassoCheckResult]: Loop: 909#L551-3 assume !!(bubbleSort_~j~0 <= bubbleSort_~i~0);call bubbleSort_#t~mem4 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);call bubbleSort_#t~mem5 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 910#L552 assume bubbleSort_#t~mem4 > bubbleSort_#t~mem5;havoc bubbleSort_#t~mem4;havoc bubbleSort_#t~mem5;call bubbleSort_#t~mem6 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);bubbleSort_~temp~0 := bubbleSort_#t~mem6;havoc bubbleSort_#t~mem6;call bubbleSort_#t~mem7 := read~int(bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4);call write~int(bubbleSort_#t~mem7, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * (bubbleSort_~j~0 - 1), 4);havoc bubbleSort_#t~mem7;call write~int(bubbleSort_~temp~0, bubbleSort_~numbers.base, bubbleSort_~numbers.offset + 4 * bubbleSort_~j~0, 4); 922#L551-2 bubbleSort_#t~post3 := bubbleSort_~j~0;bubbleSort_~j~0 := 1 + bubbleSort_#t~post3;havoc bubbleSort_#t~post3; 909#L551-3 [2020-10-19 18:46:24,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:46:24,852 INFO L82 PathProgramCache]: Analyzing trace with hash 553598583, now seen corresponding path program 5 times [2020-10-19 18:46:24,852 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:46:24,853 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329641267] [2020-10-19 18:46:24,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:46:24,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:46:24,865 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:46:24,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:46:24,876 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:46:24,881 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:46:24,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:46:24,881 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 6 times [2020-10-19 18:46:24,882 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:46:24,882 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019217366] [2020-10-19 18:46:24,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:46:24,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:46:24,886 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:46:24,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:46:24,889 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:46:24,891 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:46:24,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:46:24,892 INFO L82 PathProgramCache]: Analyzing trace with hash -419005562, now seen corresponding path program 6 times [2020-10-19 18:46:24,892 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:46:24,892 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956395922] [2020-10-19 18:46:24,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:46:24,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:46:24,909 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:46:24,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:46:24,940 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:46:24,947 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:46:25,564 WARN L193 SmtUtils]: Spent 509.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 118 [2020-10-19 18:46:25,690 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2020-10-19 18:46:25,693 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 18:46:25,693 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 18:46:25,693 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 18:46:25,693 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 18:46:25,693 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 18:46:25,694 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:46:25,694 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 18:46:25,694 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 18:46:25,694 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-1.i_Iteration8_Lasso [2020-10-19 18:46:25,694 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 18:46:25,694 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 18:46:25,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-19 18:46:25,702 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-19 18:46:25,703 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-19 18:46:25,706 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-19 18:46:25,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-19 18:46:25,712 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-19 18:46:25,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-19 18:46:25,718 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-19 18:46:25,721 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-19 18:46:25,726 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-19 18:46:25,730 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-19 18:46:25,732 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-19 18:46:25,735 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-19 18:46:25,945 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2020-10-19 18:46:26,050 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-19 18:46:26,057 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-19 18:46:26,450 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 18:46:26,450 INFO L489 LassoAnalysis]: Using template 'affine'. 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-19 18:46:26,455 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-19 18:46:26,456 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:46:26,456 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:46:26,456 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:46:26,456 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:46:26,457 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:46:26,457 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:46:26,457 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:46:26,458 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-19 18:46:26,483 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-19 18:46:26,484 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:46:26,484 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:46:26,484 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:46:26,485 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:46:26,485 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:46:26,485 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:46:26,486 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:46:26,487 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-19 18:46:26,510 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-19 18:46:26,512 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:46:26,512 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:46:26,512 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:46:26,512 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:46:26,514 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:46:26,514 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:46:26,517 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 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:46:26,542 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-19 18:46:26,543 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:46:26,544 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:46:26,544 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:46:26,544 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:46:26,547 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:46:26,547 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:46:26,552 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:46:26,589 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-19 18:46:26,590 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:46:26,591 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:46:26,591 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:46:26,591 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:46:26,591 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:46:26,593 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:46:26,593 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:46:26,595 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:46:26,635 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-19 18:46:26,636 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:46:26,637 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:46:26,637 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:46:26,637 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:46:26,637 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:46:26,638 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:46:26,638 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:46:26,645 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 37 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:46:26,678 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-19 18:46:26,680 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:46:26,680 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:46:26,680 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:46:26,680 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:46:26,681 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:46:26,681 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:46:26,681 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:46:26,683 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:46:26,737 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-19 18:46:26,738 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:46:26,739 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:46:26,739 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:46:26,739 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:46:26,740 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:46:26,740 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:46:26,743 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 38 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 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:46:26,785 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-19 18:46:26,787 INFO L338 nArgumentSynthesizer]: Template has degree 0. Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:46:26,789 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:46:26,789 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:46:26,789 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:46:26,792 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:46:26,792 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:46:26,795 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 40 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:46:26,818 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-19 18:46:26,819 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:46:26,819 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:46:26,820 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:46:26,820 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:46:26,820 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:46:26,820 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:46:26,820 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:46:26,821 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:46:26,851 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:46:26,852 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:46:26,853 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:46:26,853 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:46:26,853 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:46:26,853 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:46:26,853 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:46:26,854 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:46:26,855 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 42 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 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:46:26,877 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-19 18:46:26,878 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:46:26,878 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:46:26,878 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:46:26,878 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:46:26,878 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:46:26,878 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:46:26,879 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:46:26,880 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 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:46:26,901 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 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:46:26,903 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:46:26,903 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:46:26,903 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:46:26,903 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:46:26,906 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:46:26,906 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:46:26,926 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 44 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 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:46:26,956 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-19 18:46:26,958 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:46:26,959 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:46:26,959 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:46:26,959 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:46:26,965 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:46:26,965 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:46:26,977 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 18:46:27,007 INFO L443 ModelExtractionUtils]: Simplification made 17 calls to the SMT solver. [2020-10-19 18:46:27,007 INFO L444 ModelExtractionUtils]: 15 out of 31 variables were initially zero. Simplification set additionally 12 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 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 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:46:27,009 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-19 18:46:27,010 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-19 18:46:27,011 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 18:46:27,011 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_bubbleSort_~numbers.offset, v_rep(select #length ULTIMATE.start_bubbleSort_~numbers.base)_3, ULTIMATE.start_bubbleSort_~j~0) = -1*ULTIMATE.start_bubbleSort_~numbers.offset + 1*v_rep(select #length ULTIMATE.start_bubbleSort_~numbers.base)_3 - 4*ULTIMATE.start_bubbleSort_~j~0 Supporting invariants [] [2020-10-19 18:46:27,060 INFO L297 tatePredicateManager]: 10 out of 10 supporting invariants were superfluous and have been removed [2020-10-19 18:46:27,062 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-19 18:46:27,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:46:27,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:46:27,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 18:46:27,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:46:27,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:46:27,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-19 18:46:27,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:46:27,120 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-19 18:46:27,120 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-19 18:46:27,120 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 41 transitions. cyclomatic complexity: 12 Second operand 3 states. [2020-10-19 18:46:27,154 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 41 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 63 states and 86 transitions. Complement of second has 7 states. [2020-10-19 18:46:27,156 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-19 18:46:27,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-19 18:46:27,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2020-10-19 18:46:27,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 17 letters. Loop has 3 letters. [2020-10-19 18:46:27,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:46:27,157 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-19 18:46:27,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:46:27,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:46:27,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 18:46:27,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:46:27,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:46:27,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-19 18:46:27,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:46:27,203 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-19 18:46:27,204 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-19 18:46:27,204 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 41 transitions. cyclomatic complexity: 12 Second operand 3 states. [2020-10-19 18:46:27,221 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 41 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 63 states and 86 transitions. Complement of second has 7 states. [2020-10-19 18:46:27,223 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-19 18:46:27,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-19 18:46:27,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2020-10-19 18:46:27,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 17 letters. Loop has 3 letters. [2020-10-19 18:46:27,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:46:27,224 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-19 18:46:27,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:46:27,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:46:27,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 18:46:27,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:46:27,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:46:27,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-19 18:46:27,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:46:27,279 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-19 18:46:27,279 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-19 18:46:27,279 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 41 transitions. cyclomatic complexity: 12 Second operand 3 states. [2020-10-19 18:46:27,297 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 41 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 49 states and 68 transitions. Complement of second has 6 states. [2020-10-19 18:46:27,297 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-19 18:46:27,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-19 18:46:27,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2020-10-19 18:46:27,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 17 letters. Loop has 3 letters. [2020-10-19 18:46:27,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:46:27,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 20 letters. Loop has 3 letters. [2020-10-19 18:46:27,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:46:27,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 17 letters. Loop has 6 letters. [2020-10-19 18:46:27,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:46:27,300 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 68 transitions. [2020-10-19 18:46:27,301 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-19 18:46:27,302 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 0 states and 0 transitions. [2020-10-19 18:46:27,302 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-19 18:46:27,302 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-19 18:46:27,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-19 18:46:27,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 18:46:27,302 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-19 18:46:27,302 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-19 18:46:27,302 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-19 18:46:27,302 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-19 18:46:27,302 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-10-19 18:46:27,303 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-19 18:46:27,303 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-10-19 18:46:27,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.10 06:46:27 BoogieIcfgContainer [2020-10-19 18:46:27,309 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-19 18:46:27,310 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-19 18:46:27,310 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-19 18:46:27,310 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-19 18:46:27,311 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 06:46:17" (3/4) ... [2020-10-19 18:46:27,313 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-19 18:46:27,314 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-19 18:46:27,315 INFO L168 Benchmark]: Toolchain (without parser) took 10829.23 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 332.4 MB). Free memory was 960.0 MB in the beginning and 1.2 GB in the end (delta: -268.6 MB). Peak memory consumption was 63.7 MB. Max. memory is 11.5 GB. [2020-10-19 18:46:27,315 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 18:46:27,316 INFO L168 Benchmark]: CACSL2BoogieTranslator took 525.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 954.6 MB in the beginning and 1.1 GB in the end (delta: -166.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2020-10-19 18:46:27,316 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.03 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 18:46:27,317 INFO L168 Benchmark]: Boogie Preprocessor took 30.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2020-10-19 18:46:27,317 INFO L168 Benchmark]: RCFGBuilder took 390.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2020-10-19 18:46:27,318 INFO L168 Benchmark]: BuchiAutomizer took 9821.29 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 193.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -134.3 MB). Peak memory consumption was 59.2 MB. Max. memory is 11.5 GB. [2020-10-19 18:46:27,319 INFO L168 Benchmark]: Witness Printer took 3.78 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 18:46:27,322 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.32 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 525.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 954.6 MB in the beginning and 1.1 GB in the end (delta: -166.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 46.03 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 390.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9821.29 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 193.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -134.3 MB). Peak memory consumption was 59.2 MB. Max. memory is 11.5 GB. * Witness Printer took 3.78 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (4 trivial, 2 deterministic, 2 nondeterministic). One deterministic module has affine ranking function 2 * i + 1 and consists of 3 locations. One deterministic module has affine ranking function -16 * j + 9 * unknown-#length-unknown[numbers] and consists of 6 locations. One nondeterministic module has affine ranking function -2 * j + 3 and consists of 12 locations. One nondeterministic module has affine ranking function -1 * numbers + unknown-#length-unknown[numbers] + -4 * j and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.7s and 9 iterations. TraceHistogramMax:3. Analysis of lassos took 7.8s. Construction of modules took 0.3s. Büchi inclusion checks took 1.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 43 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 31 states and ocurred in iteration 7. Nontrivial modules had stage [2, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 109 SDtfs, 144 SDslu, 136 SDs, 0 SdLazy, 228 SolverSat, 49 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT1 conc2 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital141 mio100 ax147 hnf98 lsp72 ukn74 mio100 lsp74 div100 bol100 ite100 ukn100 eq170 hnf90 smp88 dnf100 smp100 tf103 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 30ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 3 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...