./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/array-memsafety/selectionsort-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e 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/array-memsafety/selectionsort-alloca_true-valid-memsafety_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash 44846bb6d84d04329b704265dd9929c19b9c8486 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-29 00:11:36,404 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-29 00:11:36,407 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-29 00:11:36,420 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-29 00:11:36,420 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-29 00:11:36,421 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-29 00:11:36,423 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-29 00:11:36,425 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-29 00:11:36,427 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-29 00:11:36,427 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-29 00:11:36,429 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-29 00:11:36,429 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-29 00:11:36,430 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-29 00:11:36,431 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-29 00:11:36,433 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-29 00:11:36,434 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-29 00:11:36,435 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-29 00:11:36,437 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-29 00:11:36,439 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-29 00:11:36,441 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-29 00:11:36,442 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-29 00:11:36,443 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-29 00:11:36,446 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-29 00:11:36,446 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-29 00:11:36,446 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-29 00:11:36,447 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-29 00:11:36,448 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-29 00:11:36,449 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-29 00:11:36,450 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-29 00:11:36,451 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-29 00:11:36,451 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-29 00:11:36,452 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-29 00:11:36,452 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-29 00:11:36,452 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-29 00:11:36,453 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-29 00:11:36,454 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-29 00:11:36,454 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-29 00:11:36,471 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-29 00:11:36,472 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-29 00:11:36,473 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-29 00:11:36,473 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-29 00:11:36,473 INFO L133 SettingsManager]: * Use SBE=true [2018-11-29 00:11:36,473 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-29 00:11:36,473 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-29 00:11:36,474 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-29 00:11:36,474 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-29 00:11:36,474 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-29 00:11:36,474 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-29 00:11:36,474 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-29 00:11:36,475 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-29 00:11:36,475 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-29 00:11:36,475 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-29 00:11:36,475 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-29 00:11:36,475 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-29 00:11:36,475 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-29 00:11:36,476 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-29 00:11:36,478 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-29 00:11:36,478 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-29 00:11:36,478 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-29 00:11:36,478 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-29 00:11:36,478 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-29 00:11:36,479 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-29 00:11:36,480 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-29 00:11:36,481 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-29 00:11:36,481 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-29 00:11:36,481 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-29 00:11:36,481 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-29 00:11:36,482 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-29 00:11:36,483 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-29 00:11:36,484 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 44846bb6d84d04329b704265dd9929c19b9c8486 [2018-11-29 00:11:36,540 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-29 00:11:36,556 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-29 00:11:36,563 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-29 00:11:36,565 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-29 00:11:36,565 INFO L276 PluginConnector]: CDTParser initialized [2018-11-29 00:11:36,566 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/selectionsort-alloca_true-valid-memsafety_true-termination.i [2018-11-29 00:11:36,627 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c8256c68/3282ebcf3647437487e2031e660c1d95/FLAGaa831feea [2018-11-29 00:11:37,192 INFO L307 CDTParser]: Found 1 translation units. [2018-11-29 00:11:37,193 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/selectionsort-alloca_true-valid-memsafety_true-termination.i [2018-11-29 00:11:37,209 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c8256c68/3282ebcf3647437487e2031e660c1d95/FLAGaa831feea [2018-11-29 00:11:37,424 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c8256c68/3282ebcf3647437487e2031e660c1d95 [2018-11-29 00:11:37,428 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-29 00:11:37,430 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-29 00:11:37,431 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-29 00:11:37,431 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-29 00:11:37,438 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-29 00:11:37,439 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:11:37" (1/1) ... [2018-11-29 00:11:37,442 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2213c723 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:37, skipping insertion in model container [2018-11-29 00:11:37,442 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:11:37" (1/1) ... [2018-11-29 00:11:37,451 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-29 00:11:37,505 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-29 00:11:37,888 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:11:37,911 INFO L191 MainTranslator]: Completed pre-run [2018-11-29 00:11:37,986 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:11:38,042 INFO L195 MainTranslator]: Completed translation [2018-11-29 00:11:38,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:38 WrapperNode [2018-11-29 00:11:38,043 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-29 00:11:38,044 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-29 00:11:38,044 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-29 00:11:38,044 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-29 00:11:38,125 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:38" (1/1) ... [2018-11-29 00:11:38,145 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:38" (1/1) ... [2018-11-29 00:11:38,169 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-29 00:11:38,169 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-29 00:11:38,170 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-29 00:11:38,170 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-29 00:11:38,180 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:38" (1/1) ... [2018-11-29 00:11:38,180 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:38" (1/1) ... [2018-11-29 00:11:38,185 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:38" (1/1) ... [2018-11-29 00:11:38,185 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:38" (1/1) ... [2018-11-29 00:11:38,194 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:38" (1/1) ... [2018-11-29 00:11:38,201 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:38" (1/1) ... [2018-11-29 00:11:38,202 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:38" (1/1) ... [2018-11-29 00:11:38,204 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-29 00:11:38,205 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-29 00:11:38,205 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-29 00:11:38,205 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-29 00:11:38,206 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:38" (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 [2018-11-29 00:11:38,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-29 00:11:38,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-29 00:11:38,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-29 00:11:38,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-29 00:11:38,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-29 00:11:38,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-29 00:11:38,646 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-29 00:11:38,646 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-29 00:11:38,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:11:38 BoogieIcfgContainer [2018-11-29 00:11:38,647 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-29 00:11:38,648 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-29 00:11:38,648 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-29 00:11:38,652 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-29 00:11:38,652 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:11:38,653 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.11 12:11:37" (1/3) ... [2018-11-29 00:11:38,654 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4a39fd21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:11:38, skipping insertion in model container [2018-11-29 00:11:38,654 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:11:38,654 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:38" (2/3) ... [2018-11-29 00:11:38,655 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4a39fd21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:11:38, skipping insertion in model container [2018-11-29 00:11:38,655 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:11:38,655 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:11:38" (3/3) ... [2018-11-29 00:11:38,657 INFO L375 chiAutomizerObserver]: Analyzing ICFG selectionsort-alloca_true-valid-memsafety_true-termination.i [2018-11-29 00:11:38,712 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-29 00:11:38,713 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-29 00:11:38,713 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-29 00:11:38,713 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-29 00:11:38,713 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-29 00:11:38,714 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-29 00:11:38,714 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-29 00:11:38,714 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-29 00:11:38,714 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-29 00:11:38,729 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-29 00:11:38,753 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-29 00:11:38,754 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:11:38,754 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:11:38,761 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-29 00:11:38,762 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-29 00:11:38,762 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-29 00:11:38,762 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-29 00:11:38,764 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-29 00:11:38,764 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:11:38,764 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:11:38,765 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-29 00:11:38,765 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-29 00:11:38,772 INFO L794 eck$LassoCheckResult]: Stem: 9#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#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; 16#L559true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 3#L559-2true call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(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; 11#L543-3true [2018-11-29 00:11:38,772 INFO L796 eck$LassoCheckResult]: Loop: 11#L543-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; 5#L547-3true assume !true; 6#L547-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); 10#L543-2true SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 11#L543-3true [2018-11-29 00:11:38,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:38,779 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2018-11-29 00:11:38,781 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:38,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:38,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:38,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:38,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:38,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:38,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:38,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:38,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1463796, now seen corresponding path program 1 times [2018-11-29 00:11:38,927 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:38,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:38,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:38,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:38,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:38,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:38,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:11:38,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:11:38,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-29 00:11:38,979 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:11:38,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-29 00:11:38,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-29 00:11:38,996 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 2 states. [2018-11-29 00:11:39,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:11:39,007 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2018-11-29 00:11:39,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-29 00:11:39,009 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2018-11-29 00:11:39,011 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-29 00:11:39,016 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 13 transitions. [2018-11-29 00:11:39,018 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-29 00:11:39,018 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-29 00:11:39,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2018-11-29 00:11:39,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:11:39,020 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-29 00:11:39,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2018-11-29 00:11:39,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-11-29 00:11:39,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-29 00:11:39,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-11-29 00:11:39,054 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-29 00:11:39,054 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-29 00:11:39,054 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-29 00:11:39,054 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2018-11-29 00:11:39,057 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-29 00:11:39,057 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:11:39,057 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:11:39,058 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-29 00:11:39,058 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-29 00:11:39,059 INFO L794 eck$LassoCheckResult]: Stem: 38#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 36#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; 37#L559 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 41#L559-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(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; 40#L543-3 [2018-11-29 00:11:39,059 INFO L796 eck$LassoCheckResult]: Loop: 40#L543-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#L547-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 44#L547-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); 39#L543-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 40#L543-3 [2018-11-29 00:11:39,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:39,059 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2018-11-29 00:11:39,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:39,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:39,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:39,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:39,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:39,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:39,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:39,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:39,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1453225, now seen corresponding path program 1 times [2018-11-29 00:11:39,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:39,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:39,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:39,093 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:11:39,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:39,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:39,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:11:39,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:11:39,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-29 00:11:39,148 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:11:39,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-29 00:11:39,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-29 00:11:39,149 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand 3 states. [2018-11-29 00:11:39,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:11:39,218 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2018-11-29 00:11:39,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-29 00:11:39,220 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 14 transitions. [2018-11-29 00:11:39,222 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-29 00:11:39,222 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 14 transitions. [2018-11-29 00:11:39,222 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-29 00:11:39,222 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-29 00:11:39,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2018-11-29 00:11:39,223 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:11:39,223 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-29 00:11:39,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2018-11-29 00:11:39,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-11-29 00:11:39,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-29 00:11:39,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2018-11-29 00:11:39,225 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-29 00:11:39,225 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-29 00:11:39,225 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-29 00:11:39,225 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2018-11-29 00:11:39,226 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-29 00:11:39,226 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:11:39,226 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:11:39,226 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-29 00:11:39,227 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:11:39,227 INFO L794 eck$LassoCheckResult]: Stem: 65#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#L559 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 66#L559-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(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; 67#L543-3 [2018-11-29 00:11:39,227 INFO L796 eck$LassoCheckResult]: Loop: 67#L543-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#L547-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#L549 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 70#L547-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 71#L547-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 73#L547-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); 68#L543-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 67#L543-3 [2018-11-29 00:11:39,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:39,227 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 3 times [2018-11-29 00:11:39,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:39,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:39,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:39,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:39,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:39,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:39,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:39,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:39,246 INFO L82 PathProgramCache]: Analyzing trace with hash 393067660, now seen corresponding path program 1 times [2018-11-29 00:11:39,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:39,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:39,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:39,247 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:11:39,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:39,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:39,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:39,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:39,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1419424808, now seen corresponding path program 1 times [2018-11-29 00:11:39,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:39,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:39,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:39,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:39,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:39,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:39,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:39,934 WARN L180 SmtUtils]: Spent 548.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2018-11-29 00:11:40,243 WARN L180 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-11-29 00:11:40,358 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-11-29 00:11:40,372 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:11:40,373 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:11:40,374 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:11:40,374 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:11:40,374 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:11:40,374 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:11:40,374 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:11:40,374 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:11:40,375 INFO L131 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2018-11-29 00:11:40,375 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:11:40,375 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:11:40,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:40,880 WARN L180 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2018-11-29 00:11:40,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:40,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:41,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:41,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:41,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:41,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:41,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:41,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:41,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:41,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:41,472 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-11-29 00:11:41,621 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:11:41,626 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:11:41,629 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 [2018-11-29 00:11:41,631 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:41,631 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:41,632 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:41,632 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:41,638 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:41,638 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:41,654 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:41,655 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 [2018-11-29 00:11:41,656 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:41,656 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:41,656 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:41,657 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:41,667 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:41,667 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:41,755 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:11:41,828 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-29 00:11:41,828 INFO L444 ModelExtractionUtils]: 29 out of 40 variables were initially zero. Simplification set additionally 7 variables to zero. [2018-11-29 00:11:41,831 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:11:41,832 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-29 00:11:41,833 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:11:41,833 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 [] [2018-11-29 00:11:41,913 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-29 00:11:41,933 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-29 00:11:41,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:42,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:42,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:42,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:42,049 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:42,158 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:11:42,163 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 [2018-11-29 00:11:42,164 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4 Second operand 4 states. [2018-11-29 00:11:42,396 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. [2018-11-29 00:11:42,397 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 [2018-11-29 00:11:42,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-29 00:11:42,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-11-29 00:11:42,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 4 letters. Loop has 7 letters. [2018-11-29 00:11:42,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:42,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 11 letters. Loop has 7 letters. [2018-11-29 00:11:42,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:42,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 4 letters. Loop has 14 letters. [2018-11-29 00:11:42,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:42,402 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 24 transitions. [2018-11-29 00:11:42,403 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-29 00:11:42,404 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 16 states and 22 transitions. [2018-11-29 00:11:42,404 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-29 00:11:42,404 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-29 00:11:42,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2018-11-29 00:11:42,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:11:42,405 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-11-29 00:11:42,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2018-11-29 00:11:42,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-11-29 00:11:42,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-29 00:11:42,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2018-11-29 00:11:42,408 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2018-11-29 00:11:42,408 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2018-11-29 00:11:42,408 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-29 00:11:42,408 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 21 transitions. [2018-11-29 00:11:42,409 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-29 00:11:42,409 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:11:42,409 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:11:42,410 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-29 00:11:42,410 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-29 00:11:42,410 INFO L794 eck$LassoCheckResult]: Stem: 164#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 162#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; 163#L559 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 167#L559-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(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; 168#L543-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; 169#L547-3 [2018-11-29 00:11:42,410 INFO L796 eck$LassoCheckResult]: Loop: 169#L547-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#L549 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 171#L547-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 169#L547-3 [2018-11-29 00:11:42,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:42,411 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2018-11-29 00:11:42,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:42,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:42,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:42,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:42,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:42,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:42,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:42,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:42,428 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 1 times [2018-11-29 00:11:42,428 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:42,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:42,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:42,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:42,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:42,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:42,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:42,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:42,441 INFO L82 PathProgramCache]: Analyzing trace with hash 176800017, now seen corresponding path program 1 times [2018-11-29 00:11:42,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:42,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:42,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:42,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:42,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:42,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:42,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:42,775 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2018-11-29 00:11:42,830 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:11:42,831 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:11:42,831 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:11:42,831 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:11:42,831 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:11:42,831 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:11:42,832 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:11:42,832 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:11:42,832 INFO L131 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca_true-valid-memsafety_true-termination.i_Iteration4_Lasso [2018-11-29 00:11:42,832 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:11:42,832 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:11:42,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:42,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:42,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:42,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:42,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:42,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:42,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:42,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:42,998 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2018-11-29 00:11:43,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:43,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:43,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:43,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:43,407 WARN L180 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-11-29 00:11:43,765 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:11:43,766 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:11:43,766 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 [2018-11-29 00:11:43,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:43,770 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:43,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:43,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:43,771 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:43,771 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:43,774 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:43,774 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:43,775 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 [2018-11-29 00:11:43,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:43,775 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:43,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:43,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:43,776 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:43,776 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:43,776 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:43,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:43,779 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 [2018-11-29 00:11:43,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:43,780 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:43,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:43,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:43,780 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:43,781 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:43,781 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:43,781 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:43,783 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 [2018-11-29 00:11:43,783 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:43,783 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:43,783 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:43,783 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:43,784 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:43,784 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:43,784 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:43,785 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:43,786 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 [2018-11-29 00:11:43,786 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:43,786 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:43,787 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:43,787 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:43,788 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:43,788 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:43,799 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:43,799 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 [2018-11-29 00:11:43,800 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:43,800 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:43,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:43,800 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:43,800 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:43,804 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:43,804 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:43,805 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:43,805 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 [2018-11-29 00:11:43,806 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:43,806 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:43,806 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:43,806 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:43,806 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:43,806 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:43,806 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:43,809 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:43,810 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 [2018-11-29 00:11:43,810 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:43,810 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:43,810 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:43,811 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:43,814 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:43,814 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:43,830 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:43,830 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 [2018-11-29 00:11:43,831 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:43,831 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:43,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:43,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:43,831 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:43,835 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:43,835 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:43,837 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:43,837 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 [2018-11-29 00:11:43,841 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:43,841 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:43,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:43,842 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:43,849 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:43,849 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:43,904 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:11:43,960 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-29 00:11:43,961 INFO L444 ModelExtractionUtils]: 31 out of 40 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-29 00:11:43,963 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:11:43,964 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-29 00:11:43,965 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:11:43,965 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~j~0, ULTIMATE.start_SelectionSort_~a.offset, v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_2) = -4*ULTIMATE.start_SelectionSort_~j~0 - 1*ULTIMATE.start_SelectionSort_~a.offset + 1*v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_2 Supporting invariants [] [2018-11-29 00:11:44,058 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-29 00:11:44,060 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-29 00:11:44,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:44,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:44,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:44,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:44,101 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:44,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:11:44,174 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 [2018-11-29 00:11:44,174 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-11-29 00:11:44,345 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. [2018-11-29 00:11:44,347 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 [2018-11-29 00:11:44,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-29 00:11:44,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2018-11-29 00:11:44,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 5 letters. Loop has 3 letters. [2018-11-29 00:11:44,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:44,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 8 letters. Loop has 3 letters. [2018-11-29 00:11:44,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:44,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 5 letters. Loop has 6 letters. [2018-11-29 00:11:44,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:44,350 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 47 transitions. [2018-11-29 00:11:44,355 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-29 00:11:44,357 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 22 states and 30 transitions. [2018-11-29 00:11:44,357 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-29 00:11:44,357 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-29 00:11:44,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2018-11-29 00:11:44,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:11:44,360 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2018-11-29 00:11:44,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2018-11-29 00:11:44,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 15. [2018-11-29 00:11:44,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-29 00:11:44,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2018-11-29 00:11:44,363 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2018-11-29 00:11:44,363 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2018-11-29 00:11:44,363 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-29 00:11:44,363 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2018-11-29 00:11:44,366 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-29 00:11:44,366 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:11:44,366 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:11:44,367 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:11:44,367 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-29 00:11:44,367 INFO L794 eck$LassoCheckResult]: Stem: 276#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 274#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; 275#L559 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 279#L559-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(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; 280#L543-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#L547-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#L549 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 284#L547-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 285#L547-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 288#L547-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); 277#L543-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 278#L543-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; 282#L547-3 [2018-11-29 00:11:44,367 INFO L796 eck$LassoCheckResult]: Loop: 282#L547-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#L549 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 283#L547-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 282#L547-3 [2018-11-29 00:11:44,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:44,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1109754407, now seen corresponding path program 1 times [2018-11-29 00:11:44,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:44,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:44,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:44,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:44,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:44,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:44,526 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:11:44,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:11:44,526 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 [2018-11-29 00:11:44,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:44,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:44,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:44,573 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:11:44,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:11:44,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-11-29 00:11:44,596 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:11:44,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:44,596 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 2 times [2018-11-29 00:11:44,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:44,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:44,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:44,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:44,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:44,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:44,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:44,772 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-11-29 00:11:44,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-29 00:11:44,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-29 00:11:44,821 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 6 states. [2018-11-29 00:11:44,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:11:44,890 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2018-11-29 00:11:44,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-29 00:11:44,891 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 38 transitions. [2018-11-29 00:11:44,893 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-29 00:11:44,894 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 26 states and 35 transitions. [2018-11-29 00:11:44,894 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-29 00:11:44,894 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-29 00:11:44,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 35 transitions. [2018-11-29 00:11:44,895 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:11:44,895 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2018-11-29 00:11:44,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 35 transitions. [2018-11-29 00:11:44,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 18. [2018-11-29 00:11:44,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-29 00:11:44,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2018-11-29 00:11:44,897 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2018-11-29 00:11:44,897 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2018-11-29 00:11:44,897 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-29 00:11:44,898 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. [2018-11-29 00:11:44,898 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-29 00:11:44,898 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:11:44,898 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:11:44,899 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:11:44,899 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-29 00:11:44,899 INFO L794 eck$LassoCheckResult]: Stem: 366#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#L559 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 367#L559-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(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; 368#L543-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#L547-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#L549 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 374#L547-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 375#L547-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#L549 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 378#L547-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 380#L547-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 379#L547-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); 369#L543-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 370#L543-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#L547-3 [2018-11-29 00:11:44,899 INFO L796 eck$LassoCheckResult]: Loop: 372#L547-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#L549 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 373#L547-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 372#L547-3 [2018-11-29 00:11:44,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:44,900 INFO L82 PathProgramCache]: Analyzing trace with hash -366799804, now seen corresponding path program 2 times [2018-11-29 00:11:44,900 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:44,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:44,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:44,901 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:11:44,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:44,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:44,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:44,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:44,924 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 3 times [2018-11-29 00:11:44,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:44,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:44,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:44,925 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:11:44,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:44,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:44,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:44,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:44,933 INFO L82 PathProgramCache]: Analyzing trace with hash -936135015, now seen corresponding path program 1 times [2018-11-29 00:11:44,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:44,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:44,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:44,934 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:11:44,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:44,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:44,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:45,238 WARN L180 SmtUtils]: Spent 270.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-11-29 00:11:45,708 WARN L180 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 104 [2018-11-29 00:11:45,784 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:11:45,784 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:11:45,784 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:11:45,784 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:11:45,784 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:11:45,785 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:11:45,785 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:11:45,785 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:11:45,785 INFO L131 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca_true-valid-memsafety_true-termination.i_Iteration6_Lasso [2018-11-29 00:11:45,785 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:11:45,785 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:11:45,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:45,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:45,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:45,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:45,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:46,055 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2018-11-29 00:11:46,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:46,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:46,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:46,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:46,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:46,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:46,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:46,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:46,569 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-29 00:11:46,598 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:11:46,599 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:11:46,599 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 [2018-11-29 00:11:46,600 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:46,600 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:46,600 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:46,600 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:46,600 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:46,603 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:46,604 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:46,604 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:46,605 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:11:46,605 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:46,605 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:46,605 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:46,606 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:46,607 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:46,610 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:46,612 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:46,612 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 [2018-11-29 00:11:46,613 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:46,613 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:46,613 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:46,613 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:46,613 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:46,613 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:46,614 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:46,617 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:46,618 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 [2018-11-29 00:11:46,618 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:46,618 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:46,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:46,618 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:46,621 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:46,622 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:46,622 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:46,622 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:46,623 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 [2018-11-29 00:11:46,623 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:46,623 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:46,623 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:46,627 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:46,628 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:46,629 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:46,634 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:46,634 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 [2018-11-29 00:11:46,634 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:46,635 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:46,635 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:46,635 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:46,639 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:46,639 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:46,646 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:46,647 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 [2018-11-29 00:11:46,647 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:46,647 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:46,647 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:46,647 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:46,653 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:46,653 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:46,673 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:11:46,702 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-11-29 00:11:46,703 INFO L444 ModelExtractionUtils]: 21 out of 31 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-29 00:11:46,703 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:11:46,704 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-11-29 00:11:46,705 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:11:46,705 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_SelectionSort_~array_size, ULTIMATE.start_SelectionSort_~min~0, v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_3) = 4*ULTIMATE.start_SelectionSort_~array_size - 4*ULTIMATE.start_SelectionSort_~min~0 + 1*v_rep(select #length ULTIMATE.start_SelectionSort_~a.base)_3 Supporting invariants [-1*ULTIMATE.start_SelectionSort_~min~0 + 1*ULTIMATE.start_SelectionSort_~j~0 - 1 >= 0] [2018-11-29 00:11:46,924 INFO L297 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2018-11-29 00:11:46,947 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-29 00:11:47,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:47,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:47,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:47,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:47,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:47,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:11:47,303 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 [2018-11-29 00:11:47,303 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-29 00:11:47,470 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 39 states and 50 transitions. Complement of second has 8 states. [2018-11-29 00:11:47,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 2 accepting loop states [2018-11-29 00:11:47,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-29 00:11:47,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2018-11-29 00:11:47,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-29 00:11:47,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:47,473 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:11:47,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:47,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:47,561 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:47,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:47,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:47,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:11:47,662 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-29 00:11:47,662 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-29 00:11:47,806 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 43 states and 58 transitions. Complement of second has 9 states. [2018-11-29 00:11:47,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-29 00:11:47,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-29 00:11:47,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2018-11-29 00:11:47,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-29 00:11:47,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:47,808 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:11:47,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:47,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:47,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:47,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:47,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:48,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:11:48,039 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 3 loop predicates [2018-11-29 00:11:48,039 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-29 00:11:48,139 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 46 states and 58 transitions. Complement of second has 7 states. [2018-11-29 00:11:48,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 2 accepting loop states [2018-11-29 00:11:48,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-29 00:11:48,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2018-11-29 00:11:48,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-29 00:11:48,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:48,142 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:11:48,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:48,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:48,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:48,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:48,191 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:48,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:11:48,232 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-29 00:11:48,232 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-29 00:11:48,353 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 41 states and 55 transitions. Complement of second has 8 states. [2018-11-29 00:11:48,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-29 00:11:48,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-29 00:11:48,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2018-11-29 00:11:48,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-29 00:11:48,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:48,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 18 letters. Loop has 3 letters. [2018-11-29 00:11:48,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:48,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 15 letters. Loop has 6 letters. [2018-11-29 00:11:48,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:48,357 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 55 transitions. [2018-11-29 00:11:48,359 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-29 00:11:48,361 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 35 states and 47 transitions. [2018-11-29 00:11:48,361 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-29 00:11:48,361 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-29 00:11:48,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 47 transitions. [2018-11-29 00:11:48,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:11:48,362 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 47 transitions. [2018-11-29 00:11:48,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 47 transitions. [2018-11-29 00:11:48,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2018-11-29 00:11:48,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-29 00:11:48,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2018-11-29 00:11:48,366 INFO L728 BuchiCegarLoop]: Abstraction has 32 states and 44 transitions. [2018-11-29 00:11:48,366 INFO L608 BuchiCegarLoop]: Abstraction has 32 states and 44 transitions. [2018-11-29 00:11:48,366 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-29 00:11:48,366 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 44 transitions. [2018-11-29 00:11:48,367 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-29 00:11:48,367 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:11:48,367 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:11:48,368 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:11:48,368 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-29 00:11:48,368 INFO L794 eck$LassoCheckResult]: Stem: 885#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 883#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; 884#L559 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 888#L559-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(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; 889#L543-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; 890#L547-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); 897#L549 assume SelectionSort_#t~mem4 < SelectionSort_#t~mem5;havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5;SelectionSort_~min~0 := SelectionSort_~j~0; 899#L547-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 912#L547-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); 902#L549 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 908#L547-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 901#L547-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 900#L547-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); 886#L543-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 887#L543-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; 891#L547-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); 896#L549 [2018-11-29 00:11:48,368 INFO L796 eck$LassoCheckResult]: Loop: 896#L549 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 892#L547-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 893#L547-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); 896#L549 [2018-11-29 00:11:48,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:48,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1907134999, now seen corresponding path program 2 times [2018-11-29 00:11:48,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:48,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:48,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:48,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:48,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:48,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:48,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:48,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:48,391 INFO L82 PathProgramCache]: Analyzing trace with hash 59638, now seen corresponding path program 1 times [2018-11-29 00:11:48,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:48,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:48,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:48,392 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:11:48,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:48,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:48,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:48,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:48,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1631393568, now seen corresponding path program 3 times [2018-11-29 00:11:48,397 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:48,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:48,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:48,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:11:48,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:48,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:48,692 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:11:48,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:11:48,692 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-29 00:11:48,703 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-29 00:11:48,725 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-29 00:11:48,725 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-29 00:11:48,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:48,825 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:11:48,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:11:48,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2018-11-29 00:11:48,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-29 00:11:48,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-11-29 00:11:48,906 INFO L87 Difference]: Start difference. First operand 32 states and 44 transitions. cyclomatic complexity: 15 Second operand 17 states. [2018-11-29 00:11:49,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:11:49,264 INFO L93 Difference]: Finished difference Result 89 states and 110 transitions. [2018-11-29 00:11:49,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-29 00:11:49,265 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 110 transitions. [2018-11-29 00:11:49,269 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-29 00:11:49,270 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 68 states and 88 transitions. [2018-11-29 00:11:49,270 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-29 00:11:49,270 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-29 00:11:49,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 88 transitions. [2018-11-29 00:11:49,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:11:49,270 INFO L705 BuchiCegarLoop]: Abstraction has 68 states and 88 transitions. [2018-11-29 00:11:49,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 88 transitions. [2018-11-29 00:11:49,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 40. [2018-11-29 00:11:49,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-29 00:11:49,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 54 transitions. [2018-11-29 00:11:49,278 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 54 transitions. [2018-11-29 00:11:49,278 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 54 transitions. [2018-11-29 00:11:49,278 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-29 00:11:49,278 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 54 transitions. [2018-11-29 00:11:49,279 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-29 00:11:49,279 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:11:49,279 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:11:49,280 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:11:49,280 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-29 00:11:49,280 INFO L794 eck$LassoCheckResult]: Stem: 1096#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1094#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; 1095#L559 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1099#L559-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(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; 1100#L543-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; 1101#L547-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); 1132#L549 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 1129#L547-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1126#L547-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); 1124#L549 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 1122#L547-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1120#L547-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); 1113#L549 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 1118#L547-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1112#L547-3 assume !(SelectionSort_~j~0 < SelectionSort_~array_size); 1111#L547-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); 1097#L543-2 SelectionSort_#t~pre2 := 1 + SelectionSort_~i~0;SelectionSort_~i~0 := 1 + SelectionSort_~i~0;havoc SelectionSort_#t~pre2; 1098#L543-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; 1102#L547-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); 1107#L549 [2018-11-29 00:11:49,281 INFO L796 eck$LassoCheckResult]: Loop: 1107#L549 assume !(SelectionSort_#t~mem4 < SelectionSort_#t~mem5);havoc SelectionSort_#t~mem4;havoc SelectionSort_#t~mem5; 1103#L547-2 SelectionSort_#t~pre3 := 1 + SelectionSort_~j~0;SelectionSort_~j~0 := 1 + SelectionSort_~j~0;havoc SelectionSort_#t~pre3; 1104#L547-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); 1107#L549 [2018-11-29 00:11:49,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:49,281 INFO L82 PathProgramCache]: Analyzing trace with hash -960712718, now seen corresponding path program 3 times [2018-11-29 00:11:49,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:49,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:49,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:49,286 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:11:49,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:49,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:49,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:49,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:49,334 INFO L82 PathProgramCache]: Analyzing trace with hash 59638, now seen corresponding path program 2 times [2018-11-29 00:11:49,335 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:49,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:49,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:49,343 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:11:49,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:49,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:49,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:49,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:49,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1069508453, now seen corresponding path program 4 times [2018-11-29 00:11:49,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:11:49,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:11:49,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:49,352 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:11:49,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:11:49,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:49,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:11:49,677 WARN L180 SmtUtils]: Spent 270.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-29 00:11:50,437 WARN L180 SmtUtils]: Spent 691.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 127 [2018-11-29 00:11:50,542 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:11:50,542 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:11:50,543 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:11:50,543 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:11:50,543 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:11:50,543 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:11:50,543 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:11:50,543 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:11:50,544 INFO L131 ssoRankerPreferences]: Filename of dumped script: selectionsort-alloca_true-valid-memsafety_true-termination.i_Iteration8_Lasso [2018-11-29 00:11:50,544 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:11:50,544 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:11:50,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:50,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:50,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:50,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:50,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:50,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:50,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:50,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:50,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:50,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:11:50,856 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2018-11-29 00:11:51,282 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:11:51,282 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:11:51,283 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 [2018-11-29 00:11:51,283 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:51,283 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:51,283 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:51,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:51,287 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:51,287 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:51,287 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:51,288 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:51,290 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 [2018-11-29 00:11:51,290 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:51,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:51,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:51,291 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:51,292 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:51,292 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:51,296 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:51,296 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 [2018-11-29 00:11:51,297 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:51,297 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:51,297 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:51,297 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:51,297 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:51,301 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:51,301 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:51,302 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:51,302 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 [2018-11-29 00:11:51,302 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:51,302 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:51,303 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:51,306 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:51,306 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:51,306 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:51,306 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:51,307 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:51,307 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 [2018-11-29 00:11:51,307 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:51,308 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:51,308 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:51,308 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:51,308 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:51,308 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:51,308 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:51,312 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:51,312 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 [2018-11-29 00:11:51,313 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:51,313 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:51,313 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:51,313 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:51,313 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:51,313 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:51,313 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:51,314 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:51,314 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 [2018-11-29 00:11:51,314 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:51,315 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:51,315 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:51,315 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:51,316 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:51,316 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:51,322 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:51,323 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 [2018-11-29 00:11:51,323 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:51,323 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:51,324 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:51,324 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:51,324 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:51,324 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:51,324 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:51,327 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:51,327 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 [2018-11-29 00:11:51,328 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:51,328 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:11:51,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:51,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:51,328 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:51,330 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:11:51,330 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:11:51,330 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:51,331 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 [2018-11-29 00:11:51,331 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:51,331 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-29 00:11:51,332 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:51,336 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:51,337 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:11:51,337 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:51,346 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:51,347 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 [2018-11-29 00:11:51,347 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:51,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:51,348 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:51,348 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:51,349 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:51,349 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:51,355 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:51,355 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 [2018-11-29 00:11:51,359 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:51,359 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:51,359 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:51,359 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:51,360 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:51,360 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:51,365 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:51,365 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 [2018-11-29 00:11:51,366 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:51,366 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:51,366 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:51,366 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:51,367 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:51,371 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:51,382 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:51,382 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 [2018-11-29 00:11:51,383 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:51,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:51,383 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:51,383 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:51,384 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:51,384 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:51,385 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:11:51,385 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 [2018-11-29 00:11:51,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:11:51,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:11:51,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:11:51,386 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:11:51,389 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:11:51,389 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:11:51,415 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:11:51,440 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-29 00:11:51,440 INFO L444 ModelExtractionUtils]: 28 out of 37 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-29 00:11:51,441 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:11:51,441 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-29 00:11:51,444 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:11:51,444 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 [] [2018-11-29 00:11:51,626 INFO L297 tatePredicateManager]: 13 out of 13 supporting invariants were superfluous and have been removed [2018-11-29 00:11:51,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:51,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:51,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:51,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:51,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:51,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:11:51,758 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 [2018-11-29 00:11:51,758 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 54 transitions. cyclomatic complexity: 17 Second operand 4 states. [2018-11-29 00:11:51,785 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 54 transitions. cyclomatic complexity: 17. Second operand 4 states. Result 85 states and 111 transitions. Complement of second has 7 states. [2018-11-29 00:11:51,786 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 [2018-11-29 00:11:51,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-29 00:11:51,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-11-29 00:11:51,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 19 letters. Loop has 3 letters. [2018-11-29 00:11:51,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:51,787 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:11:51,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:51,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:51,835 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:51,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:51,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:51,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:11:51,855 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 [2018-11-29 00:11:51,855 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 54 transitions. cyclomatic complexity: 17 Second operand 4 states. [2018-11-29 00:11:51,889 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 54 transitions. cyclomatic complexity: 17. Second operand 4 states. Result 85 states and 111 transitions. Complement of second has 7 states. [2018-11-29 00:11:51,895 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 [2018-11-29 00:11:51,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-29 00:11:51,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-11-29 00:11:51,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 19 letters. Loop has 3 letters. [2018-11-29 00:11:51,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:51,896 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:11:51,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:11:51,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:51,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:51,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:11:51,956 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:11:51,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:11:51,975 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 [2018-11-29 00:11:51,975 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 54 transitions. cyclomatic complexity: 17 Second operand 4 states. [2018-11-29 00:11:52,034 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 54 transitions. cyclomatic complexity: 17. Second operand 4 states. Result 66 states and 83 transitions. Complement of second has 6 states. [2018-11-29 00:11:52,037 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 [2018-11-29 00:11:52,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-29 00:11:52,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2018-11-29 00:11:52,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 19 letters. Loop has 3 letters. [2018-11-29 00:11:52,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:52,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 22 letters. Loop has 3 letters. [2018-11-29 00:11:52,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:52,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 19 letters. Loop has 6 letters. [2018-11-29 00:11:52,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:11:52,043 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 83 transitions. [2018-11-29 00:11:52,044 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:11:52,044 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 0 states and 0 transitions. [2018-11-29 00:11:52,044 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-29 00:11:52,044 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-29 00:11:52,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-29 00:11:52,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:11:52,045 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:11:52,045 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:11:52,045 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:11:52,045 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-29 00:11:52,045 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-29 00:11:52,045 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:11:52,046 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-29 00:11:52,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.11 12:11:52 BoogieIcfgContainer [2018-11-29 00:11:52,053 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-29 00:11:52,053 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-29 00:11:52,053 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-29 00:11:52,054 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-29 00:11:52,054 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:11:38" (3/4) ... [2018-11-29 00:11:52,058 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-29 00:11:52,058 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-29 00:11:52,059 INFO L168 Benchmark]: Toolchain (without parser) took 14630.28 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 313.0 MB). Free memory was 947.3 MB in the beginning and 847.8 MB in the end (delta: 99.5 MB). Peak memory consumption was 412.5 MB. Max. memory is 11.5 GB. [2018-11-29 00:11:52,060 INFO L168 Benchmark]: CDTParser took 0.34 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:11:52,061 INFO L168 Benchmark]: CACSL2BoogieTranslator took 611.83 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 925.8 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-29 00:11:52,062 INFO L168 Benchmark]: Boogie Procedure Inliner took 125.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 925.8 MB in the beginning and 1.1 GB in the end (delta: -207.7 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2018-11-29 00:11:52,063 INFO L168 Benchmark]: Boogie Preprocessor took 35.16 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:11:52,063 INFO L168 Benchmark]: RCFGBuilder took 442.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2018-11-29 00:11:52,064 INFO L168 Benchmark]: BuchiAutomizer took 13405.37 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 167.8 MB). Free memory was 1.1 GB in the beginning and 847.8 MB in the end (delta: 268.0 MB). Peak memory consumption was 435.8 MB. Max. memory is 11.5 GB. [2018-11-29 00:11:52,065 INFO L168 Benchmark]: Witness Printer took 5.10 ms. Allocated memory is still 1.3 GB. Free memory is still 847.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:11:52,070 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.34 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 611.83 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 925.8 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 125.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 925.8 MB in the beginning and 1.1 GB in the end (delta: -207.7 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.16 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 442.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 13405.37 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 167.8 MB). Free memory was 1.1 GB in the beginning and 847.8 MB in the end (delta: 268.0 MB). Peak memory consumption was 435.8 MB. Max. memory is 11.5 GB. * Witness Printer took 5.10 ms. Allocated memory is still 1.3 GB. Free memory is still 847.8 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 - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (4 trivial, 2 deterministic, 2 nondeterministic). One deterministic module has affine ranking function -4 * i + -1 * a + unknown-#length-unknown[a] and consists of 4 locations. One deterministic module has affine ranking function -4 * j + -1 * a + unknown-#length-unknown[a] and consists of 4 locations. One nondeterministic module has affine ranking function 4 * array_size + -4 * min + unknown-#length-unknown[a] and consists of 5 locations. One nondeterministic module has affine ranking function -1 * j + array_size and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 17 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 13.3s and 9 iterations. TraceHistogramMax:4. Analysis of lassos took 10.0s. Construction of modules took 0.7s. Büchi inclusion checks took 2.4s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 47 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 40 states and ocurred in iteration 7. Nontrivial modules had stage [2, 0, 1, 1, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/1 HoareTripleCheckerStatistics: 140 SDtfs, 213 SDslu, 95 SDs, 0 SdLazy, 258 SolverSat, 75 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital190 mio100 ax100 hnf99 lsp95 ukn76 mio100 lsp68 div100 bol100 ite100 ukn100 eq169 hnf84 smp94 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 15ms VariablesStem: 4 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...