./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/java_BubbleSort-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/java_BubbleSort-alloca-2.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 af6d3df1a288680024c52d2d61adb02fdd276fce .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 20:34:22,304 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:34:22,306 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:34:22,324 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:34:22,325 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:34:22,327 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:34:22,329 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:34:22,341 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:34:22,343 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:34:22,347 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:34:22,348 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:34:22,350 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:34:22,351 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:34:22,354 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:34:22,356 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:34:22,358 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:34:22,359 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:34:22,362 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:34:22,365 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:34:22,368 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:34:22,373 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:34:22,374 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:34:22,377 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:34:22,378 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:34:22,381 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:34:22,382 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:34:22,382 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:34:22,384 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:34:22,385 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:34:22,386 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:34:22,387 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:34:22,387 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:34:22,388 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:34:22,390 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:34:22,392 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:34:22,392 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:34:22,393 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:34:22,394 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:34:22,394 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:34:22,396 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:34:22,397 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:34:22,398 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-28 20:34:22,424 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:34:22,424 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:34:22,426 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:34:22,427 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:34:22,427 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:34:22,427 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 20:34:22,427 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 20:34:22,428 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 20:34:22,428 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 20:34:22,428 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 20:34:22,429 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 20:34:22,430 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:34:22,430 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:34:22,431 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:34:22,431 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:34:22,431 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 20:34:22,431 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 20:34:22,432 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 20:34:22,432 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 20:34:22,432 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 20:34:22,432 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:34:22,433 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 20:34:22,433 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:34:22,433 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:34:22,434 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 20:34:22,434 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:34:22,434 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:34:22,434 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:34:22,435 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 20:34:22,436 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 20:34:22,437 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 -> af6d3df1a288680024c52d2d61adb02fdd276fce [2019-11-28 20:34:22,739 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:34:22,753 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:34:22,756 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:34:22,758 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:34:22,759 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:34:22,759 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/java_BubbleSort-alloca-2.i [2019-11-28 20:34:22,821 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b802d1b5/3546be44aeb941f5b3b760d0007791b5/FLAG534c1a79e [2019-11-28 20:34:23,346 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:34:23,348 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/java_BubbleSort-alloca-2.i [2019-11-28 20:34:23,363 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b802d1b5/3546be44aeb941f5b3b760d0007791b5/FLAG534c1a79e [2019-11-28 20:34:23,632 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b802d1b5/3546be44aeb941f5b3b760d0007791b5 [2019-11-28 20:34:23,639 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:34:23,642 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 20:34:23,644 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:34:23,645 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:34:23,648 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:34:23,650 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:34:23" (1/1) ... [2019-11-28 20:34:23,653 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66bfba7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:23, skipping insertion in model container [2019-11-28 20:34:23,653 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:34:23" (1/1) ... [2019-11-28 20:34:23,662 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:34:23,716 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:34:24,114 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:34:24,129 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:34:24,208 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:34:24,269 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:34:24,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:24 WrapperNode [2019-11-28 20:34:24,270 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:34:24,271 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 20:34:24,272 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 20:34:24,272 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 20:34:24,282 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:24" (1/1) ... [2019-11-28 20:34:24,301 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:24" (1/1) ... [2019-11-28 20:34:24,323 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 20:34:24,324 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:34:24,324 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:34:24,324 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:34:24,334 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:24" (1/1) ... [2019-11-28 20:34:24,335 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:24" (1/1) ... [2019-11-28 20:34:24,338 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:24" (1/1) ... [2019-11-28 20:34:24,338 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:24" (1/1) ... [2019-11-28 20:34:24,345 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:24" (1/1) ... [2019-11-28 20:34:24,352 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:24" (1/1) ... [2019-11-28 20:34:24,354 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:24" (1/1) ... [2019-11-28 20:34:24,361 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:34:24,362 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:34:24,363 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:34:24,363 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:34:24,364 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:24" (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 [2019-11-28 20:34:24,423 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 20:34:24,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 20:34:24,423 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 20:34:24,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 20:34:24,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:34:24,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:34:24,677 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:34:24,677 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 20:34:24,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:34:24 BoogieIcfgContainer [2019-11-28 20:34:24,679 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:34:24,681 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 20:34:24,681 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 20:34:24,687 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 20:34:24,689 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:34:24,690 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 08:34:23" (1/3) ... [2019-11-28 20:34:24,692 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@451d11db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:34:24, skipping insertion in model container [2019-11-28 20:34:24,692 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:34:24,692 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:24" (2/3) ... [2019-11-28 20:34:24,694 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@451d11db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:34:24, skipping insertion in model container [2019-11-28 20:34:24,694 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:34:24,695 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:34:24" (3/3) ... [2019-11-28 20:34:24,697 INFO L371 chiAutomizerObserver]: Analyzing ICFG java_BubbleSort-alloca-2.i [2019-11-28 20:34:24,771 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 20:34:24,771 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 20:34:24,772 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 20:34:24,772 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:34:24,772 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:34:24,772 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 20:34:24,773 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:34:24,773 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 20:34:24,789 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-11-28 20:34:24,817 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 20:34:24,817 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:34:24,818 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:34:24,824 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-28 20:34:24,825 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 20:34:24,825 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 20:34:24,825 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-11-28 20:34:24,826 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 20:34:24,827 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:34:24,827 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:34:24,827 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-28 20:34:24,827 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 20:34:24,834 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 9#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 5#L558true assume !(main_~array_size~0 < 1); 8#L558-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;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 6#L550-3true [2019-11-28 20:34:24,834 INFO L796 eck$LassoCheckResult]: Loop: 6#L550-3true assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 3#L551-3true assume !true; 4#L550-2true sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 6#L550-3true [2019-11-28 20:34:24,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:24,840 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-11-28 20:34:24,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:24,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394649799] [2019-11-28 20:34:24,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:24,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:24,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:24,973 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:34:24,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:24,974 INFO L82 PathProgramCache]: Analyzing trace with hash 47218, now seen corresponding path program 1 times [2019-11-28 20:34:24,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:24,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364557535] [2019-11-28 20:34:24,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:24,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:34:25,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:34:25,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364557535] [2019-11-28 20:34:25,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:34:25,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:34:25,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241312269] [2019-11-28 20:34:25,016 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:34:25,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:34:25,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 20:34:25,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 20:34:25,034 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 2 states. [2019-11-28 20:34:25,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:34:25,041 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2019-11-28 20:34:25,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 20:34:25,044 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2019-11-28 20:34:25,045 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 20:34:25,050 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 9 states and 12 transitions. [2019-11-28 20:34:25,051 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-28 20:34:25,052 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-28 20:34:25,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 12 transitions. [2019-11-28 20:34:25,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:34:25,053 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2019-11-28 20:34:25,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 12 transitions. [2019-11-28 20:34:25,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-11-28 20:34:25,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-28 20:34:25,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2019-11-28 20:34:25,081 INFO L711 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2019-11-28 20:34:25,082 INFO L591 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2019-11-28 20:34:25,082 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 20:34:25,082 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 12 transitions. [2019-11-28 20:34:25,082 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 20:34:25,083 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:34:25,083 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:34:25,083 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-28 20:34:25,083 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 20:34:25,084 INFO L794 eck$LassoCheckResult]: Stem: 41#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#L558 assume !(main_~array_size~0 < 1); 40#L558-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;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 39#L550-3 [2019-11-28 20:34:25,084 INFO L796 eck$LassoCheckResult]: Loop: 39#L550-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 36#L551-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 37#L550-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 39#L550-3 [2019-11-28 20:34:25,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:25,085 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2019-11-28 20:34:25,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:25,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029454851] [2019-11-28 20:34:25,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:25,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:25,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:25,117 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:34:25,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:25,119 INFO L82 PathProgramCache]: Analyzing trace with hash 46877, now seen corresponding path program 1 times [2019-11-28 20:34:25,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:25,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605748391] [2019-11-28 20:34:25,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:25,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:34:25,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:34:25,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605748391] [2019-11-28 20:34:25,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:34:25,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:34:25,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283478116] [2019-11-28 20:34:25,162 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:34:25,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:34:25,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:34:25,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:34:25,163 INFO L87 Difference]: Start difference. First operand 9 states and 12 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-11-28 20:34:25,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:34:25,195 INFO L93 Difference]: Finished difference Result 10 states and 13 transitions. [2019-11-28 20:34:25,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:34:25,197 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 13 transitions. [2019-11-28 20:34:25,198 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-28 20:34:25,198 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 13 transitions. [2019-11-28 20:34:25,199 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-28 20:34:25,199 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-28 20:34:25,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2019-11-28 20:34:25,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:34:25,199 INFO L688 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-11-28 20:34:25,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2019-11-28 20:34:25,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-11-28 20:34:25,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-28 20:34:25,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-11-28 20:34:25,202 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-11-28 20:34:25,202 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-11-28 20:34:25,202 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 20:34:25,203 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2019-11-28 20:34:25,203 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-28 20:34:25,204 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:34:25,204 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:34:25,204 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-28 20:34:25,204 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-28 20:34:25,205 INFO L794 eck$LassoCheckResult]: Stem: 66#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 59#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; 60#L558 assume !(main_~array_size~0 < 1); 65#L558-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;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 64#L550-3 [2019-11-28 20:34:25,205 INFO L796 eck$LassoCheckResult]: Loop: 64#L550-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 61#L551-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 62#L552 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 67#L551-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 68#L551-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 63#L550-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 64#L550-3 [2019-11-28 20:34:25,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:25,206 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 3 times [2019-11-28 20:34:25,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:25,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279235013] [2019-11-28 20:34:25,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:25,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:25,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:25,229 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:34:25,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:25,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1398152922, now seen corresponding path program 1 times [2019-11-28 20:34:25,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:25,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068682399] [2019-11-28 20:34:25,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:25,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:25,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:25,264 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:34:25,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:25,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1893874754, now seen corresponding path program 1 times [2019-11-28 20:34:25,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:25,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476528361] [2019-11-28 20:34:25,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:25,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:25,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:25,340 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:34:25,499 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-11-28 20:34:25,700 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-11-28 20:34:25,794 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:34:25,796 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:34:25,796 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:34:25,796 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:34:25,797 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:34:25,797 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:25,797 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:34:25,797 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:34:25,798 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-2.i_Iteration3_Lasso [2019-11-28 20:34:25,798 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:34:25,798 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:34:25,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:25,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:25,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:25,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:25,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:25,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:26,003 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2019-11-28 20:34:26,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:26,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:26,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:26,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:26,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:26,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:26,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:26,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:26,446 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:34:26,452 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:34:26,468 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:26,473 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:26,473 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:34:26,474 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:26,475 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:26,475 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:26,478 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:34:26,479 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:26,485 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:34:26,504 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:26,507 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:26,508 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:34:26,508 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:26,508 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:26,508 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:26,509 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:34:26,510 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:26,513 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:34:26,531 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:26,533 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:26,534 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:34:26,534 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:26,534 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:26,534 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:26,535 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:34:26,536 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:26,540 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:34:26,558 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:26,561 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:26,561 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:26,561 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:26,561 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:26,569 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:26,569 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:34:26,574 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:26,587 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:26,590 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:26,591 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:34:26,591 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:26,591 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:26,591 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:26,593 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:34:26,593 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:34:26,596 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:34:26,614 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:26,615 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:26,616 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:34:26,616 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:26,616 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:26,616 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:26,617 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:34:26,617 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:26,621 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:26,634 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:26,636 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:26,636 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:26,636 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:26,636 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:26,649 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:26,649 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:34:26,658 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:34:26,680 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:26,681 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:26,682 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:26,682 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:26,682 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:26,687 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:26,687 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:34:26,694 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe 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 [2019-11-28 20:34:26,701 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:26,703 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:26,703 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:34:26,703 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:26,703 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:26,704 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:26,706 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:34:26,706 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:34:26,712 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 [2019-11-28 20:34:26,721 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:26,723 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:26,724 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:26,724 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:26,724 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:26,735 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:26,735 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:34:26,755 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:34:26,873 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2019-11-28 20:34:26,873 INFO L444 ModelExtractionUtils]: 19 out of 37 variables were initially zero. Simplification set additionally 13 variables to zero. 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 [2019-11-28 20:34:26,932 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:34:26,956 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-28 20:34:26,956 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:34:26,957 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_sort_~x.base)_1, ULTIMATE.start_sort_~pass~0) = 1*v_rep(select #length ULTIMATE.start_sort_~x.base)_1 - 2*ULTIMATE.start_sort_~pass~0 Supporting invariants [-2*ULTIMATE.start_sort_~n + 1*v_rep(select #length ULTIMATE.start_sort_~x.base)_1 >= 0] [2019-11-28 20:34:26,985 INFO L297 tatePredicateManager]: 4 out of 5 supporting invariants were superfluous and have been removed [2019-11-28 20:34:26,997 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 20:34:27,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:27,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:34:27,055 INFO L264 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 20:34:27,057 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:34:27,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:34:27,098 INFO L264 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 20:34:27,099 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:34:27,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 20:34:27,132 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-11-28 20:34:27,133 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand 4 states. [2019-11-28 20:34:27,218 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 16 states and 22 transitions. Complement of second has 5 states. [2019-11-28 20:34:27,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 20:34:27,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 20:34:27,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-11-28 20:34:27,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 4 letters. Loop has 6 letters. [2019-11-28 20:34:27,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:34:27,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 10 letters. Loop has 6 letters. [2019-11-28 20:34:27,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:34:27,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 4 letters. Loop has 12 letters. [2019-11-28 20:34:27,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:34:27,225 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 22 transitions. [2019-11-28 20:34:27,226 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 20:34:27,227 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 15 states and 21 transitions. [2019-11-28 20:34:27,227 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-28 20:34:27,227 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-28 20:34:27,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 21 transitions. [2019-11-28 20:34:27,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:34:27,228 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2019-11-28 20:34:27,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 21 transitions. [2019-11-28 20:34:27,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-11-28 20:34:27,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-28 20:34:27,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 20 transitions. [2019-11-28 20:34:27,231 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2019-11-28 20:34:27,231 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2019-11-28 20:34:27,231 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 20:34:27,231 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 20 transitions. [2019-11-28 20:34:27,232 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 20:34:27,233 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:34:27,233 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:34:27,235 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 20:34:27,235 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 20:34:27,235 INFO L794 eck$LassoCheckResult]: Stem: 173#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 165#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; 166#L558 assume !(main_~array_size~0 < 1); 171#L558-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;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 172#L550-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 167#L551-3 [2019-11-28 20:34:27,235 INFO L796 eck$LassoCheckResult]: Loop: 167#L551-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 168#L552 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 174#L551-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 167#L551-3 [2019-11-28 20:34:27,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:27,236 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2019-11-28 20:34:27,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:27,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764492891] [2019-11-28 20:34:27,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:27,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:27,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:27,283 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:34:27,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:27,284 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 1 times [2019-11-28 20:34:27,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:27,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329227788] [2019-11-28 20:34:27,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:27,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:27,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:27,302 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:34:27,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:27,303 INFO L82 PathProgramCache]: Analyzing trace with hash 176800017, now seen corresponding path program 1 times [2019-11-28 20:34:27,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:27,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953307734] [2019-11-28 20:34:27,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:27,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:27,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:27,364 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:34:27,587 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-11-28 20:34:27,640 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:34:27,640 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:34:27,640 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:34:27,640 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:34:27,640 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:34:27,641 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:27,641 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:34:27,641 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:34:27,641 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-2.i_Iteration4_Lasso [2019-11-28 20:34:27,641 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:34:27,641 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:34:27,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:27,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:27,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:27,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:27,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:27,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:27,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:27,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:27,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:27,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:27,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:27,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:27,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:27,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:28,155 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:34:28,158 INFO L489 LassoAnalysis]: Using template 'affine'. 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) [2019-11-28 20:34:28,172 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:28,173 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:28,174 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:34:28,174 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:28,174 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:28,174 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:28,177 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:34:28,177 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:28,179 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) [2019-11-28 20:34:28,196 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:28,198 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:28,199 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:34:28,199 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:28,199 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:28,199 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:28,200 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:34:28,200 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:28,203 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) [2019-11-28 20:34:28,219 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:28,221 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:28,221 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:28,221 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:28,222 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:28,224 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:28,224 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:28,229 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) [2019-11-28 20:34:28,245 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:28,247 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:28,248 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:28,248 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:28,248 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:28,253 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:28,254 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:28,261 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 [2019-11-28 20:34:28,277 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:28,281 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:28,281 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:28,281 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:28,281 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:28,288 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:28,288 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:34:28,297 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 [2019-11-28 20:34:28,305 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:28,308 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:28,308 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:28,308 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:28,308 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:28,320 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:28,321 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:34:28,339 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:34:28,415 INFO L443 ModelExtractionUtils]: Simplification made 24 calls to the SMT solver. [2019-11-28 20:34:28,415 INFO L444 ModelExtractionUtils]: 9 out of 37 variables were initially zero. Simplification set additionally 24 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:28,420 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:34:28,425 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 20:34:28,425 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:34:28,425 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~i~0, ULTIMATE.start_sort_~pass~0, ULTIMATE.start_sort_~n) = -1*ULTIMATE.start_sort_~i~0 - 1*ULTIMATE.start_sort_~pass~0 + 1*ULTIMATE.start_sort_~n Supporting invariants [] [2019-11-28 20:34:28,437 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-11-28 20:34:28,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:28,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:34:28,461 INFO L264 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:34:28,462 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:34:28,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:34:28,470 INFO L264 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:34:28,471 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:34:28,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:34:28,482 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 20:34:28,482 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 20 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-11-28 20:34:28,507 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 20 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 30 states and 44 transitions. Complement of second has 7 states. [2019-11-28 20:34:28,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 20:34:28,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 20:34:28,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-11-28 20:34:28,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 5 letters. Loop has 3 letters. [2019-11-28 20:34:28,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:34:28,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 3 letters. [2019-11-28 20:34:28,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:34:28,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 5 letters. Loop has 6 letters. [2019-11-28 20:34:28,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:34:28,510 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 44 transitions. [2019-11-28 20:34:28,513 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 20:34:28,514 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 20 states and 28 transitions. [2019-11-28 20:34:28,514 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-28 20:34:28,514 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-11-28 20:34:28,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 28 transitions. [2019-11-28 20:34:28,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:34:28,515 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2019-11-28 20:34:28,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 28 transitions. [2019-11-28 20:34:28,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. [2019-11-28 20:34:28,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-28 20:34:28,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2019-11-28 20:34:28,518 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-11-28 20:34:28,518 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-11-28 20:34:28,518 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 20:34:28,518 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2019-11-28 20:34:28,519 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 20:34:28,519 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:34:28,519 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:34:28,520 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:34:28,520 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 20:34:28,520 INFO L794 eck$LassoCheckResult]: Stem: 281#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 277#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; 278#L558 assume !(main_~array_size~0 < 1); 279#L558-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;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 280#L550-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 275#L551-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 276#L552 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem4;havoc sort_#t~mem5; 283#L551-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 284#L551-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 271#L550-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 272#L550-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 273#L551-3 [2019-11-28 20:34:28,521 INFO L796 eck$LassoCheckResult]: Loop: 273#L551-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 274#L552 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 282#L551-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 273#L551-3 [2019-11-28 20:34:28,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:28,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1421271829, now seen corresponding path program 1 times [2019-11-28 20:34:28,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:28,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707828033] [2019-11-28 20:34:28,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:28,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:34:28,579 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:34:28,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707828033] [2019-11-28 20:34:28,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809126874] [2019-11-28 20:34:28,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:34:28,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:34:28,640 INFO L264 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 20:34:28,643 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:34:28,663 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:34:28,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:34:28,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-11-28 20:34:28,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948139658] [2019-11-28 20:34:28,668 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 20:34:28,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:28,669 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 2 times [2019-11-28 20:34:28,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:28,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217293887] [2019-11-28 20:34:28,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:28,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:28,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:28,699 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:34:28,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:34:28,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 20:34:28,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:34:28,797 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand 7 states. [2019-11-28 20:34:28,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:34:28,868 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2019-11-28 20:34:28,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 20:34:28,870 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 36 transitions. [2019-11-28 20:34:28,871 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 20:34:28,874 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 25 states and 34 transitions. [2019-11-28 20:34:28,874 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-28 20:34:28,874 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-28 20:34:28,874 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 34 transitions. [2019-11-28 20:34:28,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:34:28,875 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2019-11-28 20:34:28,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 34 transitions. [2019-11-28 20:34:28,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2019-11-28 20:34:28,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 20:34:28,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2019-11-28 20:34:28,880 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-11-28 20:34:28,880 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-11-28 20:34:28,880 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 20:34:28,880 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2019-11-28 20:34:28,881 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 20:34:28,882 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:34:28,882 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:34:28,883 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-28 20:34:28,883 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 20:34:28,884 INFO L794 eck$LassoCheckResult]: Stem: 365#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 356#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; 357#L558 assume !(main_~array_size~0 < 1); 364#L558-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;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 366#L550-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 367#L551-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 369#L552 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem4;havoc sort_#t~mem5; 370#L551-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 360#L551-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 361#L552 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem4;havoc sort_#t~mem5; 372#L551-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 371#L551-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 362#L550-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 363#L550-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 358#L551-3 [2019-11-28 20:34:28,884 INFO L796 eck$LassoCheckResult]: Loop: 358#L551-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 359#L552 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 368#L551-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 358#L551-3 [2019-11-28 20:34:28,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:28,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1373641048, now seen corresponding path program 2 times [2019-11-28 20:34:28,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:28,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191588485] [2019-11-28 20:34:28,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:28,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:28,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:28,932 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:34:28,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:28,933 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 3 times [2019-11-28 20:34:28,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:28,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126124810] [2019-11-28 20:34:28,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:28,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:28,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:28,946 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:34:28,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:28,947 INFO L82 PathProgramCache]: Analyzing trace with hash -307910395, now seen corresponding path program 1 times [2019-11-28 20:34:28,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:28,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546782630] [2019-11-28 20:34:28,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:28,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:34:29,223 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:34:29,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546782630] [2019-11-28 20:34:29,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729333433] [2019-11-28 20:34:29,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:34:29,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:34:29,276 INFO L264 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 20:34:29,278 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:34:29,371 INFO L343 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-11-28 20:34:29,371 INFO L377 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 [2019-11-28 20:34:29,372 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:34:29,375 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:34:29,375 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:34:29,376 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2019-11-28 20:34:29,390 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 20:34:29,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:34:29,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2019-11-28 20:34:29,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590996896] [2019-11-28 20:34:29,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:34:29,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-28 20:34:29,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-11-28 20:34:29,476 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. cyclomatic complexity: 8 Second operand 15 states. [2019-11-28 20:34:29,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:34:29,637 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2019-11-28 20:34:29,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 20:34:29,638 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 50 transitions. [2019-11-28 20:34:29,640 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-28 20:34:29,642 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 50 transitions. [2019-11-28 20:34:29,642 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-11-28 20:34:29,642 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-11-28 20:34:29,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 50 transitions. [2019-11-28 20:34:29,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:34:29,643 INFO L688 BuchiCegarLoop]: Abstraction has 37 states and 50 transitions. [2019-11-28 20:34:29,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 50 transitions. [2019-11-28 20:34:29,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2019-11-28 20:34:29,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-28 20:34:29,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2019-11-28 20:34:29,647 INFO L711 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2019-11-28 20:34:29,647 INFO L591 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2019-11-28 20:34:29,647 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 20:34:29,647 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 35 transitions. [2019-11-28 20:34:29,648 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 20:34:29,648 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:34:29,648 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:34:29,649 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:34:29,649 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 20:34:29,650 INFO L794 eck$LassoCheckResult]: Stem: 494#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 486#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; 487#L558 assume !(main_~array_size~0 < 1); 488#L558-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;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 489#L550-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 490#L551-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 503#L552 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem4;havoc sort_#t~mem5; 499#L551-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 482#L551-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 483#L552 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 497#L551-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 502#L551-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 484#L550-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 485#L550-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 480#L551-3 [2019-11-28 20:34:29,650 INFO L796 eck$LassoCheckResult]: Loop: 480#L551-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 481#L552 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 496#L551-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 480#L551-3 [2019-11-28 20:34:29,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:29,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1371794006, now seen corresponding path program 2 times [2019-11-28 20:34:29,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:29,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857705221] [2019-11-28 20:34:29,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:29,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:29,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:29,680 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:34:29,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:29,681 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 4 times [2019-11-28 20:34:29,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:29,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290481348] [2019-11-28 20:34:29,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:29,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:29,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:29,693 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:34:29,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:29,694 INFO L82 PathProgramCache]: Analyzing trace with hash 501436231, now seen corresponding path program 3 times [2019-11-28 20:34:29,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:29,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430260773] [2019-11-28 20:34:29,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:29,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:29,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:29,733 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:34:30,268 WARN L192 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 97 [2019-11-28 20:34:30,374 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:34:30,374 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:34:30,374 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:34:30,374 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:34:30,374 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:34:30,374 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:30,374 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:34:30,374 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:34:30,375 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca-2.i_Iteration7_Lasso [2019-11-28 20:34:30,375 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:34:30,375 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:34:30,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:30,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:30,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:30,572 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-11-28 20:34:30,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:30,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:30,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:30,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:30,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:30,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:30,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:30,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:30,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:30,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:30,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:34:31,031 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:34:31,032 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:31,044 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:31,046 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:31,046 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:34:31,046 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:31,046 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:31,046 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:31,047 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:34:31,047 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:34:31,060 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:31,066 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:34:31,067 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:31,068 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:31,068 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:31,068 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:31,069 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:31,069 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:34:31,072 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:34:31,078 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:31,079 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:31,079 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:31,080 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:31,080 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:31,083 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:31,083 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:34:31,089 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) [2019-11-28 20:34:31,095 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:31,097 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:34:31,097 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:34:31,098 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:34:31,098 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:34:31,105 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 20:34:31,105 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 20:34:31,124 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:34:31,187 INFO L443 ModelExtractionUtils]: Simplification made 33 calls to the SMT solver. [2019-11-28 20:34:31,188 INFO L444 ModelExtractionUtils]: 5 out of 37 variables were initially zero. Simplification set additionally 28 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:31,192 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:34:31,194 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-28 20:34:31,195 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:34:31,195 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_sort_~x.base)_3, ULTIMATE.start_sort_~i~0) = 1*v_rep(select #length ULTIMATE.start_sort_~x.base)_3 - 4*ULTIMATE.start_sort_~i~0 Supporting invariants [1*ULTIMATE.start_sort_~x.offset >= 0] [2019-11-28 20:34:31,224 INFO L297 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2019-11-28 20:34:31,227 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 20:34:31,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:31,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:34:31,283 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 20:34:31,284 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:34:31,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:34:31,297 INFO L264 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 20:34:31,298 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:34:31,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:34:31,317 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-11-28 20:34:31,317 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-11-28 20:34:31,369 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 50 states and 70 transitions. Complement of second has 8 states. [2019-11-28 20:34:31,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 20:34:31,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 20:34:31,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2019-11-28 20:34:31,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 14 letters. Loop has 3 letters. [2019-11-28 20:34:31,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:34:31,370 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:34:31,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:31,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:34:31,409 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 20:34:31,410 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:34:31,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:34:31,423 INFO L264 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 20:34:31,424 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:34:31,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:34:31,438 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2019-11-28 20:34:31,438 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-11-28 20:34:31,475 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 50 states and 70 transitions. Complement of second has 8 states. [2019-11-28 20:34:31,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 20:34:31,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 20:34:31,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2019-11-28 20:34:31,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 14 letters. Loop has 3 letters. [2019-11-28 20:34:31,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:34:31,476 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 20:34:31,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:31,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:34:31,519 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 20:34:31,520 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:34:31,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:34:31,535 INFO L264 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 20:34:31,535 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:34:31,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:34:31,550 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-11-28 20:34:31,550 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-11-28 20:34:31,595 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 41 states and 58 transitions. Complement of second has 7 states. [2019-11-28 20:34:31,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 20:34:31,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 20:34:31,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2019-11-28 20:34:31,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 14 letters. Loop has 3 letters. [2019-11-28 20:34:31,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:34:31,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 17 letters. Loop has 3 letters. [2019-11-28 20:34:31,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:34:31,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 14 letters. Loop has 6 letters. [2019-11-28 20:34:31,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:34:31,598 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 58 transitions. [2019-11-28 20:34:31,599 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 20:34:31,600 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2019-11-28 20:34:31,600 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-28 20:34:31,600 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-28 20:34:31,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-28 20:34:31,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:34:31,601 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:34:31,601 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:34:31,601 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:34:31,601 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-28 20:34:31,601 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-28 20:34:31,601 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 20:34:31,601 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-28 20:34:31,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 08:34:31 BoogieIcfgContainer [2019-11-28 20:34:31,608 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 20:34:31,609 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 20:34:31,609 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 20:34:31,609 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 20:34:31,610 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:34:24" (3/4) ... [2019-11-28 20:34:31,614 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 20:34:31,614 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 20:34:31,616 INFO L168 Benchmark]: Toolchain (without parser) took 7975.49 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 301.5 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -94.6 MB). Peak memory consumption was 206.9 MB. Max. memory is 11.5 GB. [2019-11-28 20:34:31,616 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:34:31,617 INFO L168 Benchmark]: CACSL2BoogieTranslator took 626.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -170.4 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. [2019-11-28 20:34:31,618 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 20:34:31,618 INFO L168 Benchmark]: Boogie Preprocessor took 38.16 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:34:31,619 INFO L168 Benchmark]: RCFGBuilder took 317.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-28 20:34:31,620 INFO L168 Benchmark]: BuchiAutomizer took 6927.48 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 151.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.5 MB). Peak memory consumption was 197.0 MB. Max. memory is 11.5 GB. [2019-11-28 20:34:31,621 INFO L168 Benchmark]: Witness Printer took 5.27 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:34:31,624 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 626.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -170.4 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.16 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 317.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6927.48 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 151.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.5 MB). Peak memory consumption was 197.0 MB. Max. memory is 11.5 GB. * Witness Printer took 5.27 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[x] + -2 * pass and consists of 4 locations. One deterministic module has affine ranking function -1 * i + -1 * pass + n and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[x] + -4 * i and consists of 5 locations. 4 modules have a trivial ranking function, the largest among these consists of 15 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.8s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 5.6s. Construction of modules took 0.2s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 26 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 26 states and ocurred in iteration 6. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/1 HoareTripleCheckerStatistics: 87 SDtfs, 98 SDslu, 111 SDs, 0 SdLazy, 174 SolverSat, 35 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital193 mio100 ax109 hnf99 lsp88 ukn62 mio100 lsp64 div100 bol100 ite100 ukn100 eq178 hnf86 smp99 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 30ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...