./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 2e94e6aa 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-2e94e6a [2019-01-01 21:53:44,258 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:53:44,260 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:53:44,272 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:53:44,272 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:53:44,273 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:53:44,275 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:53:44,277 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:53:44,279 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:53:44,280 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:53:44,281 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:53:44,281 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:53:44,282 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:53:44,283 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:53:44,284 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:53:44,285 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:53:44,286 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:53:44,288 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:53:44,291 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:53:44,293 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:53:44,294 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:53:44,295 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:53:44,301 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:53:44,301 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:53:44,301 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:53:44,307 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:53:44,311 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:53:44,312 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:53:44,313 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:53:44,314 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:53:44,314 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:53:44,315 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:53:44,315 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:53:44,316 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:53:44,318 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:53:44,321 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:53:44,322 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 21:53:44,359 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:53:44,361 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:53:44,362 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:53:44,362 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:53:44,362 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:53:44,362 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:53:44,364 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:53:44,365 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:53:44,365 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:53:44,365 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:53:44,365 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:53:44,365 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:53:44,365 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:53:44,367 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:53:44,367 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:53:44,368 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:53:44,368 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:53:44,368 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:53:44,368 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:53:44,368 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:53:44,369 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:53:44,371 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:53:44,372 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:53:44,373 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:53:44,373 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:53:44,373 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:53:44,374 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:53:44,374 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:53:44,375 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:53:44,375 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-01 21:53:44,434 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:53:44,451 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:53:44,458 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:53:44,460 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:53:44,460 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:53:44,461 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/selectionsort-alloca_true-termination.c.i [2019-01-01 21:53:44,524 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f29887c2f/b513afa80307438f9bc777667b7e6d95/FLAG56499a295 [2019-01-01 21:53:45,021 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:53:45,023 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/selectionsort-alloca_true-termination.c.i [2019-01-01 21:53:45,050 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f29887c2f/b513afa80307438f9bc777667b7e6d95/FLAG56499a295 [2019-01-01 21:53:45,313 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f29887c2f/b513afa80307438f9bc777667b7e6d95 [2019-01-01 21:53:45,316 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:53:45,318 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:53:45,319 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:53:45,319 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:53:45,323 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:53:45,324 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:53:45" (1/1) ... [2019-01-01 21:53:45,327 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4327ac50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:53:45, skipping insertion in model container [2019-01-01 21:53:45,327 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:53:45" (1/1) ... [2019-01-01 21:53:45,335 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:53:45,379 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:53:45,793 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:53:45,810 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:53:45,943 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:53:46,007 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:53:46,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:53:46 WrapperNode [2019-01-01 21:53:46,009 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:53:46,010 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:53:46,010 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:53:46,010 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:53:46,020 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:53:46" (1/1) ... [2019-01-01 21:53:46,040 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:53:46" (1/1) ... [2019-01-01 21:53:46,066 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:53:46,067 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:53:46,067 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:53:46,067 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:53:46,078 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:53:46" (1/1) ... [2019-01-01 21:53:46,078 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:53:46" (1/1) ... [2019-01-01 21:53:46,086 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:53:46" (1/1) ... [2019-01-01 21:53:46,086 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:53:46" (1/1) ... [2019-01-01 21:53:46,099 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:53:46" (1/1) ... [2019-01-01 21:53:46,110 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:53:46" (1/1) ... [2019-01-01 21:53:46,111 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:53:46" (1/1) ... [2019-01-01 21:53:46,114 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:53:46,115 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:53:46,115 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:53:46,115 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:53:46,116 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:53:46" (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-01 21:53:46,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 21:53:46,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 21:53:46,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 21:53:46,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 21:53:46,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:53:46,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:53:46,540 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:53:46,540 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-01 21:53:46,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:53:46 BoogieIcfgContainer [2019-01-01 21:53:46,541 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:53:46,542 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:53:46,542 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:53:46,546 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:53:46,547 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:53:46,547 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:53:45" (1/3) ... [2019-01-01 21:53:46,548 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@71cb56f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:53:46, skipping insertion in model container [2019-01-01 21:53:46,548 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:53:46,548 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:53:46" (2/3) ... [2019-01-01 21:53:46,549 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@71cb56f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:53:46, skipping insertion in model container [2019-01-01 21:53:46,549 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:53:46,549 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:53:46" (3/3) ... [2019-01-01 21:53:46,551 INFO L375 chiAutomizerObserver]: Analyzing ICFG selectionsort-alloca_true-termination.c.i [2019-01-01 21:53:46,616 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:53:46,617 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:53:46,617 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:53:46,618 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:53:46,618 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:53:46,618 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:53:46,618 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:53:46,618 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:53:46,619 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:53:46,638 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-01-01 21:53:46,661 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-01 21:53:46,661 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:53:46,661 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:53:46,668 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 21:53:46,668 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 21:53:46,668 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:53:46,668 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-01-01 21:53:46,670 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-01 21:53:46,670 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:53:46,670 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:53:46,671 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 21:53:46,671 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 21:53:46,680 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-01 21:53:46,681 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-01 21:53:46,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:53:46,688 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-01-01 21:53:46,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:53:46,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:53:46,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:53:46,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:53:46,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:53:46,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:53:46,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:53:46,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:53:46,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1463796, now seen corresponding path program 1 times [2019-01-01 21:53:46,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:53:46,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:53:46,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:53:46,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:53:46,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:53:46,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:53:46,861 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-01 21:53:46,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:53:46,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 21:53:46,868 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 21:53:46,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-01 21:53:46,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-01 21:53:46,889 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 2 states. [2019-01-01 21:53:46,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:53:46,897 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2019-01-01 21:53:46,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-01 21:53:46,900 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2019-01-01 21:53:46,901 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-01 21:53:46,906 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 13 transitions. [2019-01-01 21:53:46,907 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-01 21:53:46,907 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-01 21:53:46,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2019-01-01 21:53:46,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:53:46,909 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-01 21:53:46,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2019-01-01 21:53:46,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-01-01 21:53:46,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-01 21:53:46,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-01-01 21:53:46,942 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-01 21:53:46,942 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-01 21:53:46,942 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:53:46,942 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2019-01-01 21:53:46,943 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-01 21:53:46,943 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:53:46,943 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:53:46,944 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 21:53:46,944 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 21:53:46,944 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-01 21:53:46,944 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-01 21:53:46,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:53:46,946 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2019-01-01 21:53:46,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:53:46,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:53:46,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:53:46,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:53:46,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:53:46,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:53:46,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:53:46,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:53:46,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1453225, now seen corresponding path program 1 times [2019-01-01 21:53:46,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:53:46,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:53:46,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:53:46,998 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:53:46,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:53:47,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:53:47,062 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-01 21:53:47,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:53:47,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 21:53:47,063 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 21:53:47,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 21:53:47,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 21:53:47,063 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-01-01 21:53:47,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:53:47,119 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2019-01-01 21:53:47,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 21:53:47,120 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 14 transitions. [2019-01-01 21:53:47,121 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-01 21:53:47,122 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 14 transitions. [2019-01-01 21:53:47,122 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-01-01 21:53:47,122 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-01 21:53:47,122 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2019-01-01 21:53:47,123 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:53:47,123 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-01-01 21:53:47,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2019-01-01 21:53:47,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-01 21:53:47,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-01 21:53:47,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2019-01-01 21:53:47,126 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-01-01 21:53:47,126 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-01-01 21:53:47,126 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:53:47,126 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2019-01-01 21:53:47,127 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-01 21:53:47,128 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:53:47,128 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:53:47,128 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 21:53:47,128 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:53:47,129 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-01 21:53:47,129 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~mem5;havoc SelectionSort_#t~mem4;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-01 21:53:47,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:53:47,129 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 3 times [2019-01-01 21:53:47,129 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:53:47,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:53:47,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:53:47,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:53:47,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:53:47,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:53:47,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:53:47,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:53:47,150 INFO L82 PathProgramCache]: Analyzing trace with hash 393067660, now seen corresponding path program 1 times [2019-01-01 21:53:47,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:53:47,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:53:47,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:53:47,152 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:53:47,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:53:47,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:53:47,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:53:47,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:53:47,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1419424808, now seen corresponding path program 1 times [2019-01-01 21:53:47,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:53:47,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:53:47,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:53:47,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:53:47,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:53:47,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:53:47,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:53:47,773 WARN L181 SmtUtils]: Spent 509.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-01-01 21:53:48,041 WARN L181 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-01-01 21:53:48,225 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-01-01 21:53:48,351 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-01-01 21:53:48,368 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:53:48,369 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:53:48,370 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:53:48,370 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:53:48,370 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:53:48,370 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:53:48,370 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:53:48,370 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:53:48,371 INFO L131 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca_true-termination.c.i_Iteration3_Lasso [2019-01-01 21:53:48,371 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:53:48,371 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:53:48,396 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-01 21:53:48,865 WARN L181 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-01-01 21:53:48,958 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-01 21:53:48,960 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-01 21:53:48,963 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-01 21:53:48,969 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-01 21:53:48,974 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-01 21:53:48,981 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-01 21:53:48,986 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-01 21:53:48,993 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-01 21:53:48,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-01 21:53:48,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-01 21:53:49,002 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-01 21:53:49,007 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-01 21:53:49,014 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-01 21:53:49,656 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:53:49,661 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:53:49,663 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-01 21:53:49,665 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:49,665 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:49,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:49,666 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:49,675 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:53:49,675 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:53:49,692 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:49,692 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-01 21:53:49,693 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:49,693 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:49,694 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:49,694 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:49,702 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:53:49,702 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:53:49,785 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:53:49,884 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-01 21:53:49,886 INFO L444 ModelExtractionUtils]: 33 out of 40 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-01-01 21:53:49,889 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:53:49,893 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:53:49,894 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:53:49,894 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-01 21:53:49,977 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-01-01 21:53:49,994 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 21:53:50,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:53:50,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:53:50,057 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:53:50,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:53:50,075 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:53:50,174 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-01 21:53:50,177 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-01 21:53:50,178 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4 Second operand 4 states. [2019-01-01 21:53:50,311 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-01 21:53:50,313 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-01 21:53:50,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:53:50,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2019-01-01 21:53:50,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 4 letters. Loop has 7 letters. [2019-01-01 21:53:50,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:53:50,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 11 letters. Loop has 7 letters. [2019-01-01 21:53:50,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:53:50,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 4 letters. Loop has 14 letters. [2019-01-01 21:53:50,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:53:50,319 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 24 transitions. [2019-01-01 21:53:50,321 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:53:50,321 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 16 states and 22 transitions. [2019-01-01 21:53:50,322 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-01-01 21:53:50,322 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-01-01 21:53:50,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2019-01-01 21:53:50,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:53:50,323 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-01-01 21:53:50,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2019-01-01 21:53:50,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-01-01 21:53:50,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-01 21:53:50,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2019-01-01 21:53:50,326 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2019-01-01 21:53:50,326 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2019-01-01 21:53:50,326 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 21:53:50,326 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 21 transitions. [2019-01-01 21:53:50,328 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:53:50,328 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:53:50,328 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:53:50,329 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 21:53:50,329 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:53:50,329 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-01 21:53:50,329 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~mem5;havoc SelectionSort_#t~mem4;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-01 21:53:50,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:53:50,332 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2019-01-01 21:53:50,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:53:50,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:53:50,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:53:50,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:53:50,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:53:50,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:53:50,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:53:50,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:53:50,351 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 1 times [2019-01-01 21:53:50,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:53:50,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:53:50,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:53:50,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:53:50,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:53:50,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:53:50,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:53:50,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:53:50,367 INFO L82 PathProgramCache]: Analyzing trace with hash 176800017, now seen corresponding path program 1 times [2019-01-01 21:53:50,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:53:50,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:53:50,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:53:50,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:53:50,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:53:50,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:53:50,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:53:50,499 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-01-01 21:53:50,704 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-01-01 21:53:50,767 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:53:50,767 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:53:50,767 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:53:50,767 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:53:50,768 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:53:50,768 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:53:50,768 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:53:50,768 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:53:50,769 INFO L131 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca_true-termination.c.i_Iteration4_Lasso [2019-01-01 21:53:50,769 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:53:50,769 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:53:50,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-01 21:53:50,790 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-01 21:53:50,791 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-01 21:53:50,793 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-01 21:53:50,796 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-01 21:53:50,800 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-01 21:53:50,803 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-01 21:53:50,944 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-01-01 21:53:51,038 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-01 21:53:51,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-01 21:53:51,044 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-01 21:53:51,048 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-01 21:53:51,051 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-01 21:53:51,054 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-01 21:53:51,057 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-01 21:53:51,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:53:51,407 WARN L181 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-01 21:53:51,773 WARN L181 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-01 21:53:51,892 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:53:51,892 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:53:51,892 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-01 21:53:51,893 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:51,893 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:53:51,896 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:51,896 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:51,896 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:51,897 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:53:51,897 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:53:51,898 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:51,898 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-01 21:53:51,901 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:51,901 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:53:51,901 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:51,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:51,902 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:51,902 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:53:51,902 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:53:51,903 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:51,903 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-01 21:53:51,906 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:51,906 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:53:51,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:51,907 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:51,907 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:51,908 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:53:51,908 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:53:51,908 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:51,909 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-01 21:53:51,909 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:51,909 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:53:51,909 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:51,909 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:51,912 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:51,912 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:53:51,913 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:53:51,914 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:51,914 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-01 21:53:51,915 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:51,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:51,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:51,915 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:51,919 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:53:51,919 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:53:51,922 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:51,922 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-01 21:53:51,923 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:51,923 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:53:51,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:51,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:51,923 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:51,924 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:53:51,924 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:53:51,924 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:51,927 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-01 21:53:51,928 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:51,928 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:51,929 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:51,929 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:51,932 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:53:51,933 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:53:51,941 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:51,941 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-01 21:53:51,942 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:51,942 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:53:51,942 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:51,942 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:51,942 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:51,945 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:53:51,946 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:53:51,948 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:51,949 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-01 21:53:51,949 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:51,950 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:51,950 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:51,950 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:51,956 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:53:51,957 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:53:51,986 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:53:52,014 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-01 21:53:52,014 INFO L444 ModelExtractionUtils]: 33 out of 40 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-01 21:53:52,015 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:53:52,016 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:53:52,017 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:53:52,017 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-01 21:53:52,117 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-01-01 21:53:52,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:53:52,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:53:52,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:53:52,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:53:52,195 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:53:52,287 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-01 21:53:52,287 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-01 21:53:52,287 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-01-01 21:53:52,331 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-01 21:53:52,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-01 21:53:52,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:53:52,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2019-01-01 21:53:52,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 5 letters. Loop has 3 letters. [2019-01-01 21:53:52,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:53:52,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 8 letters. Loop has 3 letters. [2019-01-01 21:53:52,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:53:52,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 5 letters. Loop has 6 letters. [2019-01-01 21:53:52,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:53:52,337 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 47 transitions. [2019-01-01 21:53:52,340 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:53:52,341 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 22 states and 30 transitions. [2019-01-01 21:53:52,341 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-01-01 21:53:52,341 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-01-01 21:53:52,341 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2019-01-01 21:53:52,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:53:52,341 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2019-01-01 21:53:52,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2019-01-01 21:53:52,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 15. [2019-01-01 21:53:52,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-01 21:53:52,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2019-01-01 21:53:52,344 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-01-01 21:53:52,344 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-01-01 21:53:52,344 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 21:53:52,345 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2019-01-01 21:53:52,345 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:53:52,345 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:53:52,345 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:53:52,346 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:53:52,346 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:53:52,346 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~mem5;havoc SelectionSort_#t~mem4; 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-01 21:53:52,346 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~mem5;havoc SelectionSort_#t~mem4;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-01 21:53:52,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:53:52,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1109754407, now seen corresponding path program 1 times [2019-01-01 21:53:52,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:53:52,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:53:52,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:53:52,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:53:52,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:53:52,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:53:52,465 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-01 21:53:52,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:53:52,466 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-01 21:53:52,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:53:52,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:53:52,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:53:52,515 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-01 21:53:52,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:53:52,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-01-01 21:53:52,537 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 21:53:52,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:53:52,539 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 2 times [2019-01-01 21:53:52,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:53:52,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:53:52,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:53:52,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:53:52,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:53:52,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:53:52,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:53:52,747 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-01-01 21:53:52,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 21:53:52,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 21:53:52,820 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 6 states. [2019-01-01 21:53:52,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:53:52,988 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2019-01-01 21:53:52,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 21:53:52,989 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 38 transitions. [2019-01-01 21:53:52,991 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:53:52,992 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 26 states and 35 transitions. [2019-01-01 21:53:52,992 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-01-01 21:53:52,993 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-01-01 21:53:52,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 35 transitions. [2019-01-01 21:53:52,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:53:52,994 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2019-01-01 21:53:52,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 35 transitions. [2019-01-01 21:53:52,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 18. [2019-01-01 21:53:52,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-01 21:53:52,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2019-01-01 21:53:52,998 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2019-01-01 21:53:52,998 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2019-01-01 21:53:52,998 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 21:53:52,999 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. [2019-01-01 21:53:52,999 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:53:52,999 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:53:52,999 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:53:53,002 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:53:53,002 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:53:53,003 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~mem5;havoc SelectionSort_#t~mem4; 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~mem5;havoc SelectionSort_#t~mem4; 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-01 21:53:53,003 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~mem5;havoc SelectionSort_#t~mem4;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-01 21:53:53,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:53:53,003 INFO L82 PathProgramCache]: Analyzing trace with hash -366799804, now seen corresponding path program 2 times [2019-01-01 21:53:53,003 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:53:53,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:53:53,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:53:53,004 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:53:53,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:53:53,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:53:53,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:53:53,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:53:53,055 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 3 times [2019-01-01 21:53:53,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:53:53,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:53:53,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:53:53,057 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:53:53,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:53:53,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:53:53,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:53:53,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:53:53,074 INFO L82 PathProgramCache]: Analyzing trace with hash -936135015, now seen corresponding path program 1 times [2019-01-01 21:53:53,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:53:53,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:53:53,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:53:53,075 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:53:53,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:53:53,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:53:53,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:53:53,416 WARN L181 SmtUtils]: Spent 256.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-01-01 21:53:53,537 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-01-01 21:53:53,942 WARN L181 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 106 [2019-01-01 21:53:54,022 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:53:54,023 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:53:54,023 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:53:54,023 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:53:54,023 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:53:54,023 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:53:54,023 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:53:54,024 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:53:54,024 INFO L131 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca_true-termination.c.i_Iteration6_Lasso [2019-01-01 21:53:54,024 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:53:54,024 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:53:54,029 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-01 21:53:54,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:53:54,048 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-01 21:53:54,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:53:54,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:53:54,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:53:54,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:53:54,260 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2019-01-01 21:53:54,368 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-01 21:53:54,371 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-01 21:53:54,373 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-01 21:53:54,377 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-01 21:53:54,379 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-01 21:53:54,389 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-01 21:53:54,391 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-01 21:53:54,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:53:54,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:53:54,980 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:53:54,983 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:53:54,983 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-01 21:53:54,984 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:54,984 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:53:54,985 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:54,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:54,985 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:54,985 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:53:54,985 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:53:54,989 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:54,990 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-01 21:53:54,990 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:54,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:54,991 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:54,991 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:54,991 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:53:54,992 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:53:54,993 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:54,994 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-01 21:53:54,994 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:54,994 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:54,994 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:54,994 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:54,995 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:53:54,995 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:53:54,997 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:54,998 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-01 21:53:54,998 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:54,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:54,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:54,999 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:55,000 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:53:55,000 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:53:55,002 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:55,002 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-01 21:53:55,003 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:55,003 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:55,003 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:55,003 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:55,004 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:53:55,004 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:53:55,005 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:55,006 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-01 21:53:55,006 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:55,006 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:53:55,007 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:55,007 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:55,007 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:55,007 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:53:55,007 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:53:55,008 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:55,008 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-01 21:53:55,008 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:55,009 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:55,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:55,009 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:55,010 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:53:55,010 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:53:55,015 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:55,015 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-01 21:53:55,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:55,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:55,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:55,016 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:55,018 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:53:55,018 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:53:55,033 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:55,034 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-01 21:53:55,034 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:55,038 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-01 21:53:55,038 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:55,038 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:55,040 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 21:53:55,040 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:53:55,054 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:53:55,054 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-01 21:53:55,055 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:53:55,056 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:53:55,056 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:53:55,056 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:53:55,059 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:53:55,059 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:53:55,087 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:53:55,107 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-01 21:53:55,108 INFO L444 ModelExtractionUtils]: 21 out of 31 variables were initially zero. Simplification set additionally 7 variables to zero. [2019-01-01 21:53:55,108 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:53:55,109 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:53:55,109 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:53:55,109 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-01 21:53:55,197 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2019-01-01 21:53:55,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:53:55,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:53:55,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:53:55,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:53:55,260 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:53:55,271 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-01 21:53:55,271 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-01 21:53:55,271 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-01-01 21:53:55,336 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-01 21:53:55,338 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-01 21:53:55,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:53:55,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2019-01-01 21:53:55,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 15 letters. Loop has 3 letters. [2019-01-01 21:53:55,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:53:55,339 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:53:55,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:53:55,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:53:55,374 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:53:55,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:53:55,390 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:53:55,403 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-01 21:53:55,404 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-01 21:53:55,404 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-01-01 21:53:55,531 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-01 21:53:55,532 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-01 21:53:55,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:53:55,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2019-01-01 21:53:55,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 15 letters. Loop has 3 letters. [2019-01-01 21:53:55,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:53:55,534 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:53:55,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:53:55,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:53:55,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:53:55,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:53:55,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:53:55,652 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-01 21:53:55,653 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-01 21:53:55,653 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-01-01 21:53:55,695 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-01 21:53:55,696 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-01 21:53:55,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:53:55,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2019-01-01 21:53:55,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 15 letters. Loop has 3 letters. [2019-01-01 21:53:55,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:53:55,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 18 letters. Loop has 3 letters. [2019-01-01 21:53:55,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:53:55,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 15 letters. Loop has 6 letters. [2019-01-01 21:53:55,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:53:55,703 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 39 transitions. [2019-01-01 21:53:55,704 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:53:55,705 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 0 states and 0 transitions. [2019-01-01 21:53:55,705 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:53:55,705 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:53:55,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:53:55,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:53:55,705 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:53:55,706 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:53:55,706 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:53:55,706 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-01 21:53:55,706 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:53:55,706 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:53:55,706 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:53:55,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:53:55 BoogieIcfgContainer [2019-01-01 21:53:55,715 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:53:55,715 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:53:55,715 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:53:55,716 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:53:55,716 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:53:46" (3/4) ... [2019-01-01 21:53:55,720 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:53:55,720 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:53:55,721 INFO L168 Benchmark]: Toolchain (without parser) took 10404.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 205.0 MB). Free memory was 951.4 MB in the beginning and 802.3 MB in the end (delta: 149.0 MB). Peak memory consumption was 354.0 MB. Max. memory is 11.5 GB. [2019-01-01 21:53:55,722 INFO L168 Benchmark]: CDTParser took 0.20 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-01 21:53:55,723 INFO L168 Benchmark]: CACSL2BoogieTranslator took 690.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -158.8 MB). Peak memory consumption was 31.2 MB. Max. memory is 11.5 GB. [2019-01-01 21:53:55,724 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.82 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-01 21:53:55,724 INFO L168 Benchmark]: Boogie Preprocessor took 47.83 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-01 21:53:55,725 INFO L168 Benchmark]: RCFGBuilder took 426.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. [2019-01-01 21:53:55,726 INFO L168 Benchmark]: BuchiAutomizer took 9173.17 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 73.9 MB). Free memory was 1.1 GB in the beginning and 802.3 MB in the end (delta: 289.0 MB). Peak memory consumption was 362.9 MB. Max. memory is 11.5 GB. [2019-01-01 21:53:55,727 INFO L168 Benchmark]: Witness Printer took 4.89 ms. Allocated memory is still 1.2 GB. Free memory is still 802.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:53:55,733 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.20 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 690.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -158.8 MB). Peak memory consumption was 31.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 56.82 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 47.83 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 426.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9173.17 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 73.9 MB). Free memory was 1.1 GB in the beginning and 802.3 MB in the end (delta: 289.0 MB). Peak memory consumption was 362.9 MB. Max. memory is 11.5 GB. * Witness Printer took 4.89 ms. Allocated memory is still 1.2 GB. Free memory is still 802.3 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 9.1s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 7.6s. Construction of modules took 0.4s. Büchi inclusion checks took 0.8s. 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.4s 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: 20ms 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...