./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/selectionsort-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: 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 /storage/repos/svcomp/c/termination-memory-alloca/selectionsort-alloca_true-termination.c.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 7a61d79c4ca9451b26ba6dc1b90600e9ebfec9cf .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 02:36:35,573 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:36:35,574 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:36:35,586 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:36:35,586 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:36:35,587 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:36:35,588 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:36:35,590 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:36:35,595 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:36:35,596 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:36:35,600 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:36:35,602 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:36:35,603 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:36:35,604 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:36:35,605 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:36:35,606 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:36:35,606 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:36:35,610 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:36:35,617 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:36:35,621 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:36:35,622 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:36:35,623 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:36:35,631 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:36:35,631 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:36:35,632 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:36:35,637 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:36:35,638 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:36:35,639 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:36:35,639 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:36:35,640 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:36:35,640 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:36:35,641 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:36:35,641 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:36:35,641 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:36:35,642 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:36:35,643 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:36:35,643 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-14 02:36:35,659 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:36:35,659 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:36:35,660 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:36:35,661 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:36:35,661 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:36:35,661 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:36:35,661 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:36:35,661 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:36:35,661 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:36:35,662 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:36:35,662 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:36:35,662 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:36:35,662 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:36:35,662 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:36:35,662 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:36:35,662 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:36:35,663 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:36:35,663 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:36:35,663 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:36:35,663 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:36:35,663 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:36:35,663 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:36:35,664 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:36:35,664 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:36:35,664 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:36:35,664 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:36:35,664 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:36:35,664 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:36:35,668 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:36:35,669 INFO L133 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 -> 7a61d79c4ca9451b26ba6dc1b90600e9ebfec9cf [2019-01-14 02:36:35,712 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:36:35,724 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:36:35,727 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:36:35,729 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:36:35,729 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:36:35,730 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/selectionsort-alloca_true-termination.c.i [2019-01-14 02:36:35,783 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b71b18f6d/75b50c8beef144fb9b54b50ffa983d5c/FLAG24ea82dfb [2019-01-14 02:36:36,249 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:36:36,249 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/selectionsort-alloca_true-termination.c.i [2019-01-14 02:36:36,265 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b71b18f6d/75b50c8beef144fb9b54b50ffa983d5c/FLAG24ea82dfb [2019-01-14 02:36:36,586 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b71b18f6d/75b50c8beef144fb9b54b50ffa983d5c [2019-01-14 02:36:36,589 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:36:36,590 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:36:36,591 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:36:36,591 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:36:36,595 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:36:36,595 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:36:36" (1/1) ... [2019-01-14 02:36:36,598 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ef8f381 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:36:36, skipping insertion in model container [2019-01-14 02:36:36,598 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:36:36" (1/1) ... [2019-01-14 02:36:36,606 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:36:36,667 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:36:37,078 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:36:37,090 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:36:37,229 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:36:37,290 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:36:37,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:36:37 WrapperNode [2019-01-14 02:36:37,290 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:36:37,291 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:36:37,291 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:36:37,291 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:36:37,300 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:36:37" (1/1) ... [2019-01-14 02:36:37,316 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:36:37" (1/1) ... [2019-01-14 02:36:37,335 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:36:37,336 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:36:37,336 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:36:37,336 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:36:37,343 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:36:37" (1/1) ... [2019-01-14 02:36:37,344 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:36:37" (1/1) ... [2019-01-14 02:36:37,347 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:36:37" (1/1) ... [2019-01-14 02:36:37,347 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:36:37" (1/1) ... [2019-01-14 02:36:37,357 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:36:37" (1/1) ... [2019-01-14 02:36:37,362 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:36:37" (1/1) ... [2019-01-14 02:36:37,364 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:36:37" (1/1) ... [2019-01-14 02:36:37,373 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:36:37,373 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:36:37,374 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:36:37,374 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:36:37,374 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:36:37" (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-01-14 02:36:37,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 02:36:37,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 02:36:37,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 02:36:37,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 02:36:37,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:36:37,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:36:37,778 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:36:37,778 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-14 02:36:37,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:36:37 BoogieIcfgContainer [2019-01-14 02:36:37,779 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:36:37,780 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:36:37,780 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:36:37,784 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:36:37,785 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:36:37,785 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:36:36" (1/3) ... [2019-01-14 02:36:37,786 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3401abb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:36:37, skipping insertion in model container [2019-01-14 02:36:37,786 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:36:37,786 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:36:37" (2/3) ... [2019-01-14 02:36:37,787 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3401abb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:36:37, skipping insertion in model container [2019-01-14 02:36:37,787 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:36:37,787 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:36:37" (3/3) ... [2019-01-14 02:36:37,789 INFO L375 chiAutomizerObserver]: Analyzing ICFG selectionsort-alloca_true-termination.c.i [2019-01-14 02:36:37,840 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:36:37,841 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:36:37,841 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:36:37,841 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:36:37,841 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:36:37,842 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:36:37,842 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:36:37,842 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:36:37,842 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:36:37,854 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-01-14 02:36:37,873 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-14 02:36:37,873 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:36:37,873 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:36:37,879 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-14 02:36:37,879 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 02:36:37,879 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:36:37,879 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-01-14 02:36:37,881 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-14 02:36:37,881 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:36:37,881 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:36:37,882 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-14 02:36:37,882 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 02:36:37,890 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 7#L566true assume !(main_~array_size~0 < 1); 9#L566-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;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 4#L550-3true [2019-01-14 02:36:37,891 INFO L796 eck$LassoCheckResult]: Loop: 4#L550-3true assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 12#L554-3true assume !true; 14#L554-4true call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6;call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4);call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);havoc SelectionSort_#t~mem7;call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 3#L550-2true SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 4#L550-3true [2019-01-14 02:36:37,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:36:37,897 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-01-14 02:36:37,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:36:37,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:36:37,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:36:37,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:36:37,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:36:37,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:36:38,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:36:38,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:36:38,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1463796, now seen corresponding path program 1 times [2019-01-14 02:36:38,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:36:38,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:36:38,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:36:38,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:36:38,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:36:38,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:36:38,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:36:38,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:36:38,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 02:36:38,077 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:36:38,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-14 02:36:38,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-14 02:36:38,096 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 2 states. [2019-01-14 02:36:38,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:36:38,102 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2019-01-14 02:36:38,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 02:36:38,104 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2019-01-14 02:36:38,105 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-14 02:36:38,109 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 13 transitions. [2019-01-14 02:36:38,110 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-14 02:36:38,111 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-14 02:36:38,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2019-01-14 02:36:38,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:36:38,112 INFO L706 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-14 02:36:38,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2019-01-14 02:36:38,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-01-14 02:36:38,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-14 02:36:38,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-01-14 02:36:38,143 INFO L729 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-14 02:36:38,144 INFO L609 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-14 02:36:38,145 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:36:38,145 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2019-01-14 02:36:38,146 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-14 02:36:38,148 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:36:38,148 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:36:38,148 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-14 02:36:38,148 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 02:36:38,148 INFO L794 eck$LassoCheckResult]: Stem: 41#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 38#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; 39#L566 assume !(main_~array_size~0 < 1); 40#L566-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;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 37#L550-3 [2019-01-14 02:36:38,149 INFO L796 eck$LassoCheckResult]: Loop: 37#L550-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 42#L554-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 44#L554-4 call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6;call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4);call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);havoc SelectionSort_#t~mem7;call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 36#L550-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 37#L550-3 [2019-01-14 02:36:38,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:36:38,149 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2019-01-14 02:36:38,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:36:38,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:36:38,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:36:38,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:36:38,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:36:38,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:36:38,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:36:38,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:36:38,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1453225, now seen corresponding path program 1 times [2019-01-14 02:36:38,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:36:38,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:36:38,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:36:38,189 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:36:38,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:36:38,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:36:38,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:36:38,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:36:38,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 02:36:38,250 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:36:38,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:36:38,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:36:38,251 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-01-14 02:36:38,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:36:38,336 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2019-01-14 02:36:38,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:36:38,338 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 14 transitions. [2019-01-14 02:36:38,339 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-14 02:36:38,340 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 14 transitions. [2019-01-14 02:36:38,340 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-01-14 02:36:38,340 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-14 02:36:38,341 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2019-01-14 02:36:38,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:36:38,341 INFO L706 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-01-14 02:36:38,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2019-01-14 02:36:38,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-14 02:36:38,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-14 02:36:38,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2019-01-14 02:36:38,343 INFO L729 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-01-14 02:36:38,343 INFO L609 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-01-14 02:36:38,343 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:36:38,343 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2019-01-14 02:36:38,345 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-14 02:36:38,346 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:36:38,346 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:36:38,346 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-14 02:36:38,346 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:36:38,347 INFO L794 eck$LassoCheckResult]: Stem: 68#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 63#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; 64#L566 assume !(main_~array_size~0 < 1); 65#L566-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;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 66#L550-3 [2019-01-14 02:36:38,347 INFO L796 eck$LassoCheckResult]: Loop: 66#L550-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 69#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 72#L556 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 70#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 71#L554-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 73#L554-4 call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6;call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4);call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);havoc SelectionSort_#t~mem7;call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 67#L550-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 66#L550-3 [2019-01-14 02:36:38,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:36:38,347 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 3 times [2019-01-14 02:36:38,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:36:38,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:36:38,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:36:38,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:36:38,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:36:38,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:36:38,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:36:38,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:36:38,387 INFO L82 PathProgramCache]: Analyzing trace with hash 393067660, now seen corresponding path program 1 times [2019-01-14 02:36:38,388 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:36:38,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:36:38,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:36:38,391 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:36:38,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:36:38,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:36:38,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:36:38,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:36:38,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1419424808, now seen corresponding path program 1 times [2019-01-14 02:36:38,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:36:38,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:36:38,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:36:38,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:36:38,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:36:38,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:36:38,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:36:38,901 WARN L181 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-01-14 02:36:39,094 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-01-14 02:36:39,271 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-01-14 02:36:39,379 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-01-14 02:36:39,392 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:36:39,393 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:36:39,393 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:36:39,394 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:36:39,394 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:36:39,394 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:36:39,394 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:36:39,394 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:36:39,394 INFO L131 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca_true-termination.c.i_Iteration3_Lasso [2019-01-14 02:36:39,395 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:36:39,395 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:36:39,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:39,893 WARN L181 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-01-14 02:36:39,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:39,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:39,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:39,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:39,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:40,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:40,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:40,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:40,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:40,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:40,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:40,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:40,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:40,657 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:36:40,663 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:36:40,665 INFO L122 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-01-14 02:36:40,667 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:36:40,667 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:36:40,668 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:36:40,668 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:36:40,673 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:36:40,674 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:36:40,689 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:36:40,689 INFO L122 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-01-14 02:36:40,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:36:40,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:36:40,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:36:40,691 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:36:40,702 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:36:40,702 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:36:40,784 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:36:40,865 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-14 02:36:40,865 INFO L444 ModelExtractionUtils]: 33 out of 40 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-01-14 02:36:40,868 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:36:40,869 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:36:40,871 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:36:40,872 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~i~0, ULTIMATE.start_SelectionSort_~a.offset, v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_1) = -4*ULTIMATE.start_SelectionSort_~i~0 - 1*ULTIMATE.start_SelectionSort_~a.offset + 1*v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_1 Supporting invariants [] [2019-01-14 02:36:40,953 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-01-14 02:36:40,968 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 02:36:40,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:36:41,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:36:41,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:36:41,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:36:41,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:36:41,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:36:41,140 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-14 02:36:41,141 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4 Second operand 4 states. [2019-01-14 02:36:41,333 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 18 states and 24 transitions. Complement of second has 6 states. [2019-01-14 02:36:41,334 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-01-14 02:36:41,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:36:41,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2019-01-14 02:36:41,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 4 letters. Loop has 7 letters. [2019-01-14 02:36:41,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:36:41,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 11 letters. Loop has 7 letters. [2019-01-14 02:36:41,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:36:41,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 4 letters. Loop has 14 letters. [2019-01-14 02:36:41,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:36:41,339 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 24 transitions. [2019-01-14 02:36:41,340 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:36:41,341 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 16 states and 22 transitions. [2019-01-14 02:36:41,341 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-01-14 02:36:41,341 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-01-14 02:36:41,341 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2019-01-14 02:36:41,342 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:36:41,342 INFO L706 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-01-14 02:36:41,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2019-01-14 02:36:41,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-01-14 02:36:41,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-14 02:36:41,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2019-01-14 02:36:41,344 INFO L729 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2019-01-14 02:36:41,344 INFO L609 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2019-01-14 02:36:41,344 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:36:41,345 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 21 transitions. [2019-01-14 02:36:41,345 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:36:41,345 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:36:41,345 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:36:41,346 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 02:36:41,346 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:36:41,346 INFO L794 eck$LassoCheckResult]: Stem: 170#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 164#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; 165#L566 assume !(main_~array_size~0 < 1); 166#L566-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;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 167#L550-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 168#L554-3 [2019-01-14 02:36:41,346 INFO L796 eck$LassoCheckResult]: Loop: 168#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 174#L556 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 171#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 168#L554-3 [2019-01-14 02:36:41,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:36:41,347 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2019-01-14 02:36:41,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:36:41,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:36:41,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:36:41,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:36:41,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:36:41,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:36:41,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:36:41,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:36:41,363 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 1 times [2019-01-14 02:36:41,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:36:41,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:36:41,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:36:41,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:36:41,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:36:41,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:36:41,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:36:41,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:36:41,376 INFO L82 PathProgramCache]: Analyzing trace with hash 176800017, now seen corresponding path program 1 times [2019-01-14 02:36:41,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:36:41,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:36:41,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:36:41,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:36:41,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:36:41,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:36:41,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:36:41,656 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-01-14 02:36:41,722 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:36:41,723 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:36:41,723 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:36:41,723 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:36:41,723 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:36:41,724 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:36:41,724 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:36:41,724 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:36:41,724 INFO L131 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca_true-termination.c.i_Iteration4_Lasso [2019-01-14 02:36:41,724 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:36:41,725 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:36:41,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:41,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:41,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:41,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:41,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:41,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:41,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:41,913 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-01-14 02:36:42,106 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2019-01-14 02:36:42,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:42,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:42,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:42,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:42,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:42,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:42,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:42,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:42,377 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-14 02:36:42,791 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-01-14 02:36:42,825 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:36:42,825 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:36:42,826 INFO L122 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-01-14 02:36:42,826 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:36:42,827 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:36:42,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:36:42,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:36:42,827 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:36:42,828 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:36:42,828 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:36:42,829 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:36:42,829 INFO L122 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-01-14 02:36:42,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:36:42,830 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:36:42,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:36:42,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:36:42,830 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:36:42,830 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:36:42,831 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:36:42,831 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:36:42,832 INFO L122 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-01-14 02:36:42,832 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:36:42,832 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:36:42,832 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:36:42,832 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:36:42,833 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:36:42,833 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:36:42,833 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:36:42,833 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:36:42,834 INFO L122 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-01-14 02:36:42,834 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:36:42,834 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:36:42,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:36:42,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:36:42,835 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:36:42,835 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:36:42,835 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:36:42,836 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:36:42,836 INFO L122 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-01-14 02:36:42,837 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:36:42,837 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:36:42,837 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:36:42,837 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:36:42,838 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:36:42,838 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:36:42,841 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:36:42,841 INFO L122 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-01-14 02:36:42,842 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:36:42,842 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:36:42,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:36:42,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:36:42,842 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:36:42,842 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:36:42,843 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:36:42,843 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:36:42,844 INFO L122 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-01-14 02:36:42,844 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:36:42,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:36:42,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:36:42,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:36:42,846 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:36:42,846 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:36:42,854 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:36:42,855 INFO L122 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-01-14 02:36:42,855 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:36:42,855 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:36:42,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:36:42,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:36:42,856 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:36:42,856 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:36:42,856 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:36:42,859 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:36:42,859 INFO L122 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-01-14 02:36:42,859 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:36:42,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:36:42,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:36:42,860 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:36:42,872 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:36:42,872 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:36:42,935 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:36:42,975 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-14 02:36:42,975 INFO L444 ModelExtractionUtils]: 33 out of 40 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-14 02:36:42,976 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:36:42,978 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:36:42,979 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:36:42,979 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~j~0, ULTIMATE.start_SelectionSort_~array_size) = -1*ULTIMATE.start_SelectionSort_~j~0 + 1*ULTIMATE.start_SelectionSort_~array_size Supporting invariants [] [2019-01-14 02:36:43,095 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-01-14 02:36:43,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:36:43,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:36:43,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:36:43,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:36:43,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:36:43,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:36:43,448 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-01-14 02:36:43,448 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-01-14 02:36:43,476 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 33 states and 47 transitions. Complement of second has 7 states. [2019-01-14 02:36:43,479 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-01-14 02:36:43,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:36:43,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2019-01-14 02:36:43,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 5 letters. Loop has 3 letters. [2019-01-14 02:36:43,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:36:43,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 8 letters. Loop has 3 letters. [2019-01-14 02:36:43,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:36:43,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 5 letters. Loop has 6 letters. [2019-01-14 02:36:43,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:36:43,481 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 47 transitions. [2019-01-14 02:36:43,484 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:36:43,485 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 22 states and 30 transitions. [2019-01-14 02:36:43,485 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-01-14 02:36:43,485 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-01-14 02:36:43,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2019-01-14 02:36:43,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:36:43,485 INFO L706 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2019-01-14 02:36:43,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2019-01-14 02:36:43,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 15. [2019-01-14 02:36:43,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-14 02:36:43,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2019-01-14 02:36:43,489 INFO L729 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-01-14 02:36:43,489 INFO L609 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-01-14 02:36:43,489 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 02:36:43,489 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2019-01-14 02:36:43,489 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:36:43,490 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:36:43,491 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:36:43,492 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:36:43,492 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:36:43,492 INFO L794 eck$LassoCheckResult]: Stem: 282#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 276#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; 277#L566 assume !(main_~array_size~0 < 1); 278#L566-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;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 279#L550-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 280#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 287#L556 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 284#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 285#L554-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 288#L554-4 call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6;call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4);call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);havoc SelectionSort_#t~mem7;call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 274#L550-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 275#L550-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 281#L554-3 [2019-01-14 02:36:43,492 INFO L796 eck$LassoCheckResult]: Loop: 281#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 286#L556 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 283#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 281#L554-3 [2019-01-14 02:36:43,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:36:43,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1109754407, now seen corresponding path program 1 times [2019-01-14 02:36:43,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:36:43,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:36:43,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:36:43,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:36:43,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:36:43,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:36:43,600 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:36:43,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:36:43,601 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 02:36:43,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:36:43,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:36:43,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:36:43,635 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:36:43,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:36:43,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-01-14 02:36:43,655 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:36:43,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:36:43,655 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 2 times [2019-01-14 02:36:43,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:36:43,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:36:43,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:36:43,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:36:43,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:36:43,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:36:43,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:36:43,812 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-01-14 02:36:43,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 02:36:43,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 02:36:43,842 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 6 states. [2019-01-14 02:36:43,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:36:43,934 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2019-01-14 02:36:43,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 02:36:43,935 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 38 transitions. [2019-01-14 02:36:43,937 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:36:43,939 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 26 states and 35 transitions. [2019-01-14 02:36:43,939 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-01-14 02:36:43,939 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-01-14 02:36:43,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 35 transitions. [2019-01-14 02:36:43,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:36:43,940 INFO L706 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2019-01-14 02:36:43,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 35 transitions. [2019-01-14 02:36:43,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 18. [2019-01-14 02:36:43,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-14 02:36:43,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2019-01-14 02:36:43,943 INFO L729 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2019-01-14 02:36:43,943 INFO L609 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2019-01-14 02:36:43,943 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 02:36:43,943 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. [2019-01-14 02:36:43,946 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:36:43,946 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:36:43,946 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:36:43,947 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:36:43,947 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:36:43,947 INFO L794 eck$LassoCheckResult]: Stem: 370#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 364#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; 365#L566 assume !(main_~array_size~0 < 1); 366#L566-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;SelectionSort_#in~a.base, SelectionSort_#in~a.offset, SelectionSort_#in~array_size := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc SelectionSort_#t~mem4, SelectionSort_#t~mem5, SelectionSort_#t~pre3, SelectionSort_#t~mem6, SelectionSort_#t~mem7, SelectionSort_#t~pre2, SelectionSort_~j~0, SelectionSort_~min~0, SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset, SelectionSort_~array_size, SelectionSort_~i~0;SelectionSort_~a.base, SelectionSort_~a.offset := SelectionSort_#in~a.base, SelectionSort_#in~a.offset;SelectionSort_~array_size := SelectionSort_#in~array_size;havoc SelectionSort_~i~0;SelectionSort_~i~0 := 0; 367#L550-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 371#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 381#L556 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 374#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 375#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 377#L556 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 378#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 380#L554-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 379#L554-4 call SelectionSort_#t~mem6 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);SelectionSort_~temp~0 := SelectionSort_#t~mem6;havoc SelectionSort_#t~mem6;call SelectionSort_#t~mem7 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4);call write~int(SelectionSort_#t~mem7, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~i~0, 4);havoc SelectionSort_#t~mem7;call write~int(SelectionSort_~temp~0, SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 368#L550-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 369#L550-3 assume !!(SelectionSort_~i~0 < SelectionSort_~array_size - 1);havoc SelectionSort_~j~0;havoc SelectionSort_~min~0;havoc SelectionSort_~temp~0;SelectionSort_~min~0 := SelectionSort_~i~0;SelectionSort_~j~0 := 1 + SelectionSort_~i~0; 372#L554-3 [2019-01-14 02:36:43,947 INFO L796 eck$LassoCheckResult]: Loop: 372#L554-3 assume !!(SelectionSort_~j~0 < SelectionSort_~array_size);call SelectionSort_#t~mem4 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~j~0, 4);call SelectionSort_#t~mem5 := read~int(SelectionSort_~a.base, SelectionSort_~a.offset + 4 * SelectionSort_~min~0, 4); 376#L556 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 373#L554-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 372#L554-3 [2019-01-14 02:36:43,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:36:43,947 INFO L82 PathProgramCache]: Analyzing trace with hash -366799804, now seen corresponding path program 2 times [2019-01-14 02:36:43,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:36:43,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:36:43,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:36:43,949 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:36:43,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:36:43,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:36:43,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:36:43,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:36:43,992 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 3 times [2019-01-14 02:36:43,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:36:43,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:36:43,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:36:43,993 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:36:43,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:36:43,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:36:44,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:36:44,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:36:44,012 INFO L82 PathProgramCache]: Analyzing trace with hash -936135015, now seen corresponding path program 1 times [2019-01-14 02:36:44,012 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:36:44,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:36:44,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:36:44,013 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:36:44,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:36:44,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:36:44,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:36:44,643 WARN L181 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 106 [2019-01-14 02:36:44,721 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:36:44,721 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:36:44,721 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:36:44,721 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:36:44,722 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:36:44,722 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:36:44,722 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:36:44,722 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:36:44,722 INFO L131 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca_true-termination.c.i_Iteration6_Lasso [2019-01-14 02:36:44,722 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:36:44,723 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:36:44,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:44,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:44,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:44,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:44,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:44,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:44,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:44,946 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2019-01-14 02:36:45,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:45,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:45,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:45,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:45,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:45,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-01-14 02:36:45,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:45,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:45,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:36:45,541 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:36:45,542 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:36:45,542 INFO L122 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-01-14 02:36:45,543 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:36:45,543 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:36:45,543 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:36:45,543 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:36:45,543 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:36:45,543 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:36:45,544 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:36:45,547 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:36:45,548 INFO L122 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-01-14 02:36:45,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:36:45,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:36:45,548 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:36:45,548 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:36:45,551 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:36:45,552 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:36:45,554 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:36:45,555 INFO L122 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-01-14 02:36:45,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:36:45,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:36:45,555 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:36:45,555 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:36:45,556 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:36:45,557 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:36:45,559 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:36:45,559 INFO L122 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-01-14 02:36:45,560 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:36:45,560 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:36:45,560 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:36:45,560 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:36:45,567 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:36:45,568 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:36:45,571 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:36:45,571 INFO L122 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-01-14 02:36:45,572 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:36:45,572 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:36:45,572 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:36:45,572 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:36:45,573 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:36:45,573 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:36:45,578 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:36:45,578 INFO L122 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-01-14 02:36:45,579 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:36:45,581 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:36:45,581 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:36:45,581 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:36:45,582 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:36:45,583 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:36:45,583 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:36:45,584 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:36:45,584 INFO L122 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-01-14 02:36:45,584 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:36:45,592 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:36:45,592 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:36:45,593 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:36:45,594 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:36:45,596 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:36:45,602 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:36:45,605 INFO L122 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-01-14 02:36:45,608 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:36:45,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:36:45,608 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:36:45,608 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:36:45,609 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:36:45,609 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:36:45,625 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:36:45,626 INFO L122 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-01-14 02:36:45,627 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:36:45,627 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-14 02:36:45,627 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:36:45,627 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:36:45,633 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 02:36:45,635 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:36:45,648 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:36:45,649 INFO L122 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-01-14 02:36:45,652 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:36:45,652 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:36:45,652 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:36:45,652 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:36:45,656 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:36:45,657 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:36:45,702 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:36:45,729 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-14 02:36:45,732 INFO L444 ModelExtractionUtils]: 21 out of 31 variables were initially zero. Simplification set additionally 7 variables to zero. [2019-01-14 02:36:45,733 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:36:45,734 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:36:45,736 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:36:45,736 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~j~0, ULTIMATE.start_SelectionSort_~array_size) = -1*ULTIMATE.start_SelectionSort_~j~0 + 1*ULTIMATE.start_SelectionSort_~array_size Supporting invariants [] [2019-01-14 02:36:45,822 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2019-01-14 02:36:45,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:36:45,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:36:45,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:36:45,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:36:45,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:36:45,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:36:45,885 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-01-14 02:36:45,885 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-01-14 02:36:45,914 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 35 states and 48 transitions. Complement of second has 7 states. [2019-01-14 02:36:45,918 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-01-14 02:36:45,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:36:45,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2019-01-14 02:36:45,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 15 letters. Loop has 3 letters. [2019-01-14 02:36:45,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:36:45,919 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:36:45,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:36:45,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:36:45,992 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:36:46,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:36:46,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:36:46,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:36:46,022 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 02:36:46,023 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-01-14 02:36:46,155 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 35 states and 48 transitions. Complement of second has 7 states. [2019-01-14 02:36:46,156 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-01-14 02:36:46,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:36:46,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2019-01-14 02:36:46,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 15 letters. Loop has 3 letters. [2019-01-14 02:36:46,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:36:46,157 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:36:46,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:36:46,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:36:46,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:36:46,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:36:46,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:36:46,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:36:46,318 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 02:36:46,319 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-01-14 02:36:46,338 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 28 states and 39 transitions. Complement of second has 6 states. [2019-01-14 02:36:46,339 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-01-14 02:36:46,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:36:46,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2019-01-14 02:36:46,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 15 letters. Loop has 3 letters. [2019-01-14 02:36:46,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:36:46,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 18 letters. Loop has 3 letters. [2019-01-14 02:36:46,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:36:46,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 15 letters. Loop has 6 letters. [2019-01-14 02:36:46,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:36:46,343 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 39 transitions. [2019-01-14 02:36:46,344 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:36:46,345 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 0 states and 0 transitions. [2019-01-14 02:36:46,345 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:36:46,345 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:36:46,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:36:46,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:36:46,346 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:36:46,346 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:36:46,346 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:36:46,347 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 02:36:46,349 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:36:46,349 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:36:46,349 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:36:46,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:36:46 BoogieIcfgContainer [2019-01-14 02:36:46,356 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:36:46,357 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:36:46,357 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:36:46,357 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:36:46,357 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:36:37" (3/4) ... [2019-01-14 02:36:46,362 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:36:46,363 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:36:46,364 INFO L168 Benchmark]: Toolchain (without parser) took 9774.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 209.7 MB). Free memory was 951.4 MB in the beginning and 805.0 MB in the end (delta: 146.3 MB). Peak memory consumption was 356.1 MB. Max. memory is 11.5 GB. [2019-01-14 02:36:46,365 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:36:46,365 INFO L168 Benchmark]: CACSL2BoogieTranslator took 699.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -158.1 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:36:46,366 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.71 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-01-14 02:36:46,367 INFO L168 Benchmark]: Boogie Preprocessor took 37.01 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-01-14 02:36:46,367 INFO L168 Benchmark]: RCFGBuilder took 406.11 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: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. [2019-01-14 02:36:46,369 INFO L168 Benchmark]: BuchiAutomizer took 8576.11 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 84.4 MB). Free memory was 1.1 GB in the beginning and 805.0 MB in the end (delta: 279.5 MB). Peak memory consumption was 363.9 MB. Max. memory is 11.5 GB. [2019-01-14 02:36:46,370 INFO L168 Benchmark]: Witness Printer took 6.35 ms. Allocated memory is still 1.2 GB. Free memory is still 805.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:36:46,375 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 699.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -158.1 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 44.71 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.01 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 406.11 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: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8576.11 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 84.4 MB). Free memory was 1.1 GB in the beginning and 805.0 MB in the end (delta: 279.5 MB). Peak memory consumption was 363.9 MB. Max. memory is 11.5 GB. * Witness Printer took 6.35 ms. Allocated memory is still 1.2 GB. Free memory is still 805.0 MB. 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -4 * i + -1 * a + unknown-#length-unknown[a] and consists of 4 locations. One deterministic module has affine ranking function -1 * j + array_size and consists of 4 locations. One nondeterministic module has affine ranking function -1 * j + array_size and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.5s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 6.9s. Construction of modules took 0.3s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 16 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 18 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/1 HoareTripleCheckerStatistics: 83 SDtfs, 78 SDslu, 39 SDs, 0 SdLazy, 94 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital176 mio100 ax110 hnf99 lsp86 ukn76 mio100 lsp66 div100 bol100 ite100 ukn100 eq170 hnf89 smp95 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 22ms VariablesStem: 5 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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...