./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 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/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-9a8b2e8 [2020-10-20 06:39:17,200 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 06:39:17,203 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 06:39:17,241 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 06:39:17,242 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 06:39:17,251 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 06:39:17,254 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 06:39:17,258 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 06:39:17,260 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 06:39:17,271 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 06:39:17,273 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 06:39:17,275 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 06:39:17,275 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 06:39:17,279 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 06:39:17,280 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 06:39:17,282 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 06:39:17,283 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 06:39:17,284 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 06:39:17,287 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 06:39:17,293 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 06:39:17,295 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 06:39:17,296 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 06:39:17,298 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 06:39:17,299 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 06:39:17,311 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 06:39:17,314 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 06:39:17,315 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 06:39:17,317 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 06:39:17,319 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 06:39:17,320 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 06:39:17,320 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 06:39:17,321 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 06:39:17,324 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 06:39:17,325 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 06:39:17,326 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 06:39:17,326 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 06:39:17,327 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 06:39:17,327 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 06:39:17,327 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 06:39:17,328 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 06:39:17,329 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 06:39:17,330 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-10-20 06:39:17,353 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 06:39:17,353 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 06:39:17,355 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 06:39:17,355 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 06:39:17,355 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 06:39:17,355 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-20 06:39:17,356 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-20 06:39:17,356 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-20 06:39:17,356 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-20 06:39:17,356 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-20 06:39:17,357 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-20 06:39:17,357 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 06:39:17,357 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 06:39:17,357 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 06:39:17,357 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 06:39:17,358 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-20 06:39:17,358 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-20 06:39:17,358 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-20 06:39:17,358 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 06:39:17,359 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-20 06:39:17,359 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 06:39:17,359 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-20 06:39:17,359 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 06:39:17,360 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 06:39:17,360 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-20 06:39:17,360 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 06:39:17,360 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 06:39:17,361 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 06:39:17,361 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-20 06:39:17,362 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-20 06:39:17,362 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-20 06:39:17,568 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 06:39:17,580 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 06:39:17,584 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 06:39:17,585 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 06:39:17,586 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 06:39:17,587 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-20 06:39:17,658 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e508458d4/13d64cbd19e94d55b0d6d18bd880b49e/FLAGe6c423617 [2020-10-20 06:39:18,166 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 06:39:18,167 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/bubblesort-alloca-1.i [2020-10-20 06:39:18,183 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e508458d4/13d64cbd19e94d55b0d6d18bd880b49e/FLAGe6c423617 [2020-10-20 06:39:18,475 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e508458d4/13d64cbd19e94d55b0d6d18bd880b49e [2020-10-20 06:39:18,478 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 06:39:18,484 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 06:39:18,485 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 06:39:18,486 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 06:39:18,489 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 06:39:18,490 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 06:39:18" (1/1) ... [2020-10-20 06:39:18,493 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42f2b4d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:39:18, skipping insertion in model container [2020-10-20 06:39:18,493 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 06:39:18" (1/1) ... [2020-10-20 06:39:18,501 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 06:39:18,543 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 06:39:18,940 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 06:39:18,950 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 06:39:18,992 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 06:39:19,051 INFO L208 MainTranslator]: Completed translation [2020-10-20 06:39:19,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:39:19 WrapperNode [2020-10-20 06:39:19,052 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 06:39:19,054 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 06:39:19,054 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 06:39:19,054 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 06:39:19,064 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:39:19" (1/1) ... [2020-10-20 06:39:19,092 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:39:19" (1/1) ... [2020-10-20 06:39:19,113 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 06:39:19,114 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 06:39:19,114 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 06:39:19,114 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 06:39:19,123 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:39:19" (1/1) ... [2020-10-20 06:39:19,123 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:39:19" (1/1) ... [2020-10-20 06:39:19,126 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:39:19" (1/1) ... [2020-10-20 06:39:19,126 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:39:19" (1/1) ... [2020-10-20 06:39:19,133 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:39:19" (1/1) ... [2020-10-20 06:39:19,138 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:39:19" (1/1) ... [2020-10-20 06:39:19,140 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:39:19" (1/1) ... [2020-10-20 06:39:19,142 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 06:39:19,143 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 06:39:19,143 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 06:39:19,143 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 06:39:19,144 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:39:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:19,209 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-20 06:39:19,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-20 06:39:19,210 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 06:39:19,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 06:39:19,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 06:39:19,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 06:39:19,475 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 06:39:19,476 INFO L298 CfgBuilder]: Removed 8 assume(true) statements. [2020-10-20 06:39:19,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:39:19 BoogieIcfgContainer [2020-10-20 06:39:19,478 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 06:39:19,478 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-20 06:39:19,478 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-20 06:39:19,482 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-20 06:39:19,483 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:39:19,483 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.10 06:39:18" (1/3) ... [2020-10-20 06:39:19,484 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@19fa5be5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 06:39:19, skipping insertion in model container [2020-10-20 06:39:19,484 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:39:19,484 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:39:19" (2/3) ... [2020-10-20 06:39:19,485 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@19fa5be5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 06:39:19, skipping insertion in model container [2020-10-20 06:39:19,485 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:39:19,485 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:39:19" (3/3) ... [2020-10-20 06:39:19,487 INFO L373 chiAutomizerObserver]: Analyzing ICFG bubblesort-alloca-1.i [2020-10-20 06:39:19,536 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-20 06:39:19,536 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-20 06:39:19,536 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-20 06:39:19,537 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 06:39:19,537 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 06:39:19,537 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-20 06:39:19,537 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 06:39:19,537 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-20 06:39:19,551 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2020-10-20 06:39:19,570 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-20 06:39:19,570 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:39:19,570 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:39:19,576 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-20 06:39:19,576 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 06:39:19,577 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-20 06:39:19,577 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2020-10-20 06:39:19,578 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-20 06:39:19,578 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:39:19,579 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:39:19,579 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-20 06:39:19,579 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 06:39:19,585 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-20 06:39:19,586 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-20 06:39:19,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:19,591 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2020-10-20 06:39:19,599 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:19,599 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802268404] [2020-10-20 06:39:19,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:19,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:19,710 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:19,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:19,736 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:19,777 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:39:19,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:19,779 INFO L82 PathProgramCache]: Analyzing trace with hash 47218, now seen corresponding path program 1 times [2020-10-20 06:39:19,779 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:19,780 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035730777] [2020-10-20 06:39:19,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:19,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:39:19,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:39:19,824 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035730777] [2020-10-20 06:39:19,824 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:39:19,825 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 06:39:19,825 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642022464] [2020-10-20 06:39:19,831 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:39:19,832 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:39:19,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-20 06:39:19,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-20 06:39:19,847 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 2 states. [2020-10-20 06:39:19,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:39:19,853 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2020-10-20 06:39:19,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-20 06:39:19,855 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2020-10-20 06:39:19,856 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-20 06:39:19,859 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 9 states and 12 transitions. [2020-10-20 06:39:19,860 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-10-20 06:39:19,861 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-10-20 06:39:19,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 12 transitions. [2020-10-20 06:39:19,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:39:19,862 INFO L691 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2020-10-20 06:39:19,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 12 transitions. [2020-10-20 06:39:19,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2020-10-20 06:39:19,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-20 06:39:19,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2020-10-20 06:39:19,886 INFO L714 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2020-10-20 06:39:19,886 INFO L594 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2020-10-20 06:39:19,886 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-20 06:39:19,886 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 12 transitions. [2020-10-20 06:39:19,887 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-20 06:39:19,887 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:39:19,887 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:39:19,887 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-20 06:39:19,887 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 06:39:19,888 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-20 06:39:19,888 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-20 06:39:19,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:19,888 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2020-10-20 06:39:19,889 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:19,889 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125059683] [2020-10-20 06:39:19,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:19,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:19,901 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:19,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:19,911 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:19,918 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:39:19,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:19,919 INFO L82 PathProgramCache]: Analyzing trace with hash 46877, now seen corresponding path program 1 times [2020-10-20 06:39:19,919 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:19,920 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190233362] [2020-10-20 06:39:19,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:19,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:19,934 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:19,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:19,938 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:19,939 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:39:19,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:19,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818489, now seen corresponding path program 1 times [2020-10-20 06:39:19,940 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:19,940 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456349382] [2020-10-20 06:39:19,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:19,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:19,953 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:19,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:19,965 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:19,970 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:39:20,030 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:39:20,031 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:39:20,031 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:39:20,032 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:39:20,032 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 06:39:20,032 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:20,032 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:39:20,032 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:39:20,033 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-1.i_Iteration2_Loop [2020-10-20 06:39:20,033 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:39:20,033 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:39:20,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:20,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:20,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:20,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:20,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:20,193 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:39:20,193 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-20 06:39:20,204 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:39:20,204 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 06:39:20,216 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 06:39:20,216 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) [2020-10-20 06:39:20,272 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:39:20,272 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:20,276 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 06:39:20,277 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) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:20,311 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:39:20,312 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 06:39:20,317 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 06:39:20,317 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) [2020-10-20 06:39:20,351 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:39:20,351 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:39:20,388 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 06:39:20,388 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-20 06:39:20,427 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 06:39:20,436 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:39:20,437 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:39:20,437 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:39:20,437 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:39:20,437 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:39:20,437 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:20,437 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:39:20,437 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:39:20,438 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-1.i_Iteration2_Loop [2020-10-20 06:39:20,438 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:39:20,438 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:39:20,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:20,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:20,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:20,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:20,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:20,580 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:39:20,584 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) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:20,602 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:39:20,605 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:20,605 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:39:20,606 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:20,606 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:20,606 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:20,610 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:39:20,610 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:39:20,613 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) [2020-10-20 06:39:20,664 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:39:20,665 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:20,666 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:20,666 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:20,667 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:20,667 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:20,670 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:39:20,670 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:39:20,673 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:39:20,677 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-20 06:39:20,678 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-20 06:39:20,685 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 06:39:20,685 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-20 06:39:20,686 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:39:20,686 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-20 06:39:20,719 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-20 06:39:20,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:20,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:39:20,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:39:20,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:39:20,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:39:20,797 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 06:39:20,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:39:20,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:39:20,819 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-20 06:39:20,821 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 12 transitions. cyclomatic complexity: 4 Second operand 3 states. [2020-10-20 06:39:20,881 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-20 06:39:20,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-10-20 06:39:20,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 06:39:20,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2020-10-20 06:39:20,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 4 letters. Loop has 3 letters. [2020-10-20 06:39:20,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:39:20,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 7 letters. Loop has 3 letters. [2020-10-20 06:39:20,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:39:20,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 4 letters. Loop has 6 letters. [2020-10-20 06:39:20,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:39:20,889 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 22 transitions. [2020-10-20 06:39:20,891 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:39:20,894 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 14 states and 20 transitions. [2020-10-20 06:39:20,900 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2020-10-20 06:39:20,901 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-10-20 06:39:20,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 20 transitions. [2020-10-20 06:39:20,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:39:20,902 INFO L691 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2020-10-20 06:39:20,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 20 transitions. [2020-10-20 06:39:20,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2020-10-20 06:39:20,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-20 06:39:20,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2020-10-20 06:39:20,907 INFO L714 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2020-10-20 06:39:20,907 INFO L594 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2020-10-20 06:39:20,907 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-20 06:39:20,908 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 19 transitions. [2020-10-20 06:39:20,908 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:39:20,909 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:39:20,910 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:39:20,910 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-20 06:39:20,911 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 06:39:20,911 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-20 06:39:20,911 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-20 06:39:20,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:20,912 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2020-10-20 06:39:20,912 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:20,913 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733519301] [2020-10-20 06:39:20,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:20,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:20,944 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:20,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:20,960 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:20,968 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:39:20,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:20,972 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 1 times [2020-10-20 06:39:20,972 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:20,973 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949069724] [2020-10-20 06:39:20,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:21,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:21,023 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:21,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:21,039 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:21,044 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:39:21,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:21,044 INFO L82 PathProgramCache]: Analyzing trace with hash 176800017, now seen corresponding path program 1 times [2020-10-20 06:39:21,045 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:21,045 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428615859] [2020-10-20 06:39:21,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:21,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:21,079 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:21,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:21,112 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:21,119 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:39:21,383 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2020-10-20 06:39:21,455 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:39:21,455 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:39:21,456 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:39:21,456 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:39:21,456 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:39:21,456 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:21,456 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:39:21,456 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:39:21,456 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-1.i_Iteration3_Lasso [2020-10-20 06:39:21,456 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:39:21,457 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:39:21,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:21,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:21,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:21,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:21,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:21,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:21,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:21,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:21,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:21,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:21,626 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2020-10-20 06:39:21,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:21,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:21,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:21,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:22,027 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:39:22,028 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) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:22,035 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:39:22,036 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:22,036 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:39:22,037 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:22,037 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:22,037 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:22,038 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:39:22,038 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:39:22,039 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:22,068 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:39:22,070 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:22,070 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:39:22,070 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:22,070 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:22,071 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:22,072 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:39:22,072 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:39:22,075 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:22,099 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:39:22,104 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:22,104 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:39:22,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:22,105 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:22,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:22,106 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:39:22,107 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:39:22,108 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:22,135 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:39:22,136 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:22,137 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:22,137 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:22,137 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:22,147 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:39:22,147 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:39:22,151 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:22,197 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:39:22,199 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:22,199 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:39:22,199 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:22,199 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:22,199 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:22,202 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:39:22,202 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:39:22,204 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-20 06:39:22,242 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:39:22,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:22,244 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:22,244 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:22,244 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:22,247 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:39:22,247 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:39:22,251 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) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:22,290 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:39:22,292 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:22,292 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:22,293 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:22,293 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:22,305 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:39:22,305 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:39:22,309 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-20 06:39:22,352 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:39:22,353 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:22,354 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:39:22,354 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:22,354 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:22,354 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:22,355 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:39:22,355 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:39:22,357 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-20 06:39:22,387 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:39:22,388 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:22,388 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:39:22,388 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:22,389 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:22,389 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:22,389 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:39:22,390 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:39:22,392 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:39:22,414 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:39:22,416 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:22,416 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:22,416 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:22,416 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:22,426 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:39:22,426 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:39:22,443 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:22,467 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:39:22,469 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:22,469 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:22,469 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:22,470 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:22,486 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:39:22,486 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:39:22,501 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:39:22,580 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2020-10-20 06:39:22,580 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-20 06:39:22,600 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-20 06:39:22,604 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-10-20 06:39:22,604 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:39:22,604 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_bubbleSort_~numbers.base)_1, ULTIMATE.start_bubbleSort_~j~0) = 9*v_rep(select #length ULTIMATE.start_bubbleSort_~numbers.base)_1 - 16*ULTIMATE.start_bubbleSort_~j~0 Supporting invariants [1*v_rep(select #length ULTIMATE.start_main_#t~malloc9.base)_1 - 2*ULTIMATE.start_bubbleSort_~i~0 >= 0] [2020-10-20 06:39:22,655 INFO L297 tatePredicateManager]: 3 out of 5 supporting invariants were superfluous and have been removed [2020-10-20 06:39:22,662 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-20 06:39:22,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:22,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:39:22,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 13 conjunts are in the unsatisfiable core [2020-10-20 06:39:22,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:39:22,897 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-20 06:39:22,897 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:39:22,907 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:39:22,915 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-20 06:39:22,916 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:28 [2020-10-20 06:39:22,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:39:22,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-20 06:39:22,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:39:22,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:39:22,998 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-20 06:39:22,998 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 19 transitions. cyclomatic complexity: 8 Second operand 5 states. [2020-10-20 06:39:23,101 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-20 06:39:23,104 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-20 06:39:23,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-20 06:39:23,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2020-10-20 06:39:23,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 5 letters. Loop has 3 letters. [2020-10-20 06:39:23,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:39:23,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 8 letters. Loop has 3 letters. [2020-10-20 06:39:23,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:39:23,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 5 letters. Loop has 6 letters. [2020-10-20 06:39:23,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:39:23,106 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 41 transitions. [2020-10-20 06:39:23,109 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:39:23,112 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 18 states and 26 transitions. [2020-10-20 06:39:23,112 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2020-10-20 06:39:23,112 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2020-10-20 06:39:23,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 26 transitions. [2020-10-20 06:39:23,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:39:23,113 INFO L691 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2020-10-20 06:39:23,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 26 transitions. [2020-10-20 06:39:23,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 13. [2020-10-20 06:39:23,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-20 06:39:23,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2020-10-20 06:39:23,118 INFO L714 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2020-10-20 06:39:23,118 INFO L594 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2020-10-20 06:39:23,118 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-20 06:39:23,118 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2020-10-20 06:39:23,119 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:39:23,119 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:39:23,121 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:39:23,121 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2020-10-20 06:39:23,122 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 06:39:23,122 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-20 06:39:23,122 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-20 06:39:23,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:23,122 INFO L82 PathProgramCache]: Analyzing trace with hash 176798328, now seen corresponding path program 2 times [2020-10-20 06:39:23,123 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:23,123 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764538742] [2020-10-20 06:39:23,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:23,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:39:23,204 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-20 06:39:23,204 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764538742] [2020-10-20 06:39:23,204 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:39:23,205 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 06:39:23,205 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792565464] [2020-10-20 06:39:23,205 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:39:23,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:23,206 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 2 times [2020-10-20 06:39:23,206 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:23,206 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739270952] [2020-10-20 06:39:23,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:23,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:23,212 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:23,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:23,235 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:23,237 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:39:23,316 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:39:23,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 06:39:23,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-20 06:39:23,317 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand 5 states. [2020-10-20 06:39:23,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:39:23,356 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions. [2020-10-20 06:39:23,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 06:39:23,357 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2020-10-20 06:39:23,358 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:39:23,359 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 19 states and 26 transitions. [2020-10-20 06:39:23,359 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-10-20 06:39:23,359 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-10-20 06:39:23,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 26 transitions. [2020-10-20 06:39:23,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:39:23,359 INFO L691 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2020-10-20 06:39:23,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 26 transitions. [2020-10-20 06:39:23,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 14. [2020-10-20 06:39:23,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-20 06:39:23,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2020-10-20 06:39:23,362 INFO L714 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2020-10-20 06:39:23,362 INFO L594 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2020-10-20 06:39:23,362 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-20 06:39:23,362 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2020-10-20 06:39:23,363 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:39:23,363 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:39:23,363 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:39:23,363 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:39:23,363 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 06:39:23,364 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-20 06:39:23,364 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-20 06:39:23,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:23,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1421271829, now seen corresponding path program 1 times [2020-10-20 06:39:23,364 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:23,364 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169111410] [2020-10-20 06:39:23,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:23,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:23,376 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:23,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:23,385 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:23,389 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:39:23,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:23,389 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 3 times [2020-10-20 06:39:23,390 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:23,390 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807264962] [2020-10-20 06:39:23,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:23,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:23,401 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:23,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:23,410 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:23,413 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:39:23,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:23,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1321478696, now seen corresponding path program 1 times [2020-10-20 06:39:23,414 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:23,415 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452725537] [2020-10-20 06:39:23,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:23,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:39:23,518 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-20 06:39:23,518 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452725537] [2020-10-20 06:39:23,518 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812504310] [2020-10-20 06:39:23,519 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-20 06:39:23,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:39:23,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-20 06:39:23,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:39:23,617 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-20 06:39:23,618 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:39:23,618 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-20 06:39:23,618 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275119312] [2020-10-20 06:39:23,725 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:39:23,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-20 06:39:23,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-10-20 06:39:23,726 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand 9 states. [2020-10-20 06:39:23,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:39:23,787 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2020-10-20 06:39:23,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 06:39:23,788 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 38 transitions. [2020-10-20 06:39:23,789 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:39:23,790 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 25 states and 34 transitions. [2020-10-20 06:39:23,792 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-10-20 06:39:23,792 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-10-20 06:39:23,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 34 transitions. [2020-10-20 06:39:23,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:39:23,793 INFO L691 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2020-10-20 06:39:23,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 34 transitions. [2020-10-20 06:39:23,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2020-10-20 06:39:23,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-10-20 06:39:23,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2020-10-20 06:39:23,797 INFO L714 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2020-10-20 06:39:23,797 INFO L594 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2020-10-20 06:39:23,797 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-20 06:39:23,797 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2020-10-20 06:39:23,798 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:39:23,798 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:39:23,798 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:39:23,799 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2020-10-20 06:39:23,799 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 06:39:23,799 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-20 06:39:23,800 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-20 06:39:23,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:23,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1373641048, now seen corresponding path program 2 times [2020-10-20 06:39:23,800 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:23,800 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012586447] [2020-10-20 06:39:23,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:23,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:23,831 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:23,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:23,855 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:23,862 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:39:23,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:23,863 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 4 times [2020-10-20 06:39:23,864 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:23,864 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769914182] [2020-10-20 06:39:23,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:23,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:23,876 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:23,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:23,881 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:23,884 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:39:23,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:23,884 INFO L82 PathProgramCache]: Analyzing trace with hash -307910395, now seen corresponding path program 2 times [2020-10-20 06:39:23,884 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:23,885 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655277787] [2020-10-20 06:39:23,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:23,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:39:24,116 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-20 06:39:24,117 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655277787] [2020-10-20 06:39:24,117 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31937630] [2020-10-20 06:39:24,117 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-20 06:39:24,164 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-20 06:39:24,164 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:39:24,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-20 06:39:24,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:39:24,248 INFO L350 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2020-10-20 06:39:24,248 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 10 [2020-10-20 06:39:24,252 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 06:39:24,254 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 06:39:24,255 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 06:39:24,255 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2020-10-20 06:39:24,265 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-20 06:39:24,266 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:39:24,266 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 13 [2020-10-20 06:39:24,266 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876702438] [2020-10-20 06:39:24,347 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:39:24,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-20 06:39:24,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2020-10-20 06:39:24,348 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. cyclomatic complexity: 8 Second operand 13 states. [2020-10-20 06:39:24,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:39:24,461 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2020-10-20 06:39:24,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-20 06:39:24,462 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 50 transitions. [2020-10-20 06:39:24,465 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-10-20 06:39:24,469 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 50 transitions. [2020-10-20 06:39:24,469 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2020-10-20 06:39:24,469 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2020-10-20 06:39:24,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 50 transitions. [2020-10-20 06:39:24,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:39:24,470 INFO L691 BuchiCegarLoop]: Abstraction has 37 states and 50 transitions. [2020-10-20 06:39:24,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 50 transitions. [2020-10-20 06:39:24,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2020-10-20 06:39:24,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-10-20 06:39:24,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2020-10-20 06:39:24,477 INFO L714 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2020-10-20 06:39:24,477 INFO L594 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2020-10-20 06:39:24,477 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-20 06:39:24,477 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 35 transitions. [2020-10-20 06:39:24,481 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:39:24,481 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:39:24,481 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:39:24,482 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:39:24,482 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 06:39:24,482 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-20 06:39:24,482 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-20 06:39:24,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:24,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1371794006, now seen corresponding path program 3 times [2020-10-20 06:39:24,488 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:24,488 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803594190] [2020-10-20 06:39:24,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:24,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:24,509 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:24,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:24,530 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:24,541 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:39:24,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:24,542 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 5 times [2020-10-20 06:39:24,542 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:24,542 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407773949] [2020-10-20 06:39:24,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:24,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:24,549 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:24,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:24,554 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:24,556 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:39:24,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:24,556 INFO L82 PathProgramCache]: Analyzing trace with hash 501436231, now seen corresponding path program 4 times [2020-10-20 06:39:24,557 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:24,558 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895122776] [2020-10-20 06:39:24,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:24,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:24,590 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:24,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:24,603 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:24,607 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:39:25,054 WARN L193 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 101 [2020-10-20 06:39:25,168 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:39:25,168 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:39:25,168 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:39:25,168 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:39:25,168 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:39:25,168 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:25,169 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:39:25,169 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:39:25,169 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-1.i_Iteration7_Lasso [2020-10-20 06:39:25,169 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:39:25,169 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:39:25,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:25,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:25,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:25,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:25,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:25,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:25,379 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2020-10-20 06:39:25,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:25,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:25,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-20 06:39:25,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:25,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:25,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:25,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:25,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:25,845 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:39:25,846 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) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:25,852 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:39:25,853 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:25,853 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:39:25,854 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:25,854 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:25,854 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:25,854 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:39:25,854 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:39:25,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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:39:25,878 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:39:25,879 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:25,879 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:25,879 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:25,880 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:25,881 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:39:25,881 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:39:25,889 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-20 06:39:25,923 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:39:25,925 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:25,925 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:39:25,925 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:25,926 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:25,926 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:25,926 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:39:25,926 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-20 06:39:25,928 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:39:25,963 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:39:25,964 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:25,965 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:25,965 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:25,965 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:25,967 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:39:25,967 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:25,973 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) [2020-10-20 06:39:26,005 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:26,006 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:26,006 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:39:26,007 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:26,007 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:26,007 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:26,007 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:39:26,007 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:39:26,008 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:26,031 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:39:26,032 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:26,033 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:26,033 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:26,033 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:26,041 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:39:26,041 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:39:26,063 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:39:26,138 INFO L443 ModelExtractionUtils]: Simplification made 21 calls to the SMT solver. [2020-10-20 06:39:26,139 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) [2020-10-20 06:39:26,149 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:26,158 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-10-20 06:39:26,159 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:39:26,159 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-20 06:39:26,206 INFO L297 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2020-10-20 06:39:26,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:26,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:39:26,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-20 06:39:26,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:39:26,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:39:26,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-20 06:39:26,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:39:26,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:39:26,373 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-20 06:39:26,374 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11 Second operand 8 states. [2020-10-20 06:39:26,401 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-20 06:39:26,401 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-20 06:39:26,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-20 06:39:26,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 6 transitions. [2020-10-20 06:39:26,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 6 transitions. Stem has 14 letters. Loop has 3 letters. [2020-10-20 06:39:26,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:39:26,402 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-20 06:39:26,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:26,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:39:26,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-20 06:39:26,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:39:26,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:39:26,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-20 06:39:26,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:39:26,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:39:26,566 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-20 06:39:26,566 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11 Second operand 8 states. [2020-10-20 06:39:26,595 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-20 06:39:26,596 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-20 06:39:26,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-20 06:39:26,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 6 transitions. [2020-10-20 06:39:26,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 6 transitions. Stem has 14 letters. Loop has 3 letters. [2020-10-20 06:39:26,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:39:26,597 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-20 06:39:26,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:26,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:39:26,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-20 06:39:26,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:39:26,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:39:26,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-20 06:39:26,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:39:26,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:39:26,734 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-20 06:39:26,734 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11 Second operand 8 states. [2020-10-20 06:39:26,978 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-20 06:39:26,979 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-20 06:39:26,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-20 06:39:26,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 44 transitions. [2020-10-20 06:39:26,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 44 transitions. Stem has 14 letters. Loop has 3 letters. [2020-10-20 06:39:26,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:39:26,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 44 transitions. Stem has 17 letters. Loop has 3 letters. [2020-10-20 06:39:26,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:39:26,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 44 transitions. Stem has 14 letters. Loop has 6 letters. [2020-10-20 06:39:26,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:39:26,981 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 119 transitions. [2020-10-20 06:39:26,984 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:39:26,984 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 44 states and 59 transitions. [2020-10-20 06:39:26,985 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-10-20 06:39:26,985 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2020-10-20 06:39:26,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 59 transitions. [2020-10-20 06:39:26,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:39:26,986 INFO L691 BuchiCegarLoop]: Abstraction has 44 states and 59 transitions. [2020-10-20 06:39:26,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 59 transitions. [2020-10-20 06:39:26,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 31. [2020-10-20 06:39:26,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-10-20 06:39:26,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2020-10-20 06:39:26,990 INFO L714 BuchiCegarLoop]: Abstraction has 31 states and 41 transitions. [2020-10-20 06:39:26,990 INFO L594 BuchiCegarLoop]: Abstraction has 31 states and 41 transitions. [2020-10-20 06:39:26,990 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-20 06:39:26,990 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 41 transitions. [2020-10-20 06:39:26,991 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-10-20 06:39:26,991 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:39:26,991 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:39:26,992 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:39:26,992 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-20 06:39:26,992 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-20 06:39:26,993 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-20 06:39:26,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:26,993 INFO L82 PathProgramCache]: Analyzing trace with hash 553598583, now seen corresponding path program 5 times [2020-10-20 06:39:26,993 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:26,994 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890316155] [2020-10-20 06:39:26,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:27,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:27,007 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:27,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:27,019 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:27,023 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:39:27,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:27,024 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 6 times [2020-10-20 06:39:27,024 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:27,025 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443452316] [2020-10-20 06:39:27,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:27,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:27,030 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:27,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:27,033 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:27,035 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:39:27,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:27,036 INFO L82 PathProgramCache]: Analyzing trace with hash -419005562, now seen corresponding path program 6 times [2020-10-20 06:39:27,036 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:39:27,036 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705611834] [2020-10-20 06:39:27,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:39:27,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:27,050 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:27,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:39:27,063 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:39:27,067 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:39:27,705 WARN L193 SmtUtils]: Spent 558.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 118 [2020-10-20 06:39:27,836 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2020-10-20 06:39:27,838 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:39:27,838 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:39:27,838 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:39:27,839 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:39:27,839 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:39:27,839 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:27,839 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:39:27,839 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:39:27,839 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubblesort-alloca-1.i_Iteration8_Lasso [2020-10-20 06:39:27,840 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:39:27,840 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:39:27,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:27,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:27,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:27,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:27,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:27,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:27,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:27,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:27,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:27,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:27,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:27,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:27,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:28,094 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2020-10-20 06:39:28,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:28,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:39:28,558 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:39:28,559 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-20 06:39:28,562 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:39:28,563 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:28,563 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:39:28,563 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:28,563 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:28,563 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:28,564 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:39:28,564 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:39:28,565 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) [2020-10-20 06:39:28,593 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:39:28,595 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:28,595 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:39:28,595 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:28,596 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:28,596 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:28,596 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:39:28,596 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:28,598 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:28,622 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:39:28,623 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:28,624 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:28,624 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:28,624 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:28,625 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:39:28,625 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:39:28,627 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-20 06:39:28,652 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:39:28,654 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:28,654 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:28,654 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:28,654 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:28,656 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:39:28,656 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:39:28,660 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) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:28,684 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:39:28,685 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:28,685 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:39:28,685 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:28,685 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:28,686 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:28,687 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:39:28,687 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:39:28,688 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) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:28,710 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:39:28,711 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:28,711 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:39:28,711 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:28,711 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:28,711 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:28,712 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:39:28,712 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:39:28,713 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) [2020-10-20 06:39:28,736 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:39:28,738 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:28,738 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:39:28,738 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:28,738 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:28,738 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:28,739 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:39:28,739 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:28,742 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-20 06:39:28,779 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:39:28,780 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:28,780 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:28,781 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:28,781 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:28,782 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:39:28,782 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:28,786 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 39 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 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:28,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-20 06:39:28,819 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:28,819 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:28,819 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:28,819 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:28,821 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:39:28,821 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:39:28,824 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-20 06:39:28,847 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:39:28,848 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:28,848 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:39:28,848 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:28,848 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:28,848 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:28,849 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:39:28,849 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:39:28,850 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) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:28,884 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:39:28,885 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:28,885 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:39:28,886 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:28,886 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:28,886 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:28,886 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:39:28,886 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:39:28,888 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-20 06:39:28,914 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:39:28,915 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:28,915 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:39:28,915 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:28,915 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:28,915 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:28,916 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:39:28,916 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:39:28,917 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 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 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:39:28,940 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:39:28,941 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:28,941 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:28,942 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:28,942 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:28,945 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:39:28,945 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:39:28,956 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-20 06:39:28,991 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 06:39:28,993 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:39:28,993 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:39:28,993 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:39:28,994 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:39:29,002 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:39:29,002 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:39:29,017 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:39:29,043 INFO L443 ModelExtractionUtils]: Simplification made 17 calls to the SMT solver. [2020-10-20 06:39:29,043 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-20 06:39:29,045 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 06:39:29,047 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 06:39:29,047 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:39:29,047 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_bubbleSort_~numbers.offset, ULTIMATE.start_bubbleSort_~j~0, v_rep(select #length ULTIMATE.start_bubbleSort_~numbers.base)_3) = -1*ULTIMATE.start_bubbleSort_~numbers.offset - 4*ULTIMATE.start_bubbleSort_~j~0 + 1*v_rep(select #length ULTIMATE.start_bubbleSort_~numbers.base)_3 Supporting invariants [] [2020-10-20 06:39:29,095 INFO L297 tatePredicateManager]: 10 out of 10 supporting invariants were superfluous and have been removed [2020-10-20 06:39:29,097 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-20 06:39:29,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:29,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:39:29,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:39:29,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:39:29,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:39:29,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 06:39:29,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:39:29,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:39:29,155 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-20 06:39:29,156 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 41 transitions. cyclomatic complexity: 12 Second operand 3 states. [2020-10-20 06:39:29,188 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-20 06:39:29,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-20 06:39:29,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 06:39:29,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2020-10-20 06:39:29,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 17 letters. Loop has 3 letters. [2020-10-20 06:39:29,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:39:29,191 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-20 06:39:29,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:29,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:39:29,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:39:29,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:39:29,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:39:29,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 06:39:29,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:39:29,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:39:29,237 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-20 06:39:29,237 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 41 transitions. cyclomatic complexity: 12 Second operand 3 states. [2020-10-20 06:39:29,261 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-20 06:39:29,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-20 06:39:29,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 06:39:29,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2020-10-20 06:39:29,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 17 letters. Loop has 3 letters. [2020-10-20 06:39:29,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:39:29,263 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-20 06:39:29,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:39:29,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:39:29,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:39:29,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:39:29,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:39:29,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 06:39:29,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:39:29,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:39:29,350 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-20 06:39:29,350 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 41 transitions. cyclomatic complexity: 12 Second operand 3 states. [2020-10-20 06:39:29,368 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-20 06:39:29,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-20 06:39:29,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 06:39:29,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2020-10-20 06:39:29,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 17 letters. Loop has 3 letters. [2020-10-20 06:39:29,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:39:29,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 20 letters. Loop has 3 letters. [2020-10-20 06:39:29,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:39:29,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 17 letters. Loop has 6 letters. [2020-10-20 06:39:29,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:39:29,370 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 68 transitions. [2020-10-20 06:39:29,371 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-20 06:39:29,371 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 0 states and 0 transitions. [2020-10-20 06:39:29,372 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-20 06:39:29,372 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-20 06:39:29,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-20 06:39:29,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:39:29,373 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 06:39:29,373 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 06:39:29,373 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 06:39:29,373 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-20 06:39:29,373 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-10-20 06:39:29,373 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-20 06:39:29,374 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-10-20 06:39:29,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.10 06:39:29 BoogieIcfgContainer [2020-10-20 06:39:29,380 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-20 06:39:29,380 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 06:39:29,380 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 06:39:29,380 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 06:39:29,381 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:39:19" (3/4) ... [2020-10-20 06:39:29,384 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-20 06:39:29,384 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 06:39:29,386 INFO L168 Benchmark]: Toolchain (without parser) took 10906.02 ms. Allocated memory was 34.6 MB in the beginning and 88.1 MB in the end (delta: 53.5 MB). Free memory was 10.8 MB in the beginning and 59.1 MB in the end (delta: -48.2 MB). Peak memory consumption was 5.3 MB. Max. memory is 14.3 GB. [2020-10-20 06:39:29,386 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 33.0 MB. Free memory was 18.1 MB in the beginning and 18.0 MB in the end (delta: 54.5 kB). Peak memory consumption was 54.5 kB. Max. memory is 14.3 GB. [2020-10-20 06:39:29,387 INFO L168 Benchmark]: CACSL2BoogieTranslator took 567.51 ms. Allocated memory was 34.6 MB in the beginning and 43.0 MB in the end (delta: 8.4 MB). Free memory was 10.0 MB in the beginning and 15.9 MB in the end (delta: -5.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 14.3 GB. [2020-10-20 06:39:29,388 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.55 ms. Allocated memory is still 43.0 MB. Free memory was 15.9 MB in the beginning and 25.7 MB in the end (delta: -9.8 MB). Peak memory consumption was 3.3 MB. Max. memory is 14.3 GB. [2020-10-20 06:39:29,388 INFO L168 Benchmark]: Boogie Preprocessor took 28.62 ms. Allocated memory is still 43.0 MB. Free memory was 25.7 MB in the beginning and 24.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 14.3 GB. [2020-10-20 06:39:29,389 INFO L168 Benchmark]: RCFGBuilder took 335.11 ms. Allocated memory was 43.0 MB in the beginning and 44.6 MB in the end (delta: 1.6 MB). Free memory was 24.2 MB in the beginning and 23.8 MB in the end (delta: 310.3 kB). Peak memory consumption was 13.5 MB. Max. memory is 14.3 GB. [2020-10-20 06:39:29,390 INFO L168 Benchmark]: BuchiAutomizer took 9901.41 ms. Allocated memory was 44.6 MB in the beginning and 88.1 MB in the end (delta: 43.5 MB). Free memory was 23.6 MB in the beginning and 59.1 MB in the end (delta: -35.5 MB). Peak memory consumption was 8.0 MB. Max. memory is 14.3 GB. [2020-10-20 06:39:29,390 INFO L168 Benchmark]: Witness Printer took 4.26 ms. Allocated memory is still 88.1 MB. Free memory is still 59.1 MB. There was no memory consumed. Max. memory is 14.3 GB. [2020-10-20 06:39:29,393 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.27 ms. Allocated memory is still 33.0 MB. Free memory was 18.1 MB in the beginning and 18.0 MB in the end (delta: 54.5 kB). Peak memory consumption was 54.5 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 567.51 ms. Allocated memory was 34.6 MB in the beginning and 43.0 MB in the end (delta: 8.4 MB). Free memory was 10.0 MB in the beginning and 15.9 MB in the end (delta: -5.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 59.55 ms. Allocated memory is still 43.0 MB. Free memory was 15.9 MB in the beginning and 25.7 MB in the end (delta: -9.8 MB). Peak memory consumption was 3.3 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 28.62 ms. Allocated memory is still 43.0 MB. Free memory was 25.7 MB in the beginning and 24.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 14.3 GB. * RCFGBuilder took 335.11 ms. Allocated memory was 43.0 MB in the beginning and 44.6 MB in the end (delta: 1.6 MB). Free memory was 24.2 MB in the beginning and 23.8 MB in the end (delta: 310.3 kB). Peak memory consumption was 13.5 MB. Max. memory is 14.3 GB. * BuchiAutomizer took 9901.41 ms. Allocated memory was 44.6 MB in the beginning and 88.1 MB in the end (delta: 43.5 MB). Free memory was 23.6 MB in the beginning and 59.1 MB in the end (delta: -35.5 MB). Peak memory consumption was 8.0 MB. Max. memory is 14.3 GB. * Witness Printer took 4.26 ms. Allocated memory is still 88.1 MB. Free memory is still 59.1 MB. There was no memory consumed. Max. memory is 14.3 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 9 * unknown-#length-unknown[numbers] + -16 * j 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 + -4 * j + unknown-#length-unknown[numbers] 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.8s and 9 iterations. TraceHistogramMax:3. Analysis of lassos took 7.7s. Construction of modules took 0.2s. Büchi inclusion checks took 1.6s. 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.2s 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: 20ms 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...